./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label56.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:58:49,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:58:49,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:58:49,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:58:49,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:58:49,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:58:49,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:58:49,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:58:49,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:58:49,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:58:49,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:58:49,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:58:49,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:58:49,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:58:49,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:58:49,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:58:49,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:58:49,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:58:49,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:58:49,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:58:49,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:58:49,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:58:49,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:58:49,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:58:49,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:58:49,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:58:49,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:58:49,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:58:49,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:58:49,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:58:49,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:58:49,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:58:49,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:58:49,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:58:49,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:58:49,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:58:49,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:58:49,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:58:49,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:58:49,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:58:49,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:58:49,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:58:49,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:58:49,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:58:49,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:58:49,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:58:49,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:58:49,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:58:49,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:58:49,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:58:49,468 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:58:49,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:58:49,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:58:49,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:58:49,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:58:49,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:58:49,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:58:49,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:58:49,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:58:49,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:58:49,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:58:49,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:58:49,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:58:49,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:58:49,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:58:49,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:58:49,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:49,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:58:49,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:58:49,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:58:49,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a [2022-11-02 20:58:49,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:58:49,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:58:49,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:58:49,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:58:49,755 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:58:49,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2022-11-02 20:58:49,827 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/data/a76246614/42b90c15242b4712bfc3955e4b4431db/FLAG4399cc87d [2022-11-02 20:58:50,528 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:58:50,529 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2022-11-02 20:58:50,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/data/a76246614/42b90c15242b4712bfc3955e4b4431db/FLAG4399cc87d [2022-11-02 20:58:50,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/data/a76246614/42b90c15242b4712bfc3955e4b4431db [2022-11-02 20:58:50,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:58:50,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:58:50,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:50,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:58:50,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:58:50,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:50" (1/1) ... [2022-11-02 20:58:50,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23de925e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:50, skipping insertion in model container [2022-11-02 20:58:50,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:50" (1/1) ... [2022-11-02 20:58:50,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:58:50,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:58:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/sv-benchmarks/c/eca-rers2012/Problem11_label56.c[5994,6007] [2022-11-02 20:58:51,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:51,564 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:58:51,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/sv-benchmarks/c/eca-rers2012/Problem11_label56.c[5994,6007] [2022-11-02 20:58:51,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:51,880 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:58:51,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51 WrapperNode [2022-11-02 20:58:51,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:51,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:51,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:58:51,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:58:51,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:51,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,098 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-11-02 20:58:52,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:52,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:58:52,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:58:52,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:58:52,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,298 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:58:52,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:58:52,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:58:52,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:58:52,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (1/1) ... [2022-11-02 20:58:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:52,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:58:52,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:58:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:58:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:58:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:58:52,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:58:52,524 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:58:52,527 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:58:54,604 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:58:54,623 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:58:54,623 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:58:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:54 BoogieIcfgContainer [2022-11-02 20:58:54,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:58:54,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:58:54,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:58:54,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:58:54,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:58:50" (1/3) ... [2022-11-02 20:58:54,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd92586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:54, skipping insertion in model container [2022-11-02 20:58:54,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:51" (2/3) ... [2022-11-02 20:58:54,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd92586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:54, skipping insertion in model container [2022-11-02 20:58:54,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:54" (3/3) ... [2022-11-02 20:58:54,636 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label56.c [2022-11-02 20:58:54,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:58:54,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:58:54,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:54,746 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@61a67cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:54,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:58:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:58:54,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:54,768 INFO L195 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] [2022-11-02 20:58:54,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 751578873, now seen corresponding path program 1 times [2022-11-02 20:58:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:54,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642216870] [2022-11-02 20:58:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:55,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642216870] [2022-11-02 20:58:55,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642216870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:55,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:55,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324454015] [2022-11-02 20:58:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:55,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:55,402 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:57,022 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2022-11-02 20:58:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-11-02 20:58:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:57,048 INFO L225 Difference]: With dead ends: 776 [2022-11-02 20:58:57,049 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 20:58:57,058 INFO L412 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 [2022-11-02 20:58:57,062 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 186 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:57,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:58:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 20:58:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2022-11-02 20:58:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2022-11-02 20:58:57,159 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 41 [2022-11-02 20:58:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:57,160 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2022-11-02 20:58:57,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2022-11-02 20:58:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:58:57,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:57,164 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:57,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:58:57,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:57,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1616931328, now seen corresponding path program 1 times [2022-11-02 20:58:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:57,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299723833] [2022-11-02 20:58:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:57,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299723833] [2022-11-02 20:58:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299723833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:57,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537030930] [2022-11-02 20:58:57,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:57,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:57,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:57,552 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:58,888 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2022-11-02 20:58:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:58,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-11-02 20:58:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:58,894 INFO L225 Difference]: With dead ends: 1209 [2022-11-02 20:58:58,894 INFO L226 Difference]: Without dead ends: 800 [2022-11-02 20:58:58,895 INFO L412 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 [2022-11-02 20:58:58,897 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:58,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:58:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-02 20:58:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2022-11-02 20:58:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 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) [2022-11-02 20:58:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2022-11-02 20:58:58,959 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 109 [2022-11-02 20:58:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:58,960 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2022-11-02 20:58:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2022-11-02 20:58:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:58:58,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:58,965 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:58,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:58:58,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1753081093, now seen corresponding path program 1 times [2022-11-02 20:58:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:58,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057162763] [2022-11-02 20:58:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:59,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057162763] [2022-11-02 20:58:59,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057162763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:59,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:59,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271844998] [2022-11-02 20:58:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:59,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:59,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:59,464 INFO L87 Difference]: Start difference. First operand 787 states and 1088 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) [2022-11-02 20:59:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:00,666 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2022-11-02 20:59:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:00,667 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 [2022-11-02 20:59:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:00,672 INFO L225 Difference]: With dead ends: 1942 [2022-11-02 20:59:00,672 INFO L226 Difference]: Without dead ends: 1157 [2022-11-02 20:59:00,674 INFO L412 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 [2022-11-02 20:59:00,676 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:00,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:59:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-11-02 20:59:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2022-11-02 20:59:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2022-11-02 20:59:00,711 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 111 [2022-11-02 20:59:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:00,711 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2022-11-02 20:59:00,712 INFO L496 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) [2022-11-02 20:59:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2022-11-02 20:59:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-02 20:59:00,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:00,715 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:59:00,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash -299670212, now seen corresponding path program 1 times [2022-11-02 20:59:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:00,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609378619] [2022-11-02 20:59:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609378619] [2022-11-02 20:59:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609378619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:00,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:00,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879614409] [2022-11-02 20:59:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:00,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:00,971 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:02,148 INFO L93 Difference]: Finished difference Result 2691 states and 3513 transitions. [2022-11-02 20:59:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-11-02 20:59:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:02,157 INFO L225 Difference]: With dead ends: 2691 [2022-11-02 20:59:02,158 INFO L226 Difference]: Without dead ends: 1721 [2022-11-02 20:59:02,159 INFO L412 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 [2022-11-02 20:59:02,170 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:02,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:59:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-11-02 20:59:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2022-11-02 20:59:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.260641781270465) internal successors, (1925), 1527 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1925 transitions. [2022-11-02 20:59:02,215 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1925 transitions. Word has length 153 [2022-11-02 20:59:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 1925 transitions. [2022-11-02 20:59:02,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1925 transitions. [2022-11-02 20:59:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-02 20:59:02,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:02,227 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:02,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:59:02,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 13927688, now seen corresponding path program 1 times [2022-11-02 20:59:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:02,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17008190] [2022-11-02 20:59:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-02 20:59:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:02,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17008190] [2022-11-02 20:59:02,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17008190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:02,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:02,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623071575] [2022-11-02 20:59:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:02,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:02,829 INFO L87 Difference]: Start difference. First operand 1528 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:04,104 INFO L93 Difference]: Finished difference Result 4160 states and 5315 transitions. [2022-11-02 20:59:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:04,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 223 [2022-11-02 20:59:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:04,116 INFO L225 Difference]: With dead ends: 4160 [2022-11-02 20:59:04,117 INFO L226 Difference]: Without dead ends: 2634 [2022-11-02 20:59:04,119 INFO L412 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 [2022-11-02 20:59:04,120 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 173 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:04,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 352 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:59:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-11-02 20:59:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2022-11-02 20:59:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 1.2468666919863274) internal successors, (3283), 2633 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3283 transitions. [2022-11-02 20:59:04,184 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3283 transitions. Word has length 223 [2022-11-02 20:59:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:04,185 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 3283 transitions. [2022-11-02 20:59:04,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3283 transitions. [2022-11-02 20:59:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-02 20:59:04,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:04,191 INFO L195 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, 2, 2, 2, 2, 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] [2022-11-02 20:59:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:59:04,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1861643749, now seen corresponding path program 1 times [2022-11-02 20:59:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:04,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257701415] [2022-11-02 20:59:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:59:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257701415] [2022-11-02 20:59:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257701415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:04,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:04,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173930498] [2022-11-02 20:59:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:04,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:04,458 INFO L87 Difference]: Start difference. First operand 2634 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:05,568 INFO L93 Difference]: Finished difference Result 6553 states and 8157 transitions. [2022-11-02 20:59:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-11-02 20:59:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:05,583 INFO L225 Difference]: With dead ends: 6553 [2022-11-02 20:59:05,583 INFO L226 Difference]: Without dead ends: 3921 [2022-11-02 20:59:05,587 INFO L412 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 [2022-11-02 20:59:05,587 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:05,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2022-11-02 20:59:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3185. [2022-11-02 20:59:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.1699120603015076) internal successors, (3725), 3184 states have internal predecessors, (3725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 3725 transitions. [2022-11-02 20:59:05,671 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 3725 transitions. Word has length 234 [2022-11-02 20:59:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:05,672 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 3725 transitions. [2022-11-02 20:59:05,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 3725 transitions. [2022-11-02 20:59:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-11-02 20:59:05,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:05,677 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:05,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:59:05,678 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash 748674339, now seen corresponding path program 1 times [2022-11-02 20:59:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:05,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483550254] [2022-11-02 20:59:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-02 20:59:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483550254] [2022-11-02 20:59:05,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483550254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:05,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:05,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085541517] [2022-11-02 20:59:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:05,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:05,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:05,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:05,996 INFO L87 Difference]: Start difference. First operand 3185 states and 3725 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:07,321 INFO L93 Difference]: Finished difference Result 7108 states and 8338 transitions. [2022-11-02 20:59:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 250 [2022-11-02 20:59:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:07,338 INFO L225 Difference]: With dead ends: 7108 [2022-11-02 20:59:07,339 INFO L226 Difference]: Without dead ends: 3925 [2022-11-02 20:59:07,343 INFO L412 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 [2022-11-02 20:59:07,344 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 160 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:07,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 372 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:59:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2022-11-02 20:59:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3736. [2022-11-02 20:59:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3735 states have (on average 1.1606425702811245) internal successors, (4335), 3735 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 4335 transitions. [2022-11-02 20:59:07,469 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 4335 transitions. Word has length 250 [2022-11-02 20:59:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:07,470 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 4335 transitions. [2022-11-02 20:59:07,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 4335 transitions. [2022-11-02 20:59:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-11-02 20:59:07,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:07,478 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:07,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:59:07,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1804774869, now seen corresponding path program 1 times [2022-11-02 20:59:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027373045] [2022-11-02 20:59:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-02 20:59:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:07,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027373045] [2022-11-02 20:59:07,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027373045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:07,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:07,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017301426] [2022-11-02 20:59:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:07,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:07,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:07,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:07,959 INFO L87 Difference]: Start difference. First operand 3736 states and 4335 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:09,093 INFO L93 Difference]: Finished difference Result 8579 states and 9918 transitions. [2022-11-02 20:59:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 263 [2022-11-02 20:59:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:09,111 INFO L225 Difference]: With dead ends: 8579 [2022-11-02 20:59:09,112 INFO L226 Difference]: Without dead ends: 4845 [2022-11-02 20:59:09,116 INFO L412 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 [2022-11-02 20:59:09,117 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 179 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:09,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 390 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:59:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2022-11-02 20:59:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4844. [2022-11-02 20:59:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4844 states, 4843 states have (on average 1.1525913689861655) internal successors, (5582), 4843 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 5582 transitions. [2022-11-02 20:59:09,313 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 5582 transitions. Word has length 263 [2022-11-02 20:59:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:09,314 INFO L495 AbstractCegarLoop]: Abstraction has 4844 states and 5582 transitions. [2022-11-02 20:59:09,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 5582 transitions. [2022-11-02 20:59:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-11-02 20:59:09,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:09,321 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:09,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:59:09,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -789875443, now seen corresponding path program 1 times [2022-11-02 20:59:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:09,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517940129] [2022-11-02 20:59:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:09,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517940129] [2022-11-02 20:59:09,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517940129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:09,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:09,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136011365] [2022-11-02 20:59:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:09,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:59:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:59:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:59:09,895 INFO L87 Difference]: Start difference. First operand 4844 states and 5582 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:12,096 INFO L93 Difference]: Finished difference Result 13562 states and 15894 transitions. [2022-11-02 20:59:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:59:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2022-11-02 20:59:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:12,130 INFO L225 Difference]: With dead ends: 13562 [2022-11-02 20:59:12,130 INFO L226 Difference]: Without dead ends: 9088 [2022-11-02 20:59:12,136 INFO L412 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 [2022-11-02 20:59:12,137 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 206 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:12,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 130 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:59:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2022-11-02 20:59:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 8897. [2022-11-02 20:59:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8897 states, 8896 states have (on average 1.1535521582733812) internal successors, (10262), 8896 states have internal predecessors, (10262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 10262 transitions. [2022-11-02 20:59:12,362 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 10262 transitions. Word has length 272 [2022-11-02 20:59:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:12,363 INFO L495 AbstractCegarLoop]: Abstraction has 8897 states and 10262 transitions. [2022-11-02 20:59:12,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 10262 transitions. [2022-11-02 20:59:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-11-02 20:59:12,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:12,372 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:59:12,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1520405194, now seen corresponding path program 1 times [2022-11-02 20:59:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374797753] [2022-11-02 20:59:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-02 20:59:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:12,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374797753] [2022-11-02 20:59:12,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374797753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:12,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427183343] [2022-11-02 20:59:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:12,633 INFO L87 Difference]: Start difference. First operand 8897 states and 10262 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:13,944 INFO L93 Difference]: Finished difference Result 19635 states and 22699 transitions. [2022-11-02 20:59:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 300 [2022-11-02 20:59:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:13,968 INFO L225 Difference]: With dead ends: 19635 [2022-11-02 20:59:13,968 INFO L226 Difference]: Without dead ends: 11108 [2022-11-02 20:59:13,978 INFO L412 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 [2022-11-02 20:59:13,979 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 195 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:13,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 72 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:59:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2022-11-02 20:59:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 10737. [2022-11-02 20:59:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10736 states have (on average 1.1461438152011922) internal successors, (12305), 10736 states have internal predecessors, (12305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 12305 transitions. [2022-11-02 20:59:14,190 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 12305 transitions. Word has length 300 [2022-11-02 20:59:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:14,191 INFO L495 AbstractCegarLoop]: Abstraction has 10737 states and 12305 transitions. [2022-11-02 20:59:14,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 12305 transitions. [2022-11-02 20:59:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-11-02 20:59:14,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:14,200 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:59:14,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:59:14,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash -582865195, now seen corresponding path program 1 times [2022-11-02 20:59:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:14,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444982010] [2022-11-02 20:59:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-11-02 20:59:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:14,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444982010] [2022-11-02 20:59:14,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444982010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394064007] [2022-11-02 20:59:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:14,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:14,565 INFO L87 Difference]: Start difference. First operand 10737 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:15,776 INFO L93 Difference]: Finished difference Result 23502 states and 26923 transitions. [2022-11-02 20:59:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2022-11-02 20:59:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:15,810 INFO L225 Difference]: With dead ends: 23502 [2022-11-02 20:59:15,810 INFO L226 Difference]: Without dead ends: 13135 [2022-11-02 20:59:15,824 INFO L412 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 [2022-11-02 20:59:15,825 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 73 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:15,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:59:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2022-11-02 20:59:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 10737. [2022-11-02 20:59:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10736 states have (on average 1.1461438152011922) internal successors, (12305), 10736 states have internal predecessors, (12305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 12305 transitions. [2022-11-02 20:59:16,109 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 12305 transitions. Word has length 302 [2022-11-02 20:59:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:16,110 INFO L495 AbstractCegarLoop]: Abstraction has 10737 states and 12305 transitions. [2022-11-02 20:59:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 12305 transitions. [2022-11-02 20:59:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-11-02 20:59:16,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:16,126 INFO L195 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:16,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:59:16,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2113040803, now seen corresponding path program 1 times [2022-11-02 20:59:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:16,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319495536] [2022-11-02 20:59:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:59:16,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:16,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319495536] [2022-11-02 20:59:16,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319495536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:16,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:16,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777340208] [2022-11-02 20:59:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:16,488 INFO L87 Difference]: Start difference. First operand 10737 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:17,581 INFO L93 Difference]: Finished difference Result 21102 states and 24226 transitions. [2022-11-02 20:59:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 377 [2022-11-02 20:59:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:17,608 INFO L225 Difference]: With dead ends: 21102 [2022-11-02 20:59:17,608 INFO L226 Difference]: Without dead ends: 10735 [2022-11-02 20:59:17,617 INFO L412 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 [2022-11-02 20:59:17,618 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:17,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2022-11-02 20:59:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 10735. [2022-11-02 20:59:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10735 states, 10734 states have (on average 1.1424445686603317) internal successors, (12263), 10734 states have internal predecessors, (12263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10735 states to 10735 states and 12263 transitions. [2022-11-02 20:59:17,806 INFO L78 Accepts]: Start accepts. Automaton has 10735 states and 12263 transitions. Word has length 377 [2022-11-02 20:59:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:17,807 INFO L495 AbstractCegarLoop]: Abstraction has 10735 states and 12263 transitions. [2022-11-02 20:59:17,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10735 states and 12263 transitions. [2022-11-02 20:59:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2022-11-02 20:59:17,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:17,829 INFO L195 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:59:17,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:59:17,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash 231637248, now seen corresponding path program 1 times [2022-11-02 20:59:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:17,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991890281] [2022-11-02 20:59:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-02 20:59:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991890281] [2022-11-02 20:59:18,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991890281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:18,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:18,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218322592] [2022-11-02 20:59:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:18,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:18,155 INFO L87 Difference]: Start difference. First operand 10735 states and 12263 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:19,186 INFO L93 Difference]: Finished difference Result 22755 states and 26004 transitions. [2022-11-02 20:59:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 391 [2022-11-02 20:59:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:19,215 INFO L225 Difference]: With dead ends: 22755 [2022-11-02 20:59:19,215 INFO L226 Difference]: Without dead ends: 12390 [2022-11-02 20:59:19,225 INFO L412 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 [2022-11-02 20:59:19,226 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 178 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 151 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.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:19,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:59:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12390 states. [2022-11-02 20:59:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12390 to 8522. [2022-11-02 20:59:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8522 states, 8521 states have (on average 1.1475178969604507) internal successors, (9778), 8521 states have internal predecessors, (9778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8522 states to 8522 states and 9778 transitions. [2022-11-02 20:59:19,469 INFO L78 Accepts]: Start accepts. Automaton has 8522 states and 9778 transitions. Word has length 391 [2022-11-02 20:59:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:19,470 INFO L495 AbstractCegarLoop]: Abstraction has 8522 states and 9778 transitions. [2022-11-02 20:59:19,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8522 states and 9778 transitions. [2022-11-02 20:59:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-11-02 20:59:19,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:19,486 INFO L195 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:19,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:59:19,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1234284050, now seen corresponding path program 1 times [2022-11-02 20:59:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620256483] [2022-11-02 20:59:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-02 20:59:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620256483] [2022-11-02 20:59:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620256483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:19,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:19,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697056451] [2022-11-02 20:59:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:19,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:19,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:19,967 INFO L87 Difference]: Start difference. First operand 8522 states and 9778 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:21,056 INFO L93 Difference]: Finished difference Result 18529 states and 21265 transitions. [2022-11-02 20:59:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 413 [2022-11-02 20:59:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:21,078 INFO L225 Difference]: With dead ends: 18529 [2022-11-02 20:59:21,079 INFO L226 Difference]: Without dead ends: 10009 [2022-11-02 20:59:21,086 INFO L412 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 [2022-11-02 20:59:21,087 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:21,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10009 states. [2022-11-02 20:59:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10009 to 9810. [2022-11-02 20:59:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9810 states, 9809 states have (on average 1.1300846161688245) internal successors, (11085), 9809 states have internal predecessors, (11085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 11085 transitions. [2022-11-02 20:59:21,317 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 11085 transitions. Word has length 413 [2022-11-02 20:59:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:21,318 INFO L495 AbstractCegarLoop]: Abstraction has 9810 states and 11085 transitions. [2022-11-02 20:59:21,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 11085 transitions. [2022-11-02 20:59:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-11-02 20:59:21,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:21,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:21,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:59:21,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -187531985, now seen corresponding path program 1 times [2022-11-02 20:59:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:21,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746656020] [2022-11-02 20:59:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-11-02 20:59:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746656020] [2022-11-02 20:59:21,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746656020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:21,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:21,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090777824] [2022-11-02 20:59:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:21,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:21,837 INFO L87 Difference]: Start difference. First operand 9810 states and 11085 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:22,913 INFO L93 Difference]: Finished difference Result 19444 states and 21991 transitions. [2022-11-02 20:59:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 494 [2022-11-02 20:59:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:22,930 INFO L225 Difference]: With dead ends: 19444 [2022-11-02 20:59:22,931 INFO L226 Difference]: Without dead ends: 9818 [2022-11-02 20:59:22,938 INFO L412 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 [2022-11-02 20:59:22,938 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 63 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:22,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 360 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9818 states. [2022-11-02 20:59:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9818 to 9808. [2022-11-02 20:59:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9808 states, 9807 states have (on average 1.1007443662689915) internal successors, (10795), 9807 states have internal predecessors, (10795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9808 states to 9808 states and 10795 transitions. [2022-11-02 20:59:23,173 INFO L78 Accepts]: Start accepts. Automaton has 9808 states and 10795 transitions. Word has length 494 [2022-11-02 20:59:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:23,174 INFO L495 AbstractCegarLoop]: Abstraction has 9808 states and 10795 transitions. [2022-11-02 20:59:23,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9808 states and 10795 transitions. [2022-11-02 20:59:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2022-11-02 20:59:23,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:23,196 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:59:23,197 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:23,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1135290674, now seen corresponding path program 1 times [2022-11-02 20:59:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384756721] [2022-11-02 20:59:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-02 20:59:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384756721] [2022-11-02 20:59:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384756721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:23,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182029572] [2022-11-02 20:59:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:23,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:23,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:23,928 INFO L87 Difference]: Start difference. First operand 9808 states and 10795 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:24,995 INFO L93 Difference]: Finished difference Result 21280 states and 23445 transitions. [2022-11-02 20:59:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:24,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 501 [2022-11-02 20:59:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:25,011 INFO L225 Difference]: With dead ends: 21280 [2022-11-02 20:59:25,011 INFO L226 Difference]: Without dead ends: 11842 [2022-11-02 20:59:25,017 INFO L412 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 [2022-11-02 20:59:25,018 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:25,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 126 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2022-11-02 20:59:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 10917. [2022-11-02 20:59:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10917 states, 10916 states have (on average 1.0979296445584463) internal successors, (11985), 10916 states have internal predecessors, (11985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 11985 transitions. [2022-11-02 20:59:25,193 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 11985 transitions. Word has length 501 [2022-11-02 20:59:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:25,194 INFO L495 AbstractCegarLoop]: Abstraction has 10917 states and 11985 transitions. [2022-11-02 20:59:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 11985 transitions. [2022-11-02 20:59:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2022-11-02 20:59:25,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:25,284 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:25,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:59:25,285 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:25,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1489523097, now seen corresponding path program 1 times [2022-11-02 20:59:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:25,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390908568] [2022-11-02 20:59:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-02 20:59:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:26,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390908568] [2022-11-02 20:59:26,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390908568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:26,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:26,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:26,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451855864] [2022-11-02 20:59:26,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:26,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:59:26,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:59:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:59:26,170 INFO L87 Difference]: Start difference. First operand 10917 states and 11985 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:27,759 INFO L93 Difference]: Finished difference Result 28476 states and 31258 transitions. [2022-11-02 20:59:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:59:27,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 511 [2022-11-02 20:59:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:27,782 INFO L225 Difference]: With dead ends: 28476 [2022-11-02 20:59:27,782 INFO L226 Difference]: Without dead ends: 17377 [2022-11-02 20:59:27,791 INFO L412 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 [2022-11-02 20:59:27,792 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 202 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:27,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 81 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:59:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17377 states. [2022-11-02 20:59:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17377 to 16455. [2022-11-02 20:59:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16455 states, 16454 states have (on average 1.092378752886836) internal successors, (17974), 16454 states have internal predecessors, (17974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16455 states to 16455 states and 17974 transitions. [2022-11-02 20:59:28,132 INFO L78 Accepts]: Start accepts. Automaton has 16455 states and 17974 transitions. Word has length 511 [2022-11-02 20:59:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:28,132 INFO L495 AbstractCegarLoop]: Abstraction has 16455 states and 17974 transitions. [2022-11-02 20:59:28,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16455 states and 17974 transitions. [2022-11-02 20:59:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2022-11-02 20:59:28,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:28,159 INFO L195 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:28,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:59:28,160 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -430183781, now seen corresponding path program 1 times [2022-11-02 20:59:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157652835] [2022-11-02 20:59:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-11-02 20:59:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157652835] [2022-11-02 20:59:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157652835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:29,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095867412] [2022-11-02 20:59:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:29,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:29,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:29,142 INFO L87 Difference]: Start difference. First operand 16455 states and 17974 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:30,230 INFO L93 Difference]: Finished difference Result 34205 states and 37381 transitions. [2022-11-02 20:59:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 607 [2022-11-02 20:59:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:30,252 INFO L225 Difference]: With dead ends: 34205 [2022-11-02 20:59:30,252 INFO L226 Difference]: Without dead ends: 18120 [2022-11-02 20:59:30,264 INFO L412 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 [2022-11-02 20:59:30,265 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:30,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 141 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:59:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18120 states. [2022-11-02 20:59:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18120 to 16271. [2022-11-02 20:59:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16271 states, 16270 states have (on average 1.0920712968653965) internal successors, (17768), 16270 states have internal predecessors, (17768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16271 states to 16271 states and 17768 transitions. [2022-11-02 20:59:30,549 INFO L78 Accepts]: Start accepts. Automaton has 16271 states and 17768 transitions. Word has length 607 [2022-11-02 20:59:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:30,549 INFO L495 AbstractCegarLoop]: Abstraction has 16271 states and 17768 transitions. [2022-11-02 20:59:30,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 16271 states and 17768 transitions. [2022-11-02 20:59:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2022-11-02 20:59:30,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:30,572 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:59:30,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 522658155, now seen corresponding path program 1 times [2022-11-02 20:59:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888322571] [2022-11-02 20:59:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2022-11-02 20:59:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888322571] [2022-11-02 20:59:31,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888322571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:31,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:31,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525379444] [2022-11-02 20:59:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:31,149 INFO L87 Difference]: Start difference. First operand 16271 states and 17768 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:32,307 INFO L93 Difference]: Finished difference Result 33827 states and 36954 transitions. [2022-11-02 20:59:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:32,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 635 [2022-11-02 20:59:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:32,325 INFO L225 Difference]: With dead ends: 33827 [2022-11-02 20:59:32,325 INFO L226 Difference]: Without dead ends: 17926 [2022-11-02 20:59:32,336 INFO L412 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 [2022-11-02 20:59:32,337 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 66 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:32,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 337 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:59:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17926 states. [2022-11-02 20:59:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17926 to 14972. [2022-11-02 20:59:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14972 states, 14971 states have (on average 1.09030792866208) internal successors, (16323), 14971 states have internal predecessors, (16323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14972 states to 14972 states and 16323 transitions. [2022-11-02 20:59:32,638 INFO L78 Accepts]: Start accepts. Automaton has 14972 states and 16323 transitions. Word has length 635 [2022-11-02 20:59:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:32,639 INFO L495 AbstractCegarLoop]: Abstraction has 14972 states and 16323 transitions. [2022-11-02 20:59:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14972 states and 16323 transitions. [2022-11-02 20:59:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2022-11-02 20:59:32,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:32,664 INFO L195 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:32,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:59:32,664 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:32,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1081395098, now seen corresponding path program 1 times [2022-11-02 20:59:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:32,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66950532] [2022-11-02 20:59:32,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:32,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-11-02 20:59:34,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:34,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66950532] [2022-11-02 20:59:34,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66950532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:34,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:34,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:59:34,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796284329] [2022-11-02 20:59:34,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:34,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:59:34,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:34,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:59:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:59:34,823 INFO L87 Difference]: Start difference. First operand 14972 states and 16323 transitions. Second operand has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:37,293 INFO L93 Difference]: Finished difference Result 35774 states and 38939 transitions. [2022-11-02 20:59:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:59:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 662 [2022-11-02 20:59:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:37,316 INFO L225 Difference]: With dead ends: 35774 [2022-11-02 20:59:37,316 INFO L226 Difference]: Without dead ends: 21172 [2022-11-02 20:59:37,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:37,330 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 292 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:37,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 192 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:59:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21172 states. [2022-11-02 20:59:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21172 to 20681. [2022-11-02 20:59:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20681 states, 20680 states have (on average 1.0872823984526112) internal successors, (22485), 20680 states have internal predecessors, (22485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20681 states to 20681 states and 22485 transitions. [2022-11-02 20:59:37,657 INFO L78 Accepts]: Start accepts. Automaton has 20681 states and 22485 transitions. Word has length 662 [2022-11-02 20:59:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:37,658 INFO L495 AbstractCegarLoop]: Abstraction has 20681 states and 22485 transitions. [2022-11-02 20:59:37,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 20681 states and 22485 transitions. [2022-11-02 20:59:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2022-11-02 20:59:37,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:37,688 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:37,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:59:37,688 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash -118562656, now seen corresponding path program 1 times [2022-11-02 20:59:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:37,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747948119] [2022-11-02 20:59:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2022-11-02 20:59:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:38,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747948119] [2022-11-02 20:59:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747948119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:38,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:38,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442907823] [2022-11-02 20:59:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:38,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:38,680 INFO L87 Difference]: Start difference. First operand 20681 states and 22485 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:39,818 INFO L93 Difference]: Finished difference Result 43382 states and 47189 transitions. [2022-11-02 20:59:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 670 [2022-11-02 20:59:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:39,842 INFO L225 Difference]: With dead ends: 43382 [2022-11-02 20:59:39,842 INFO L226 Difference]: Without dead ends: 23071 [2022-11-02 20:59:39,854 INFO L412 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 [2022-11-02 20:59:39,855 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:39,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 309 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:59:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23071 states. [2022-11-02 20:59:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23071 to 15523. [2022-11-02 20:59:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15523 states, 15522 states have (on average 1.089099342868187) internal successors, (16905), 15522 states have internal predecessors, (16905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15523 states to 15523 states and 16905 transitions. [2022-11-02 20:59:40,117 INFO L78 Accepts]: Start accepts. Automaton has 15523 states and 16905 transitions. Word has length 670 [2022-11-02 20:59:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:40,117 INFO L495 AbstractCegarLoop]: Abstraction has 15523 states and 16905 transitions. [2022-11-02 20:59:40,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15523 states and 16905 transitions. [2022-11-02 20:59:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2022-11-02 20:59:40,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:40,142 INFO L195 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:59:40,142 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2057566227, now seen corresponding path program 1 times [2022-11-02 20:59:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286265228] [2022-11-02 20:59:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 859 proven. 8 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-11-02 20:59:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286265228] [2022-11-02 20:59:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286265228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444301948] [2022-11-02 20:59:42,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:42,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:42,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:42,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:59:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:42,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:59:42,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-11-02 20:59:44,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-11-02 20:59:50,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444301948] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:50,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:50,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-11-02 20:59:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926761260] [2022-11-02 20:59:50,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:50,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:50,714 INFO L87 Difference]: Start difference. First operand 15523 states and 16905 transitions. Second operand has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:57,338 INFO L93 Difference]: Finished difference Result 37415 states and 40591 transitions. [2022-11-02 20:59:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:59:57,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 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 672 [2022-11-02 20:59:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:57,357 INFO L225 Difference]: With dead ends: 37415 [2022-11-02 20:59:57,358 INFO L226 Difference]: Without dead ends: 22070 [2022-11-02 20:59:57,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1375 GetRequests, 1340 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:59:57,367 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1460 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3691 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 3691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:57,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 168 Invalid, 4589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 3691 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 20:59:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22070 states. [2022-11-02 20:59:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22070 to 12200. [2022-11-02 20:59:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 12199 states have (on average 1.0650873022378884) internal successors, (12993), 12199 states have internal predecessors, (12993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 12993 transitions. [2022-11-02 20:59:57,657 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 12993 transitions. Word has length 672 [2022-11-02 20:59:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:57,657 INFO L495 AbstractCegarLoop]: Abstraction has 12200 states and 12993 transitions. [2022-11-02 20:59:57,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 12993 transitions. [2022-11-02 20:59:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2022-11-02 20:59:57,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:57,678 INFO L195 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:57,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:57,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:59:57,907 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash -896075539, now seen corresponding path program 1 times [2022-11-02 20:59:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817163258] [2022-11-02 20:59:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1039 proven. 64 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-02 20:59:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:58,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817163258] [2022-11-02 20:59:58,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817163258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:58,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007297739] [2022-11-02 20:59:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:58,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:58,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:58,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:58,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:59:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:59,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:59:59,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-02 20:59:59,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:59:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007297739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:59,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:59:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-02 20:59:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581596875] [2022-11-02 20:59:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:59,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:59:59,536 INFO L87 Difference]: Start difference. First operand 12200 states and 12993 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:00,701 INFO L93 Difference]: Finished difference Result 25329 states and 26993 transitions. [2022-11-02 21:00:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:00:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 687 [2022-11-02 21:00:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:00,719 INFO L225 Difference]: With dead ends: 25329 [2022-11-02 21:00:00,720 INFO L226 Difference]: Without dead ends: 13315 [2022-11-02 21:00:00,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:00,732 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:00,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 320 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:00:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2022-11-02 21:00:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 12200. [2022-11-02 21:00:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 12199 states have (on average 1.0624641364046232) internal successors, (12961), 12199 states have internal predecessors, (12961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 12961 transitions. [2022-11-02 21:00:00,953 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 12961 transitions. Word has length 687 [2022-11-02 21:00:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:00,954 INFO L495 AbstractCegarLoop]: Abstraction has 12200 states and 12961 transitions. [2022-11-02 21:00:00,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 12961 transitions. [2022-11-02 21:00:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2022-11-02 21:00:00,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:00,972 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:01,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:01,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:01,172 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1829428589, now seen corresponding path program 1 times [2022-11-02 21:00:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:01,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701395070] [2022-11-02 21:00:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 1192 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-11-02 21:00:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701395070] [2022-11-02 21:00:02,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701395070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:02,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:02,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:00:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477200265] [2022-11-02 21:00:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:02,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:00:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:00:02,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:00:02,073 INFO L87 Difference]: Start difference. First operand 12200 states and 12961 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:02,946 INFO L93 Difference]: Finished difference Result 25330 states and 26933 transitions. [2022-11-02 21:00:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:00:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 716 [2022-11-02 21:00:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:02,958 INFO L225 Difference]: With dead ends: 25330 [2022-11-02 21:00:02,958 INFO L226 Difference]: Without dead ends: 13500 [2022-11-02 21:00:02,964 INFO L412 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 [2022-11-02 21:00:02,965 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:02,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 102 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:00:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2022-11-02 21:00:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 12016. [2022-11-02 21:00:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0620058260507699) internal successors, (12760), 12015 states have internal predecessors, (12760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12760 transitions. [2022-11-02 21:00:03,101 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12760 transitions. Word has length 716 [2022-11-02 21:00:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:03,101 INFO L495 AbstractCegarLoop]: Abstraction has 12016 states and 12760 transitions. [2022-11-02 21:00:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12760 transitions. [2022-11-02 21:00:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2022-11-02 21:00:03,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:03,111 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:03,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:00:03,111 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -207250752, now seen corresponding path program 1 times [2022-11-02 21:00:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659381899] [2022-11-02 21:00:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-11-02 21:00:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:03,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659381899] [2022-11-02 21:00:03,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659381899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:03,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:03,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:00:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076906035] [2022-11-02 21:00:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:00:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:00:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:00:03,798 INFO L87 Difference]: Start difference. First operand 12016 states and 12760 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:04,755 INFO L93 Difference]: Finished difference Result 23106 states and 24550 transitions. [2022-11-02 21:00:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:00:04,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 750 [2022-11-02 21:00:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:04,766 INFO L225 Difference]: With dead ends: 23106 [2022-11-02 21:00:04,766 INFO L226 Difference]: Without dead ends: 11460 [2022-11-02 21:00:04,771 INFO L412 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 [2022-11-02 21:00:04,772 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 65 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:04,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 268 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:00:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2022-11-02 21:00:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 9616. [2022-11-02 21:00:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9616 states, 9615 states have (on average 1.0582423296931878) internal successors, (10175), 9615 states have internal predecessors, (10175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 10175 transitions. [2022-11-02 21:00:04,925 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 10175 transitions. Word has length 750 [2022-11-02 21:00:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:04,926 INFO L495 AbstractCegarLoop]: Abstraction has 9616 states and 10175 transitions. [2022-11-02 21:00:04,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 10175 transitions. [2022-11-02 21:00:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2022-11-02 21:00:04,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:04,937 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2022-11-02 21:00:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:00:04,938 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1393997085, now seen corresponding path program 1 times [2022-11-02 21:00:04,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:04,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670597403] [2022-11-02 21:00:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-11-02 21:00:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670597403] [2022-11-02 21:00:05,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670597403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:05,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:05,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:00:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069271022] [2022-11-02 21:00:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:05,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:00:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:00:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:00:05,849 INFO L87 Difference]: Start difference. First operand 9616 states and 10175 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:06,751 INFO L93 Difference]: Finished difference Result 19414 states and 20552 transitions. [2022-11-02 21:00:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:00:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 811 [2022-11-02 21:00:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:06,764 INFO L225 Difference]: With dead ends: 19414 [2022-11-02 21:00:06,764 INFO L226 Difference]: Without dead ends: 10352 [2022-11-02 21:00:06,771 INFO L412 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 [2022-11-02 21:00:06,772 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 108 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:06,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 339 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:00:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10352 states. [2022-11-02 21:00:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10352 to 9984. [2022-11-02 21:00:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9984 states, 9983 states have (on average 1.05719723530001) internal successors, (10554), 9983 states have internal predecessors, (10554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9984 states to 9984 states and 10554 transitions. [2022-11-02 21:00:06,921 INFO L78 Accepts]: Start accepts. Automaton has 9984 states and 10554 transitions. Word has length 811 [2022-11-02 21:00:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:06,922 INFO L495 AbstractCegarLoop]: Abstraction has 9984 states and 10554 transitions. [2022-11-02 21:00:06,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9984 states and 10554 transitions. [2022-11-02 21:00:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2022-11-02 21:00:06,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:06,939 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2022-11-02 21:00:06,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:00:06,939 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1330001783, now seen corresponding path program 1 times [2022-11-02 21:00:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898699095] [2022-11-02 21:00:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 1474 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-11-02 21:00:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:08,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898699095] [2022-11-02 21:00:08,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898699095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:08,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:08,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441829455] [2022-11-02 21:00:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:08,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:08,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:08,202 INFO L87 Difference]: Start difference. First operand 9984 states and 10554 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:09,745 INFO L93 Difference]: Finished difference Result 22926 states and 24206 transitions. [2022-11-02 21:00:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 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 816 [2022-11-02 21:00:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:09,757 INFO L225 Difference]: With dead ends: 22926 [2022-11-02 21:00:09,757 INFO L226 Difference]: Without dead ends: 12760 [2022-11-02 21:00:09,763 INFO L412 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 [2022-11-02 21:00:09,764 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 222 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:09,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 75 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 21:00:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12760 states. [2022-11-02 21:00:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12760 to 9066. [2022-11-02 21:00:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9066 states, 9065 states have (on average 1.0520683949255378) internal successors, (9537), 9065 states have internal predecessors, (9537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 9537 transitions. [2022-11-02 21:00:09,950 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 9537 transitions. Word has length 816 [2022-11-02 21:00:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:09,951 INFO L495 AbstractCegarLoop]: Abstraction has 9066 states and 9537 transitions. [2022-11-02 21:00:09,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 9537 transitions. [2022-11-02 21:00:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2022-11-02 21:00:09,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:09,963 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:09,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:00:09,963 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757454, now seen corresponding path program 1 times [2022-11-02 21:00:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377784766] [2022-11-02 21:00:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-11-02 21:00:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:11,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377784766] [2022-11-02 21:00:11,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377784766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:11,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:11,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459535573] [2022-11-02 21:00:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:11,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:11,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:11,270 INFO L87 Difference]: Start difference. First operand 9066 states and 9537 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:12,595 INFO L93 Difference]: Finished difference Result 15725 states and 16547 transitions. [2022-11-02 21:00:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 872 [2022-11-02 21:00:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:12,600 INFO L225 Difference]: With dead ends: 15725 [2022-11-02 21:00:12,600 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:00:12,605 INFO L412 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 [2022-11-02 21:00:12,606 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 223 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:12,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 41 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 21:00:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:00:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:00:12,608 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) [2022-11-02 21:00:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:00:12,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 872 [2022-11-02 21:00:12,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:12,608 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:00:12,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:00:12,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:00:12,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:00:12,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:00:12,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 21:01:08,760 WARN L234 SmtUtils]: Spent 56.14s on a formula simplification. DAG size of input: 895 DAG size of output: 892 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 21:01:59,680 WARN L234 SmtUtils]: Spent 50.91s on a formula simplification. DAG size of input: 895 DAG size of output: 892 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 21:02:06,482 WARN L234 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 892 DAG size of output: 114 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 21:02:13,283 WARN L234 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 892 DAG size of output: 114 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,287 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,289 INFO L899 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,289 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,290 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,290 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-02 21:02:13,290 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-11-02 21:02:13,290 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-02 21:02:13,291 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,291 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,291 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,291 INFO L899 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,291 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-02 21:02:13,292 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,293 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-11-02 21:02:13,294 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-02 21:02:13,295 INFO L899 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,295 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,295 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,298 INFO L895 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse20 (+ ~a23~0 43))) (let ((.cse13 (not (<= ~a23~0 306))) (.cse15 (<= 130 ~a29~0)) (.cse10 (<= ~a23~0 600000)) (.cse14 (<= ~a23~0 599997)) (.cse8 (<= 141 ~a29~0)) (.cse5 (= ~a25~0 12)) (.cse4 (<= (+ ~a23~0 55) 0)) (.cse18 (= ~a25~0 10)) (.cse12 (= ~a25~0 11)) (.cse3 (<= ~a29~0 130)) (.cse11 (<= 260 ~a29~0)) (.cse9 (<= ~a25~0 9)) (.cse1 (= ~a25~0 13)) (.cse19 (<= .cse20 0)) (.cse6 (<= ~a29~0 277)) (.cse7 (= ~a4~0 0)) (.cse17 (<= 246 ~a29~0)) (.cse16 (<= ~a25~0 10)) (.cse0 (= ~a4~0 1)) (.cse2 (<= ~a23~0 312))) (or (and (<= ~a23~0 138) .cse0 (not (= ~a25~0 9))) (and .cse1 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse7 .cse9 .cse3) (and .cse10 .cse11 .cse12 .cse0 .cse13) (and .cse14 .cse8 (or (and .cse5 .cse6 .cse0 (<= ~a29~0 232) .cse13 .cse15) (and .cse6 .cse12 (<= ~a29~0 220) .cse0 .cse15))) (and .cse6 .cse16 .cse8 .cse0) (and .cse1 .cse14 .cse0 .cse13) (and .cse1 .cse11 .cse0 .cse2) (and .cse10 (or (and .cse5 .cse6 .cse0 .cse17 .cse13 .cse15) (and .cse6 .cse12 .cse0 .cse17 .cse15))) (and .cse10 .cse11 .cse16 .cse0) (and .cse4 .cse5 .cse7 .cse3) (and .cse14 .cse0 .cse18) (and .cse5 .cse6 .cse7 .cse17) (and .cse1 (<= ~a29~0 240) .cse8 .cse0) (and .cse5 (or (not (< 306 ~a23~0)) (not (< 277 ~a29~0))) .cse0 .cse2) (and .cse4 (or (and .cse7 .cse18 .cse3) (and .cse7 .cse12 .cse3))) (and .cse11 .cse19 .cse7 .cse9) (and .cse1 .cse19 .cse6 .cse7 .cse17) (and (< 0 .cse20) .cse16 .cse0 .cse2)))) [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,299 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-11-02 21:02:13,300 INFO L902 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-11-02 21:02:13,300 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,301 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-02 21:02:13,302 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-11-02 21:02:13,302 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-11-02 21:02:13,302 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,304 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-11-02 21:02:13,305 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,306 INFO L895 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse20 (+ ~a23~0 43))) (let ((.cse13 (not (<= ~a23~0 306))) (.cse15 (<= 130 ~a29~0)) (.cse10 (<= ~a23~0 600000)) (.cse14 (<= ~a23~0 599997)) (.cse8 (<= 141 ~a29~0)) (.cse5 (= ~a25~0 12)) (.cse4 (<= (+ ~a23~0 55) 0)) (.cse18 (= ~a25~0 10)) (.cse12 (= ~a25~0 11)) (.cse3 (<= ~a29~0 130)) (.cse11 (<= 260 ~a29~0)) (.cse9 (<= ~a25~0 9)) (.cse1 (= ~a25~0 13)) (.cse19 (<= .cse20 0)) (.cse6 (<= ~a29~0 277)) (.cse7 (= ~a4~0 0)) (.cse17 (<= 246 ~a29~0)) (.cse16 (<= ~a25~0 10)) (.cse0 (= ~a4~0 1)) (.cse2 (<= ~a23~0 312))) (or (and (<= ~a23~0 138) .cse0 (not (= ~a25~0 9))) (and .cse1 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse7 .cse9 .cse3) (and .cse10 .cse11 .cse12 .cse0 .cse13) (and .cse14 .cse8 (or (and .cse5 .cse6 .cse0 (<= ~a29~0 232) .cse13 .cse15) (and .cse6 .cse12 (<= ~a29~0 220) .cse0 .cse15))) (and .cse6 .cse16 .cse8 .cse0) (and .cse1 .cse14 .cse0 .cse13) (and .cse1 .cse11 .cse0 .cse2) (and .cse10 (or (and .cse5 .cse6 .cse0 .cse17 .cse13 .cse15) (and .cse6 .cse12 .cse0 .cse17 .cse15))) (and .cse10 .cse11 .cse16 .cse0) (and .cse4 .cse5 .cse7 .cse3) (and .cse14 .cse0 .cse18) (and .cse5 .cse6 .cse7 .cse17) (and .cse1 (<= ~a29~0 240) .cse8 .cse0) (and .cse5 (or (not (< 306 ~a23~0)) (not (< 277 ~a29~0))) .cse0 .cse2) (and .cse4 (or (and .cse7 .cse18 .cse3) (and .cse7 .cse12 .cse3))) (and .cse11 .cse19 .cse7 .cse9) (and .cse1 .cse19 .cse6 .cse7 .cse17) (and (< 0 .cse20) .cse16 .cse0 .cse2)))) [2022-11-02 21:02:13,306 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,306 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,306 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,306 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,306 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-02 21:02:13,307 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,308 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,310 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-02 21:02:13,311 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,312 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,312 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,312 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,312 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-11-02 21:02:13,313 INFO L899 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-11-02 21:02:13,313 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,313 INFO L899 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,313 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,314 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2022-11-02 21:02:13,315 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-11-02 21:02:13,316 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,317 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,318 INFO L899 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,319 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,319 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-11-02 21:02:13,319 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-11-02 21:02:13,320 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,321 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,322 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,323 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,324 INFO L899 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-11-02 21:02:13,325 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,326 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-11-02 21:02:13,327 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,328 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,329 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-02 21:02:13,330 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-11-02 21:02:13,331 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-02 21:02:13,332 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-11-02 21:02:13,335 INFO L444 BasicCegarLoop]: Path program 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] [2022-11-02 21:02:13,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:02:13,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:02:13 BoogieIcfgContainer [2022-11-02 21:02:13,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:02:13,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:02:13,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:02:13,376 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:02:13,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:54" (3/4) ... [2022-11-02 21:02:13,379 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:02:13,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 21:02:13,425 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 21:02:13,432 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 21:02:13,434 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:02:13,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:02:13,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:02:13,594 INFO L158 Benchmark]: Toolchain (without parser) took 202877.86ms. Allocated memory was 121.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.0MB in the beginning and 782.1MB in the end (delta: -701.2MB). Peak memory consumption was 691.7MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,594 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:02:13,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1161.57ms. Allocated memory is still 121.6MB. Free memory was 80.8MB in the beginning and 65.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 214.98ms. Allocated memory is still 121.6MB. Free memory was 65.1MB in the beginning and 88.9MB in the end (delta: -23.8MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,598 INFO L158 Benchmark]: Boogie Preprocessor took 231.65ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 83.0MB in the end (delta: 5.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,598 INFO L158 Benchmark]: RCFGBuilder took 2294.79ms. Allocated memory was 121.6MB in the beginning and 243.3MB in the end (delta: 121.6MB). Free memory was 83.0MB in the beginning and 150.6MB in the end (delta: -67.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,599 INFO L158 Benchmark]: TraceAbstraction took 198745.71ms. Allocated memory was 243.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.6MB in the beginning and 796.8MB in the end (delta: -646.2MB). Peak memory consumption was 900.4MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,602 INFO L158 Benchmark]: Witness Printer took 218.15ms. Allocated memory is still 1.5GB. Free memory was 796.8MB in the beginning and 782.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:02:13,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1161.57ms. Allocated memory is still 121.6MB. Free memory was 80.8MB in the beginning and 65.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 214.98ms. Allocated memory is still 121.6MB. Free memory was 65.1MB in the beginning and 88.9MB in the end (delta: -23.8MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 231.65ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 83.0MB in the end (delta: 5.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2294.79ms. Allocated memory was 121.6MB in the beginning and 243.3MB in the end (delta: 121.6MB). Free memory was 83.0MB in the beginning and 150.6MB in the end (delta: -67.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 198745.71ms. Allocated memory was 243.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.6MB in the beginning and 796.8MB in the end (delta: -646.2MB). Peak memory consumption was 900.4MB. Max. memory is 16.1GB. * Witness Printer took 218.15ms. Allocated memory is still 1.5GB. Free memory was 796.8MB in the beginning and 782.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 139]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 198.6s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 120.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5404 SdHoareTripleChecker+Valid, 36.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5404 mSDsluCounter, 5961 SdHoareTripleChecker+Invalid, 30.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 810 mSDsCounter, 3270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21399 IncrementalHoareTripleChecker+Invalid, 24669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3270 mSolverCounterUnsat, 5151 mSDtfsCounter, 21399 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2148 GetRequests, 2071 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20681occurred in iteration=20, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 41236 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 109 NumberOfFragments, 717 HoareAnnotationTreeSize, 3 FomulaSimplifications, 57604 FormulaSimplificationTreeSizeReduction, 107.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1502010 FormulaSimplificationTreeSizeReductionInter, 13.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 14202 NumberOfCodeBlocks, 14202 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 14843 ConstructedInterpolants, 0 QuantifiedInterpolants, 43625 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 25974/26288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a23 <= 138 && a4 == 1) && !(a25 == 9)) || (((a25 == 13 && a4 == 1) && a23 <= 312) && a29 <= 130)) || ((((a23 + 55 <= 0 && a25 == 12) && a29 <= 277) && a4 == 0) && 141 <= a29)) || (((a23 + 55 <= 0 && a4 == 0) && a25 <= 9) && a29 <= 130)) || ((((a23 <= 600000 && 260 <= a29) && a25 == 11) && a4 == 1) && !(a23 <= 306))) || ((a23 <= 599997 && 141 <= a29) && ((((((a25 == 12 && a29 <= 277) && a4 == 1) && a29 <= 232) && !(a23 <= 306)) && 130 <= a29) || ((((a29 <= 277 && a25 == 11) && a29 <= 220) && a4 == 1) && 130 <= a29)))) || (((a29 <= 277 && a25 <= 10) && 141 <= a29) && a4 == 1)) || (((a25 == 13 && a23 <= 599997) && a4 == 1) && !(a23 <= 306))) || (((a25 == 13 && 260 <= a29) && a4 == 1) && a23 <= 312)) || (a23 <= 600000 && ((((((a25 == 12 && a29 <= 277) && a4 == 1) && 246 <= a29) && !(a23 <= 306)) && 130 <= a29) || ((((a29 <= 277 && a25 == 11) && a4 == 1) && 246 <= a29) && 130 <= a29)))) || (((a23 <= 600000 && 260 <= a29) && a25 <= 10) && a4 == 1)) || (((a23 + 55 <= 0 && a25 == 12) && a4 == 0) && a29 <= 130)) || ((a23 <= 599997 && a4 == 1) && a25 == 10)) || (((a25 == 12 && a29 <= 277) && a4 == 0) && 246 <= a29)) || (((a25 == 13 && a29 <= 240) && 141 <= a29) && a4 == 1)) || (((a25 == 12 && (!(306 < a23) || !(277 < a29))) && a4 == 1) && a23 <= 312)) || (a23 + 55 <= 0 && (((a4 == 0 && a25 == 10) && a29 <= 130) || ((a4 == 0 && a25 == 11) && a29 <= 130)))) || (((260 <= a29 && a23 + 43 <= 0) && a4 == 0) && a25 <= 9)) || ((((a25 == 13 && a23 + 43 <= 0) && a29 <= 277) && a4 == 0) && 246 <= a29)) || (((0 < a23 + 43 && a25 <= 10) && a4 == 1) && a23 <= 312) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a23 <= 138 && a4 == 1) && !(a25 == 9)) || (((a25 == 13 && a4 == 1) && a23 <= 312) && a29 <= 130)) || ((((a23 + 55 <= 0 && a25 == 12) && a29 <= 277) && a4 == 0) && 141 <= a29)) || (((a23 + 55 <= 0 && a4 == 0) && a25 <= 9) && a29 <= 130)) || ((((a23 <= 600000 && 260 <= a29) && a25 == 11) && a4 == 1) && !(a23 <= 306))) || ((a23 <= 599997 && 141 <= a29) && ((((((a25 == 12 && a29 <= 277) && a4 == 1) && a29 <= 232) && !(a23 <= 306)) && 130 <= a29) || ((((a29 <= 277 && a25 == 11) && a29 <= 220) && a4 == 1) && 130 <= a29)))) || (((a29 <= 277 && a25 <= 10) && 141 <= a29) && a4 == 1)) || (((a25 == 13 && a23 <= 599997) && a4 == 1) && !(a23 <= 306))) || (((a25 == 13 && 260 <= a29) && a4 == 1) && a23 <= 312)) || (a23 <= 600000 && ((((((a25 == 12 && a29 <= 277) && a4 == 1) && 246 <= a29) && !(a23 <= 306)) && 130 <= a29) || ((((a29 <= 277 && a25 == 11) && a4 == 1) && 246 <= a29) && 130 <= a29)))) || (((a23 <= 600000 && 260 <= a29) && a25 <= 10) && a4 == 1)) || (((a23 + 55 <= 0 && a25 == 12) && a4 == 0) && a29 <= 130)) || ((a23 <= 599997 && a4 == 1) && a25 == 10)) || (((a25 == 12 && a29 <= 277) && a4 == 0) && 246 <= a29)) || (((a25 == 13 && a29 <= 240) && 141 <= a29) && a4 == 1)) || (((a25 == 12 && (!(306 < a23) || !(277 < a29))) && a4 == 1) && a23 <= 312)) || (a23 + 55 <= 0 && (((a4 == 0 && a25 == 10) && a29 <= 130) || ((a4 == 0 && a25 == 11) && a29 <= 130)))) || (((260 <= a29 && a23 + 43 <= 0) && a4 == 0) && a25 <= 9)) || ((((a25 == 13 && a23 + 43 <= 0) && a29 <= 277) && a4 == 0) && 246 <= a29)) || (((0 < a23 + 43 && a25 <= 10) && a4 == 1) && a23 <= 312) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 21:02:13,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3393f2f0-e870-409e-979d-a82240e4f6aa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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