./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/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_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/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_8a64ca88-52ef-4024-ae7d-7c335207ac82/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 6cbab6fa89ec0662a3f26b65a5642d5ae526485e7fe3ba965ed5a2823e941a06 --- 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 21:12:11,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:12:11,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:12:11,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:12:11,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:12:11,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:12:11,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:12:11,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:12:11,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:12:11,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:12:11,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:12:11,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:12:11,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:12:11,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:12:11,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:12:11,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:12:11,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:12:11,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:12:11,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:12:11,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:12:11,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:12:11,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:12:11,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:12:11,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:12:11,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:12:11,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:12:11,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:12:11,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:12:11,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:12:11,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:12:11,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:12:11,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:12:11,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:12:11,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:12:11,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:12:11,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:12:11,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:12:11,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:12:11,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:12:11,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:12:11,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:12:11,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:12:11,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:12:11,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:12:11,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:12:11,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:12:11,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:12:11,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:12:11,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:12:11,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:12:11,736 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:12:11,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:12:11,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:12:11,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:12:11,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:12:11,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:12:11,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:12:11,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:12:11,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:12:11,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:12:11,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:12:11,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:12:11,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:12:11,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:12:11,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:12:11,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:12:11,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:12:11,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:12:11,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:12:11,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:12:11,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:12:11,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:12:11,743 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:12:11,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:12:11,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:12:11,744 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_8a64ca88-52ef-4024-ae7d-7c335207ac82/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_8a64ca88-52ef-4024-ae7d-7c335207ac82/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 -> 6cbab6fa89ec0662a3f26b65a5642d5ae526485e7fe3ba965ed5a2823e941a06 [2022-11-02 21:12:12,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:12:12,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:12:12,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:12:12,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:12:12,075 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:12:12,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c [2022-11-02 21:12:12,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/data/16c6fd559/bf3f56d56c404beabdc6a3f381fc9be6/FLAG7dc70ed4a [2022-11-02 21:12:12,749 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:12:12,750 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c [2022-11-02 21:12:12,779 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/data/16c6fd559/bf3f56d56c404beabdc6a3f381fc9be6/FLAG7dc70ed4a [2022-11-02 21:12:12,949 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/data/16c6fd559/bf3f56d56c404beabdc6a3f381fc9be6 [2022-11-02 21:12:12,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:12:12,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:12:12,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:12:12,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:12:12,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:12:12,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:12:12" (1/1) ... [2022-11-02 21:12:12,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555882f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:12, skipping insertion in model container [2022-11-02 21:12:12,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:12:12" (1/1) ... [2022-11-02 21:12:12,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:12:13,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:12:13,445 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_8a64ca88-52ef-4024-ae7d-7c335207ac82/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c[72918,72931] [2022-11-02 21:12:13,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:12:13,482 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:12:13,672 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_8a64ca88-52ef-4024-ae7d-7c335207ac82/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-1.c[72918,72931] [2022-11-02 21:12:13,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:12:13,691 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:12:13,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13 WrapperNode [2022-11-02 21:12:13,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:12:13,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:12:13,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:12:13,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:12:13,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,762 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-11-02 21:12:13,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:12:13,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:12:13,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:12:13,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:12:13,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,826 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:12:13,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:12:13,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:12:13,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:12:13,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (1/1) ... [2022-11-02 21:12:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:12:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:12:13,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:12:13,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:12:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:12:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:12:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:12:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:12:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:12:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:12:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:12:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:12:13,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:12:14,129 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:12:14,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:12:14,181 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:12:17,152 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 21:12:17,153 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 21:12:17,153 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:12:17,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:12:17,167 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:12:17,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:12:17 BoogieIcfgContainer [2022-11-02 21:12:17,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:12:17,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:12:17,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:12:17,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:12:17,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:12:12" (1/3) ... [2022-11-02 21:12:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3002d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:12:17, skipping insertion in model container [2022-11-02 21:12:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:12:13" (2/3) ... [2022-11-02 21:12:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3002d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:12:17, skipping insertion in model container [2022-11-02 21:12:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:12:17" (3/3) ... [2022-11-02 21:12:17,179 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-1.c [2022-11-02 21:12:17,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:12:17,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:12:17,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:12:17,271 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;@57b52c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:12:17,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:12:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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:12:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:12:17,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:17,293 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:17,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1383952291, now seen corresponding path program 1 times [2022-11-02 21:12:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379824611] [2022-11-02 21:12:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:18,384 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 21:12:18,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379824611] [2022-11-02 21:12:18,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379824611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:18,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:18,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008053785] [2022-11-02 21:12:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:18,422 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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:12:20,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:21,255 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-11-02 21:12:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:21,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-11-02 21:12:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:21,272 INFO L225 Difference]: With dead ends: 412 [2022-11-02 21:12:21,272 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 21:12:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:21,280 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:21,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:12:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 21:12:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-11-02 21:12:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 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:12:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-11-02 21:12:21,336 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 48 [2022-11-02 21:12:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:21,337 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-11-02 21:12:21,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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:12:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-11-02 21:12:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:12:21,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:21,340 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:21,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:12:21,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -268027324, now seen corresponding path program 1 times [2022-11-02 21:12:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:21,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242665978] [2022-11-02 21:12:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:21,840 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 21:12:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:21,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242665978] [2022-11-02 21:12:21,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242665978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:21,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:21,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989188205] [2022-11-02 21:12:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:21,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:21,848 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:12:23,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:24,227 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-11-02 21:12:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:24,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-11-02 21:12:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:24,229 INFO L225 Difference]: With dead ends: 372 [2022-11-02 21:12:24,230 INFO L226 Difference]: Without dead ends: 205 [2022-11-02 21:12:24,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:24,232 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:24,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:12:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-02 21:12:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-11-02 21:12:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 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:12:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-11-02 21:12:24,264 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 49 [2022-11-02 21:12:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:24,265 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-11-02 21:12:24,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:12:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-11-02 21:12:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:12:24,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:24,273 INFO L195 NwaCegarLoop]: trace histogram [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 21:12:24,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:12:24,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -446456106, now seen corresponding path program 1 times [2022-11-02 21:12:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:24,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776801000] [2022-11-02 21:12:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:24,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776801000] [2022-11-02 21:12:24,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776801000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:24,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:24,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307287795] [2022-11-02 21:12:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:24,831 INFO L87 Difference]: Start difference. First operand 188 states and 302 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:12:26,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:27,508 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-11-02 21:12:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 21:12:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:27,514 INFO L225 Difference]: With dead ends: 514 [2022-11-02 21:12:27,514 INFO L226 Difference]: Without dead ends: 347 [2022-11-02 21:12:27,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:27,516 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:27,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:12:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-02 21:12:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-11-02 21:12:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 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:12:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-11-02 21:12:27,535 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 62 [2022-11-02 21:12:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:27,535 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-11-02 21:12:27,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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:12:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-11-02 21:12:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:12:27,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:27,538 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:27,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:12:27,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2018508714, now seen corresponding path program 1 times [2022-11-02 21:12:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:27,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112107228] [2022-11-02 21:12:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112107228] [2022-11-02 21:12:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112107228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:27,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:27,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669261342] [2022-11-02 21:12:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:27,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:27,908 INFO L87 Difference]: Start difference. First operand 220 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:12:29,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:30,285 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-11-02 21:12:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:30,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:12:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:30,287 INFO L225 Difference]: With dead ends: 435 [2022-11-02 21:12:30,287 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 21:12:30,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:30,289 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:30,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:12:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 21:12:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-11-02 21:12:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 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:12:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-11-02 21:12:30,310 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 63 [2022-11-02 21:12:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:30,311 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-11-02 21:12:30,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:12:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-11-02 21:12:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:12:30,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:30,313 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:30,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:12:30,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1301029102, now seen corresponding path program 1 times [2022-11-02 21:12:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:30,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074122630] [2022-11-02 21:12:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:30,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074122630] [2022-11-02 21:12:30,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074122630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:30,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:30,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82717318] [2022-11-02 21:12:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:30,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:30,842 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:12:32,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:33,379 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-11-02 21:12:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:33,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:12:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:33,381 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:12:33,382 INFO L226 Difference]: Without dead ends: 320 [2022-11-02 21:12:33,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:33,383 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:33,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:12:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-02 21:12:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-11-02 21:12:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:12:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-11-02 21:12:33,396 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 63 [2022-11-02 21:12:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:33,397 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-11-02 21:12:33,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:12:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-11-02 21:12:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:12:33,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:33,398 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:33,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:12:33,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash -971650395, now seen corresponding path program 1 times [2022-11-02 21:12:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:33,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462766638] [2022-11-02 21:12:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462766638] [2022-11-02 21:12:33,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462766638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:33,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:33,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548758657] [2022-11-02 21:12:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:33,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:33,857 INFO L87 Difference]: Start difference. First operand 221 states and 351 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:12:35,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:36,396 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-11-02 21:12:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:12:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:36,399 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:12:36,399 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 21:12:36,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:36,400 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:36,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:12:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 21:12:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-11-02 21:12:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 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:12:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-11-02 21:12:36,411 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 64 [2022-11-02 21:12:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:36,411 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-11-02 21:12:36,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:12:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-11-02 21:12:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:12:36,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:36,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:36,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:12:36,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1857333905, now seen corresponding path program 1 times [2022-11-02 21:12:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135686336] [2022-11-02 21:12:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:36,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135686336] [2022-11-02 21:12:36,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135686336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:36,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:36,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360621883] [2022-11-02 21:12:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:36,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:36,733 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:12:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:39,038 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-11-02 21:12:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:12:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:39,040 INFO L225 Difference]: With dead ends: 434 [2022-11-02 21:12:39,040 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 21:12:39,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:39,041 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:39,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:12:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 21:12:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-11-02 21:12:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 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:12:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-11-02 21:12:39,050 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 64 [2022-11-02 21:12:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:39,050 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-11-02 21:12:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:12:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-11-02 21:12:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:12:39,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:39,052 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:39,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:12:39,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 269012237, now seen corresponding path program 1 times [2022-11-02 21:12:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:39,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307929074] [2022-11-02 21:12:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:39,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307929074] [2022-11-02 21:12:39,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307929074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:39,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:39,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021367493] [2022-11-02 21:12:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:39,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:39,440 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:12:41,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:41,958 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-11-02 21:12:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:12:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:41,960 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:12:41,960 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 21:12:41,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:41,962 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:41,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:12:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 21:12:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-11-02 21:12:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 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:12:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-11-02 21:12:41,971 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 65 [2022-11-02 21:12:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:41,972 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-11-02 21:12:41,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:12:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-11-02 21:12:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:12:41,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:41,973 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:12:41,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1305412400, now seen corresponding path program 1 times [2022-11-02 21:12:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441013306] [2022-11-02 21:12:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:12:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:42,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441013306] [2022-11-02 21:12:42,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441013306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:42,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:42,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619935810] [2022-11-02 21:12:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:42,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:42,310 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:12:44,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:44,840 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-11-02 21:12:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-11-02 21:12:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:44,843 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:12:44,843 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 21:12:44,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:44,844 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:44,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:12:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 21:12:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-11-02 21:12:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 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:12:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-11-02 21:12:44,854 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 66 [2022-11-02 21:12:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:44,854 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-11-02 21:12:44,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:12:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-11-02 21:12:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:12:44,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:44,856 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:44,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:12:44,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1115483845, now seen corresponding path program 1 times [2022-11-02 21:12:44,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:44,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432056202] [2022-11-02 21:12:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:12:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:45,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432056202] [2022-11-02 21:12:45,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432056202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:45,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:45,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743069470] [2022-11-02 21:12:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:45,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:45,199 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:12:46,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:47,202 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-11-02 21:12:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-02 21:12:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:47,204 INFO L225 Difference]: With dead ends: 511 [2022-11-02 21:12:47,204 INFO L226 Difference]: Without dead ends: 286 [2022-11-02 21:12:47,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:47,205 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:47,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 21:12:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-02 21:12:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-11-02 21:12:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 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:12:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-11-02 21:12:47,215 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 95 [2022-11-02 21:12:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:47,216 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-11-02 21:12:47,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:12:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-11-02 21:12:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:12:47,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:47,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:12:47,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 464418207, now seen corresponding path program 1 times [2022-11-02 21:12:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:47,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049512573] [2022-11-02 21:12:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:12:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:47,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049512573] [2022-11-02 21:12:47,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049512573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:47,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:47,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353891034] [2022-11-02 21:12:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:47,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:47,593 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:12:49,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:49,898 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-11-02 21:12:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:49,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-02 21:12:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:49,901 INFO L225 Difference]: With dead ends: 528 [2022-11-02 21:12:49,901 INFO L226 Difference]: Without dead ends: 281 [2022-11-02 21:12:49,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:49,902 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:49,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:12:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-02 21:12:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-11-02 21:12:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 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:12:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-11-02 21:12:49,913 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 95 [2022-11-02 21:12:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:49,914 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-11-02 21:12:49,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:12:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-11-02 21:12:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 21:12:49,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:49,916 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:12:49,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -74791869, now seen corresponding path program 1 times [2022-11-02 21:12:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:49,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99865735] [2022-11-02 21:12:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:12:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:50,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99865735] [2022-11-02 21:12:50,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99865735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:50,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:50,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661272136] [2022-11-02 21:12:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:50,283 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:12:52,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:52,567 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-11-02 21:12:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-11-02 21:12:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:52,569 INFO L225 Difference]: With dead ends: 518 [2022-11-02 21:12:52,569 INFO L226 Difference]: Without dead ends: 271 [2022-11-02 21:12:52,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:52,570 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:52,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:12:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-02 21:12:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-11-02 21:12:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 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:12:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-11-02 21:12:52,580 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 96 [2022-11-02 21:12:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:52,580 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-11-02 21:12:52,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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:12:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-11-02 21:12:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 21:12:52,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:52,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:12:52,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1786617495, now seen corresponding path program 1 times [2022-11-02 21:12:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:52,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400082423] [2022-11-02 21:12:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:12:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:52,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400082423] [2022-11-02 21:12:52,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400082423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:52,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:52,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625884715] [2022-11-02 21:12:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:52,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:52,890 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:12:54,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:55,229 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-11-02 21:12:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 21:12:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:55,231 INFO L225 Difference]: With dead ends: 532 [2022-11-02 21:12:55,231 INFO L226 Difference]: Without dead ends: 285 [2022-11-02 21:12:55,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:55,232 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:55,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:12:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-02 21:12:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-11-02 21:12:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 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:12:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-11-02 21:12:55,243 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 109 [2022-11-02 21:12:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:55,243 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-11-02 21:12:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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:12:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-11-02 21:12:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 21:12:55,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:55,245 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:55,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:12:55,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1803417690, now seen corresponding path program 1 times [2022-11-02 21:12:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:55,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268168062] [2022-11-02 21:12:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:12:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268168062] [2022-11-02 21:12:55,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268168062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:55,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:55,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410083773] [2022-11-02 21:12:55,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:55,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:55,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:55,605 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:12:57,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:58,146 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-11-02 21:12:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:12:58,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-11-02 21:12:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:58,148 INFO L225 Difference]: With dead ends: 586 [2022-11-02 21:12:58,148 INFO L226 Difference]: Without dead ends: 339 [2022-11-02 21:12:58,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:58,149 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:58,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:12:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-02 21:12:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-11-02 21:12:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 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:12:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-11-02 21:12:58,160 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 110 [2022-11-02 21:12:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:58,161 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-11-02 21:12:58,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:12:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-11-02 21:12:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:12:58,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:58,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:58,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:12:58,163 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1948427051, now seen corresponding path program 1 times [2022-11-02 21:12:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344659268] [2022-11-02 21:12:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:12:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:58,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344659268] [2022-11-02 21:12:58,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344659268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:58,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:58,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:12:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239250414] [2022-11-02 21:12:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:58,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:12:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:12:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:12:58,575 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:13:00,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:01,098 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-11-02 21:13:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 112 [2022-11-02 21:13:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:01,100 INFO L225 Difference]: With dead ends: 586 [2022-11-02 21:13:01,101 INFO L226 Difference]: Without dead ends: 339 [2022-11-02 21:13:01,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:01,105 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:01,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:13:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-02 21:13:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-11-02 21:13:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 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:13:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-11-02 21:13:01,116 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 112 [2022-11-02 21:13:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-11-02 21:13:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:13:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-11-02 21:13:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 21:13:01,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:01,119 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:13:01,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1315157961, now seen corresponding path program 1 times [2022-11-02 21:13:01,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877607643] [2022-11-02 21:13:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:13:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877607643] [2022-11-02 21:13:01,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877607643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:01,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:01,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817813076] [2022-11-02 21:13:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:01,470 INFO L87 Difference]: Start difference. First operand 268 states and 414 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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:13:03,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:03,759 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-11-02 21:13:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 113 [2022-11-02 21:13:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:03,761 INFO L225 Difference]: With dead ends: 522 [2022-11-02 21:13:03,761 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 21:13:03,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:03,762 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:03,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:13:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 21:13:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-11-02 21:13:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 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 21:13:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-11-02 21:13:03,772 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 113 [2022-11-02 21:13:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:03,773 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-11-02 21:13:03,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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:13:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-11-02 21:13:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 21:13:03,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:03,775 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:03,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:13:03,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1545905064, now seen corresponding path program 1 times [2022-11-02 21:13:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693845209] [2022-11-02 21:13:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:13:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:04,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693845209] [2022-11-02 21:13:04,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693845209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:04,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:04,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495642971] [2022-11-02 21:13:04,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:04,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:04,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:04,204 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:13:06,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:06,561 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-11-02 21:13:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 117 [2022-11-02 21:13:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:06,564 INFO L225 Difference]: With dead ends: 624 [2022-11-02 21:13:06,564 INFO L226 Difference]: Without dead ends: 377 [2022-11-02 21:13:06,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:06,565 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:06,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:13:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-02 21:13:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-11-02 21:13:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 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:13:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-11-02 21:13:06,576 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 117 [2022-11-02 21:13:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:06,577 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-11-02 21:13:06,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:13:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-11-02 21:13:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:13:06,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:06,579 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:06,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:13:06,579 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2064254214, now seen corresponding path program 1 times [2022-11-02 21:13:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:06,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647251833] [2022-11-02 21:13:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:13:07,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:07,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647251833] [2022-11-02 21:13:07,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647251833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:07,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:07,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278804653] [2022-11-02 21:13:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:07,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:07,014 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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:13:08,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:09,234 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-11-02 21:13:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 128 [2022-11-02 21:13:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:09,237 INFO L225 Difference]: With dead ends: 694 [2022-11-02 21:13:09,237 INFO L226 Difference]: Without dead ends: 415 [2022-11-02 21:13:09,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:09,239 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:09,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 21:13:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-02 21:13:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-11-02 21:13:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 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:13:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-11-02 21:13:09,251 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 128 [2022-11-02 21:13:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:09,251 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-11-02 21:13:09,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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:13:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-11-02 21:13:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:13:09,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:09,253 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:09,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:13:09,254 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 187771396, now seen corresponding path program 1 times [2022-11-02 21:13:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:09,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410959771] [2022-11-02 21:13:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:13:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:09,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410959771] [2022-11-02 21:13:09,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410959771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:09,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:09,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:13:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211151249] [2022-11-02 21:13:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:13:09,448 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:13:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:09,493 INFO L93 Difference]: Finished difference Result 981 states and 1546 transitions. [2022-11-02 21:13:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:09,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 128 [2022-11-02 21:13:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:09,497 INFO L225 Difference]: With dead ends: 981 [2022-11-02 21:13:09,497 INFO L226 Difference]: Without dead ends: 659 [2022-11-02 21:13:09,498 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:13:09,499 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 135 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:09,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 558 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-02 21:13:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2022-11-02 21:13:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.5668693009118542) internal successors, (1031), 658 states have internal predecessors, (1031), 0 states have call successors, (0), 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:13:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1031 transitions. [2022-11-02 21:13:09,522 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1031 transitions. Word has length 128 [2022-11-02 21:13:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:09,522 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1031 transitions. [2022-11-02 21:13:09,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:13:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1031 transitions. [2022-11-02 21:13:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:13:09,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:09,525 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:09,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:13:09,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1081257734, now seen corresponding path program 1 times [2022-11-02 21:13:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137230332] [2022-11-02 21:13:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:13:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:09,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137230332] [2022-11-02 21:13:09,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137230332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:09,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:09,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:13:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197732313] [2022-11-02 21:13:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:09,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:09,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:13:09,678 INFO L87 Difference]: Start difference. First operand 659 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:13:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:09,721 INFO L93 Difference]: Finished difference Result 1572 states and 2471 transitions. [2022-11-02 21:13:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 128 [2022-11-02 21:13:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:09,726 INFO L225 Difference]: With dead ends: 1572 [2022-11-02 21:13:09,726 INFO L226 Difference]: Without dead ends: 934 [2022-11-02 21:13:09,727 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:13:09,728 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:09,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-11-02 21:13:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2022-11-02 21:13:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.5637727759914255) internal successors, (1459), 933 states have internal predecessors, (1459), 0 states have call successors, (0), 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:13:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1459 transitions. [2022-11-02 21:13:09,781 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1459 transitions. Word has length 128 [2022-11-02 21:13:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:09,782 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1459 transitions. [2022-11-02 21:13:09,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:13:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1459 transitions. [2022-11-02 21:13:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:13:09,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:09,785 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:13:09,785 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash 494981512, now seen corresponding path program 1 times [2022-11-02 21:13:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:09,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136126148] [2022-11-02 21:13:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 21:13:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:09,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136126148] [2022-11-02 21:13:09,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136126148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:09,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:09,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:13:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263659290] [2022-11-02 21:13:09,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:09,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:09,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:13:09,936 INFO L87 Difference]: Start difference. First operand 934 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:13:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:09,971 INFO L93 Difference]: Finished difference Result 1874 states and 2930 transitions. [2022-11-02 21:13:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 128 [2022-11-02 21:13:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:09,975 INFO L225 Difference]: With dead ends: 1874 [2022-11-02 21:13:09,975 INFO L226 Difference]: Without dead ends: 961 [2022-11-02 21:13:09,976 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:13:09,977 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:09,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-11-02 21:13:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2022-11-02 21:13:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.55625) internal successors, (1494), 960 states have internal predecessors, (1494), 0 states have call successors, (0), 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:13:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1494 transitions. [2022-11-02 21:13:10,006 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1494 transitions. Word has length 128 [2022-11-02 21:13:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:10,006 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1494 transitions. [2022-11-02 21:13:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:13:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1494 transitions. [2022-11-02 21:13:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:13:10,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:10,009 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:10,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:13:10,009 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1646878966, now seen corresponding path program 1 times [2022-11-02 21:13:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553076849] [2022-11-02 21:13:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-02 21:13:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:10,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553076849] [2022-11-02 21:13:10,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553076849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:10,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:10,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:13:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628404889] [2022-11-02 21:13:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:13:10,163 INFO L87 Difference]: Start difference. First operand 961 states and 1494 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:13:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:10,193 INFO L93 Difference]: Finished difference Result 1903 states and 2966 transitions. [2022-11-02 21:13:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 128 [2022-11-02 21:13:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:10,197 INFO L225 Difference]: With dead ends: 1903 [2022-11-02 21:13:10,197 INFO L226 Difference]: Without dead ends: 963 [2022-11-02 21:13:10,198 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:13:10,199 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:10,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 383 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-11-02 21:13:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-11-02 21:13:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.5550935550935552) internal successors, (1496), 962 states have internal predecessors, (1496), 0 states have call successors, (0), 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:13:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1496 transitions. [2022-11-02 21:13:10,227 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1496 transitions. Word has length 128 [2022-11-02 21:13:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:10,227 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1496 transitions. [2022-11-02 21:13:10,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:13:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1496 transitions. [2022-11-02 21:13:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-02 21:13:10,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:10,230 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:10,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:13:10,230 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash 331983923, now seen corresponding path program 1 times [2022-11-02 21:13:10,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:10,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794084856] [2022-11-02 21:13:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 21:13:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:10,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794084856] [2022-11-02 21:13:10,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794084856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:10,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:10,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860097128] [2022-11-02 21:13:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:10,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:10,645 INFO L87 Difference]: Start difference. First operand 963 states and 1496 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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:13:12,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:13,168 INFO L93 Difference]: Finished difference Result 2008 states and 3100 transitions. [2022-11-02 21:13:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 208 [2022-11-02 21:13:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:13,173 INFO L225 Difference]: With dead ends: 2008 [2022-11-02 21:13:13,173 INFO L226 Difference]: Without dead ends: 1068 [2022-11-02 21:13:13,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:13,175 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 80 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:13,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 617 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:13:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-02 21:13:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 963. [2022-11-02 21:13:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.553014553014553) internal successors, (1494), 962 states have internal predecessors, (1494), 0 states have call successors, (0), 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:13:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1494 transitions. [2022-11-02 21:13:13,232 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1494 transitions. Word has length 208 [2022-11-02 21:13:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:13,233 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1494 transitions. [2022-11-02 21:13:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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:13:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1494 transitions. [2022-11-02 21:13:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-02 21:13:13,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:13,236 INFO L195 NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:13,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:13:13,236 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1176878834, now seen corresponding path program 1 times [2022-11-02 21:13:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:13,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939136699] [2022-11-02 21:13:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 21:13:13,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:13,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939136699] [2022-11-02 21:13:13,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939136699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:13,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:13,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878426242] [2022-11-02 21:13:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:13,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:13,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:13,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:13,685 INFO L87 Difference]: Start difference. First operand 963 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 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 21:13:15,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:16,225 INFO L93 Difference]: Finished difference Result 2107 states and 3231 transitions. [2022-11-02 21:13:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:16,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 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 209 [2022-11-02 21:13:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:16,230 INFO L225 Difference]: With dead ends: 2107 [2022-11-02 21:13:16,230 INFO L226 Difference]: Without dead ends: 1167 [2022-11-02 21:13:16,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:16,232 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 109 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:16,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 313 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:13:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-11-02 21:13:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 963. [2022-11-02 21:13:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.5446985446985446) internal successors, (1486), 962 states have internal predecessors, (1486), 0 states have call successors, (0), 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:13:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1486 transitions. [2022-11-02 21:13:16,290 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1486 transitions. Word has length 209 [2022-11-02 21:13:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:16,291 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1486 transitions. [2022-11-02 21:13:16,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 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 21:13:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1486 transitions. [2022-11-02 21:13:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-02 21:13:16,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:16,296 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:13:16,297 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1702915551, now seen corresponding path program 1 times [2022-11-02 21:13:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313040997] [2022-11-02 21:13:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:16,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-11-02 21:13:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:16,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313040997] [2022-11-02 21:13:16,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313040997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:16,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:16,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17231273] [2022-11-02 21:13:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:16,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:16,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:16,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:16,777 INFO L87 Difference]: Start difference. First operand 963 states and 1486 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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:13:18,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:19,335 INFO L93 Difference]: Finished difference Result 2104 states and 3212 transitions. [2022-11-02 21:13:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:19,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 222 [2022-11-02 21:13:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:19,340 INFO L225 Difference]: With dead ends: 2104 [2022-11-02 21:13:19,340 INFO L226 Difference]: Without dead ends: 1164 [2022-11-02 21:13:19,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:19,342 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 130 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:19,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 315 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 255 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:13:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-11-02 21:13:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 963. [2022-11-02 21:13:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.5332640332640333) internal successors, (1475), 962 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 21:13:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1475 transitions. [2022-11-02 21:13:19,377 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1475 transitions. Word has length 222 [2022-11-02 21:13:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:19,377 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1475 transitions. [2022-11-02 21:13:19,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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:13:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1475 transitions. [2022-11-02 21:13:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-02 21:13:19,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:19,380 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:19,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:13:19,381 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 553077487, now seen corresponding path program 1 times [2022-11-02 21:13:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845669638] [2022-11-02 21:13:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-02 21:13:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:19,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845669638] [2022-11-02 21:13:19,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845669638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:19,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:19,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227274555] [2022-11-02 21:13:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:19,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:19,866 INFO L87 Difference]: Start difference. First operand 963 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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:13:21,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:22,219 INFO L93 Difference]: Finished difference Result 1939 states and 2968 transitions. [2022-11-02 21:13:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 226 [2022-11-02 21:13:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:22,222 INFO L225 Difference]: With dead ends: 1939 [2022-11-02 21:13:22,222 INFO L226 Difference]: Without dead ends: 999 [2022-11-02 21:13:22,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:22,224 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 18 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:22,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 533 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:13:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-11-02 21:13:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 963. [2022-11-02 21:13:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.5301455301455302) internal successors, (1472), 962 states have internal predecessors, (1472), 0 states have call successors, (0), 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:13:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1472 transitions. [2022-11-02 21:13:22,255 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1472 transitions. Word has length 226 [2022-11-02 21:13:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:22,255 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1472 transitions. [2022-11-02 21:13:22,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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:13:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1472 transitions. [2022-11-02 21:13:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-02 21:13:22,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:22,258 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:22,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:13:22,259 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -899643668, now seen corresponding path program 1 times [2022-11-02 21:13:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:22,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975120890] [2022-11-02 21:13:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-11-02 21:13:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975120890] [2022-11-02 21:13:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975120890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531573987] [2022-11-02 21:13:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:22,758 INFO L87 Difference]: Start difference. First operand 963 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:13:24,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:25,226 INFO L93 Difference]: Finished difference Result 2074 states and 3145 transitions. [2022-11-02 21:13:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:25,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 227 [2022-11-02 21:13:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:25,231 INFO L225 Difference]: With dead ends: 2074 [2022-11-02 21:13:25,232 INFO L226 Difference]: Without dead ends: 1134 [2022-11-02 21:13:25,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:25,234 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 125 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:25,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 335 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:13:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-11-02 21:13:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 963. [2022-11-02 21:13:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.5155925155925156) internal successors, (1458), 962 states have internal predecessors, (1458), 0 states have call successors, (0), 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:13:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1458 transitions. [2022-11-02 21:13:25,269 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1458 transitions. Word has length 227 [2022-11-02 21:13:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:25,269 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1458 transitions. [2022-11-02 21:13:25,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:13:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1458 transitions. [2022-11-02 21:13:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-11-02 21:13:25,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:25,272 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:25,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:13:25,273 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2004826738, now seen corresponding path program 1 times [2022-11-02 21:13:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326888284] [2022-11-02 21:13:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 290 proven. 34 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-02 21:13:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:26,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326888284] [2022-11-02 21:13:26,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326888284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:13:26,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68136469] [2022-11-02 21:13:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:26,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:13:26,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:13:26,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:13:26,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:13:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:27,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:13:27,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:13:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-02 21:13:27,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:13:27,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68136469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:27,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:13:27,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-02 21:13:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136332641] [2022-11-02 21:13:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:27,283 INFO L87 Difference]: Start difference. First operand 963 states and 1458 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:13:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:27,340 INFO L93 Difference]: Finished difference Result 1285 states and 1953 transitions. [2022-11-02 21:13:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:27,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2022-11-02 21:13:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:27,345 INFO L225 Difference]: With dead ends: 1285 [2022-11-02 21:13:27,345 INFO L226 Difference]: Without dead ends: 1283 [2022-11-02 21:13:27,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:27,346 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:27,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 373 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-02 21:13:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2022-11-02 21:13:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 1.5218408736349454) internal successors, (1951), 1282 states have internal predecessors, (1951), 0 states have call successors, (0), 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:13:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1951 transitions. [2022-11-02 21:13:27,386 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1951 transitions. Word has length 230 [2022-11-02 21:13:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:27,387 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1951 transitions. [2022-11-02 21:13:27,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:13:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1951 transitions. [2022-11-02 21:13:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-11-02 21:13:27,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:27,391 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-11-02 21:13:27,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:13:27,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 21:13:27,617 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -270358069, now seen corresponding path program 1 times [2022-11-02 21:13:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011141300] [2022-11-02 21:13:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 443 proven. 34 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-02 21:13:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011141300] [2022-11-02 21:13:28,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011141300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:13:28,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729154596] [2022-11-02 21:13:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:28,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:13:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:13:28,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:13:28,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:13:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:29,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 21:13:29,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:13:29,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 21:13:29,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:13:29,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:13:29,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:13:29,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:13:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 471 proven. 48 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-11-02 21:13:29,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:13:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2022-11-02 21:13:29,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729154596] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 21:13:29,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:13:29,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-02 21:13:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456781794] [2022-11-02 21:13:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:29,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:13:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:29,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:13:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:13:29,873 INFO L87 Difference]: Start difference. First operand 1283 states and 1951 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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:13:31,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:33,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:34,572 INFO L93 Difference]: Finished difference Result 3058 states and 4640 transitions. [2022-11-02 21:13:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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 303 [2022-11-02 21:13:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:34,579 INFO L225 Difference]: With dead ends: 3058 [2022-11-02 21:13:34,579 INFO L226 Difference]: Without dead ends: 1798 [2022-11-02 21:13:34,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:13:34,583 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 129 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:34,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 441 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 311 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 21:13:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2022-11-02 21:13:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1571. [2022-11-02 21:13:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.5331210191082802) internal successors, (2407), 1570 states have internal predecessors, (2407), 0 states have call successors, (0), 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:13:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2407 transitions. [2022-11-02 21:13:34,663 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2407 transitions. Word has length 303 [2022-11-02 21:13:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:34,664 INFO L495 AbstractCegarLoop]: Abstraction has 1571 states and 2407 transitions. [2022-11-02 21:13:34,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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:13:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2407 transitions. [2022-11-02 21:13:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-11-02 21:13:34,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:34,669 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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 21:13:34,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:13:34,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 21:13:34,885 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -273851134, now seen corresponding path program 1 times [2022-11-02 21:13:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:34,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124452719] [2022-11-02 21:13:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-11-02 21:13:35,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:35,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124452719] [2022-11-02 21:13:35,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124452719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:35,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:35,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912572058] [2022-11-02 21:13:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:35,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:35,454 INFO L87 Difference]: Start difference. First operand 1571 states and 2407 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:13:37,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:38,022 INFO L93 Difference]: Finished difference Result 3516 states and 5359 transitions. [2022-11-02 21:13:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:38,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2022-11-02 21:13:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:38,028 INFO L225 Difference]: With dead ends: 3516 [2022-11-02 21:13:38,029 INFO L226 Difference]: Without dead ends: 1968 [2022-11-02 21:13:38,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:38,033 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 102 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:38,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 339 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:13:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-11-02 21:13:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1719. [2022-11-02 21:13:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 1.5320139697322468) internal successors, (2632), 1718 states have internal predecessors, (2632), 0 states have call successors, (0), 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:13:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2632 transitions. [2022-11-02 21:13:38,096 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2632 transitions. Word has length 315 [2022-11-02 21:13:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:38,096 INFO L495 AbstractCegarLoop]: Abstraction has 1719 states and 2632 transitions. [2022-11-02 21:13:38,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:13:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2632 transitions. [2022-11-02 21:13:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-11-02 21:13:38,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:38,102 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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 21:13:38,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:13:38,102 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 157640067, now seen corresponding path program 1 times [2022-11-02 21:13:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:38,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837338262] [2022-11-02 21:13:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-11-02 21:13:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:38,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837338262] [2022-11-02 21:13:38,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837338262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:38,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:38,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812374533] [2022-11-02 21:13:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:38,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:38,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:38,625 INFO L87 Difference]: Start difference. First operand 1719 states and 2632 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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:13:40,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:41,161 INFO L93 Difference]: Finished difference Result 3644 states and 5545 transitions. [2022-11-02 21:13:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:41,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 316 [2022-11-02 21:13:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:41,166 INFO L225 Difference]: With dead ends: 3644 [2022-11-02 21:13:41,166 INFO L226 Difference]: Without dead ends: 1948 [2022-11-02 21:13:41,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:41,168 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 101 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:41,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 351 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:13:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-11-02 21:13:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1719. [2022-11-02 21:13:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 1.5232828870779977) internal successors, (2617), 1718 states have internal predecessors, (2617), 0 states have call successors, (0), 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:13:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2617 transitions. [2022-11-02 21:13:41,232 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2617 transitions. Word has length 316 [2022-11-02 21:13:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:41,233 INFO L495 AbstractCegarLoop]: Abstraction has 1719 states and 2617 transitions. [2022-11-02 21:13:41,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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:13:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2617 transitions. [2022-11-02 21:13:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-11-02 21:13:41,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:41,237 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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:13:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:13:41,238 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1517469961, now seen corresponding path program 1 times [2022-11-02 21:13:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:41,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248545513] [2022-11-02 21:13:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-11-02 21:13:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:42,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248545513] [2022-11-02 21:13:42,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248545513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:42,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:42,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:13:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743763305] [2022-11-02 21:13:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:42,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:13:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:42,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:13:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:13:42,823 INFO L87 Difference]: Start difference. First operand 1719 states and 2617 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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:13:44,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:46,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:48,468 INFO L93 Difference]: Finished difference Result 5138 states and 7849 transitions. [2022-11-02 21:13:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:13:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 325 [2022-11-02 21:13:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:48,479 INFO L225 Difference]: With dead ends: 5138 [2022-11-02 21:13:48,480 INFO L226 Difference]: Without dead ends: 3442 [2022-11-02 21:13:48,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:13:48,483 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 329 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 76 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:48,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1103 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 797 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:13:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2022-11-02 21:13:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3239. [2022-11-02 21:13:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 3238 states have (on average 1.5435453983940703) internal successors, (4998), 3238 states have internal predecessors, (4998), 0 states have call successors, (0), 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:13:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4998 transitions. [2022-11-02 21:13:48,609 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4998 transitions. Word has length 325 [2022-11-02 21:13:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:48,609 INFO L495 AbstractCegarLoop]: Abstraction has 3239 states and 4998 transitions. [2022-11-02 21:13:48,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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:13:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4998 transitions. [2022-11-02 21:13:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-11-02 21:13:48,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:48,617 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:48,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:13:48,617 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1066276522, now seen corresponding path program 1 times [2022-11-02 21:13:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:48,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186133621] [2022-11-02 21:13:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-11-02 21:13:49,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:49,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186133621] [2022-11-02 21:13:49,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186133621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:49,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:49,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096949069] [2022-11-02 21:13:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:49,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:49,385 INFO L87 Difference]: Start difference. First operand 3239 states and 4998 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:13:51,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:51,898 INFO L93 Difference]: Finished difference Result 7001 states and 10771 transitions. [2022-11-02 21:13:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:51,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 326 [2022-11-02 21:13:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:51,908 INFO L225 Difference]: With dead ends: 7001 [2022-11-02 21:13:51,909 INFO L226 Difference]: Without dead ends: 3761 [2022-11-02 21:13:51,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:51,913 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 52 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:51,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 590 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:13:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2022-11-02 21:13:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3527. [2022-11-02 21:13:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3526 states have (on average 1.5467952353942145) internal successors, (5454), 3526 states have internal predecessors, (5454), 0 states have call successors, (0), 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:13:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 5454 transitions. [2022-11-02 21:13:52,051 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 5454 transitions. Word has length 326 [2022-11-02 21:13:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:52,051 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 5454 transitions. [2022-11-02 21:13:52,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:13:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 5454 transitions. [2022-11-02 21:13:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-11-02 21:13:52,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:52,059 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 21:13:52,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 21:13:52,060 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -723493453, now seen corresponding path program 1 times [2022-11-02 21:13:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:52,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288670044] [2022-11-02 21:13:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-02 21:13:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288670044] [2022-11-02 21:13:52,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288670044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:52,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:52,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165949475] [2022-11-02 21:13:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:52,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:52,596 INFO L87 Difference]: Start difference. First operand 3527 states and 5454 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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:13:54,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:55,128 INFO L93 Difference]: Finished difference Result 7138 states and 11022 transitions. [2022-11-02 21:13:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 338 [2022-11-02 21:13:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:55,133 INFO L225 Difference]: With dead ends: 7138 [2022-11-02 21:13:55,133 INFO L226 Difference]: Without dead ends: 3634 [2022-11-02 21:13:55,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:55,136 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 71 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:55,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 591 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:13:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2022-11-02 21:13:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3527. [2022-11-02 21:13:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3526 states have (on average 1.5459444129325015) internal successors, (5451), 3526 states have internal predecessors, (5451), 0 states have call successors, (0), 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:13:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 5451 transitions. [2022-11-02 21:13:55,293 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 5451 transitions. Word has length 338 [2022-11-02 21:13:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:55,293 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 5451 transitions. [2022-11-02 21:13:55,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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:13:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 5451 transitions. [2022-11-02 21:13:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2022-11-02 21:13:55,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:55,300 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 21:13:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 21:13:55,301 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1362236269, now seen corresponding path program 1 times [2022-11-02 21:13:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:55,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338665923] [2022-11-02 21:13:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-02 21:13:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:55,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338665923] [2022-11-02 21:13:55,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338665923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:55,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:55,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940811273] [2022-11-02 21:13:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:55,963 INFO L87 Difference]: Start difference. First operand 3527 states and 5451 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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:13:57,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:13:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:58,557 INFO L93 Difference]: Finished difference Result 7463 states and 11460 transitions. [2022-11-02 21:13:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:13:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 339 [2022-11-02 21:13:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:58,562 INFO L225 Difference]: With dead ends: 7463 [2022-11-02 21:13:58,563 INFO L226 Difference]: Without dead ends: 3959 [2022-11-02 21:13:58,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:13:58,566 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:58,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 351 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:13:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2022-11-02 21:13:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 3527. [2022-11-02 21:13:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3526 states have (on average 1.5280771412365286) internal successors, (5388), 3526 states have internal predecessors, (5388), 0 states have call successors, (0), 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:13:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 5388 transitions. [2022-11-02 21:13:58,704 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 5388 transitions. Word has length 339 [2022-11-02 21:13:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:58,705 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 5388 transitions. [2022-11-02 21:13:58,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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:13:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 5388 transitions. [2022-11-02 21:13:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-11-02 21:13:58,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:58,712 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-11-02 21:13:58,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 21:13:58,712 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1244495786, now seen corresponding path program 1 times [2022-11-02 21:13:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:58,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5297622] [2022-11-02 21:13:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-02 21:13:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:59,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5297622] [2022-11-02 21:13:59,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5297622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:59,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:59,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:13:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584535941] [2022-11-02 21:13:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:59,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:13:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:13:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:13:59,328 INFO L87 Difference]: Start difference. First operand 3527 states and 5388 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:01,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:01,944 INFO L93 Difference]: Finished difference Result 7775 states and 11814 transitions. [2022-11-02 21:14:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:01,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2022-11-02 21:14:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:01,953 INFO L225 Difference]: With dead ends: 7775 [2022-11-02 21:14:01,953 INFO L226 Difference]: Without dead ends: 4271 [2022-11-02 21:14:01,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:01,958 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 109 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:01,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 353 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:14:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-11-02 21:14:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3751. [2022-11-02 21:14:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5117333333333334) internal successors, (5669), 3750 states have internal predecessors, (5669), 0 states have call successors, (0), 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:14:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5669 transitions. [2022-11-02 21:14:02,092 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5669 transitions. Word has length 341 [2022-11-02 21:14:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:02,092 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5669 transitions. [2022-11-02 21:14:02,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5669 transitions. [2022-11-02 21:14:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-11-02 21:14:02,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:02,099 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:02,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 21:14:02,099 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1779158444, now seen corresponding path program 1 times [2022-11-02 21:14:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:02,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956342420] [2022-11-02 21:14:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:14:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:02,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956342420] [2022-11-02 21:14:02,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956342420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:02,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:02,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092713202] [2022-11-02 21:14:02,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:02,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:02,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:02,696 INFO L87 Difference]: Start difference. First operand 3751 states and 5669 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:04,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:05,176 INFO L93 Difference]: Finished difference Result 7697 states and 11609 transitions. [2022-11-02 21:14:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:05,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2022-11-02 21:14:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:05,184 INFO L225 Difference]: With dead ends: 7697 [2022-11-02 21:14:05,184 INFO L226 Difference]: Without dead ends: 3969 [2022-11-02 21:14:05,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:05,189 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 53 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:05,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 582 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:14:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2022-11-02 21:14:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 3751. [2022-11-02 21:14:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5096) internal successors, (5661), 3750 states have internal predecessors, (5661), 0 states have call successors, (0), 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:14:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5661 transitions. [2022-11-02 21:14:05,334 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5661 transitions. Word has length 341 [2022-11-02 21:14:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:05,335 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5661 transitions. [2022-11-02 21:14:05,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5661 transitions. [2022-11-02 21:14:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-11-02 21:14:05,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:05,342 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-11-02 21:14:05,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 21:14:05,343 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -604197104, now seen corresponding path program 1 times [2022-11-02 21:14:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:05,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554034628] [2022-11-02 21:14:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-02 21:14:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:05,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554034628] [2022-11-02 21:14:05,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554034628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:05,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:05,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744352586] [2022-11-02 21:14:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:05,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:05,854 INFO L87 Difference]: Start difference. First operand 3751 states and 5661 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 21:14:07,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:08,306 INFO L93 Difference]: Finished difference Result 7556 states and 11391 transitions. [2022-11-02 21:14:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 342 [2022-11-02 21:14:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:08,315 INFO L225 Difference]: With dead ends: 7556 [2022-11-02 21:14:08,315 INFO L226 Difference]: Without dead ends: 3828 [2022-11-02 21:14:08,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:08,320 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 59 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:08,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 577 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2022-11-02 21:14:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3751. [2022-11-02 21:14:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5088) internal successors, (5658), 3750 states have internal predecessors, (5658), 0 states have call successors, (0), 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:14:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5658 transitions. [2022-11-02 21:14:08,465 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5658 transitions. Word has length 342 [2022-11-02 21:14:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:08,465 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5658 transitions. [2022-11-02 21:14:08,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 21:14:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5658 transitions. [2022-11-02 21:14:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-11-02 21:14:08,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:08,472 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:08,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 21:14:08,472 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -871793655, now seen corresponding path program 1 times [2022-11-02 21:14:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:08,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62900832] [2022-11-02 21:14:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:14:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:09,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62900832] [2022-11-02 21:14:09,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62900832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:09,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:09,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724123918] [2022-11-02 21:14:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:09,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:09,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:09,105 INFO L87 Difference]: Start difference. First operand 3751 states and 5658 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:11,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:11,542 INFO L93 Difference]: Finished difference Result 7633 states and 11483 transitions. [2022-11-02 21:14:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2022-11-02 21:14:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:11,575 INFO L225 Difference]: With dead ends: 7633 [2022-11-02 21:14:11,576 INFO L226 Difference]: Without dead ends: 3905 [2022-11-02 21:14:11,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:11,579 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 44 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:11,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-11-02 21:14:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3751. [2022-11-02 21:14:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5066666666666666) internal successors, (5650), 3750 states have internal predecessors, (5650), 0 states have call successors, (0), 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:14:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5650 transitions. [2022-11-02 21:14:11,724 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5650 transitions. Word has length 345 [2022-11-02 21:14:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:11,724 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5650 transitions. [2022-11-02 21:14:11,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5650 transitions. [2022-11-02 21:14:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-11-02 21:14:11,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:11,731 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2022-11-02 21:14:11,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 21:14:11,731 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1584809309, now seen corresponding path program 1 times [2022-11-02 21:14:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879617967] [2022-11-02 21:14:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2022-11-02 21:14:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879617967] [2022-11-02 21:14:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879617967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:12,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:12,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399682587] [2022-11-02 21:14:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:12,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:12,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:12,192 INFO L87 Difference]: Start difference. First operand 3751 states and 5650 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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:14:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:14,652 INFO L93 Difference]: Finished difference Result 7556 states and 11369 transitions. [2022-11-02 21:14:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 347 [2022-11-02 21:14:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:14,660 INFO L225 Difference]: With dead ends: 7556 [2022-11-02 21:14:14,660 INFO L226 Difference]: Without dead ends: 3828 [2022-11-02 21:14:14,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:14,664 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 52 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:14,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 573 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2022-11-02 21:14:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3751. [2022-11-02 21:14:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5058666666666667) internal successors, (5647), 3750 states have internal predecessors, (5647), 0 states have call successors, (0), 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:14:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5647 transitions. [2022-11-02 21:14:14,809 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5647 transitions. Word has length 347 [2022-11-02 21:14:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:14,809 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5647 transitions. [2022-11-02 21:14:14,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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:14:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5647 transitions. [2022-11-02 21:14:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-11-02 21:14:14,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:14,816 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:14,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 21:14:14,816 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1676437080, now seen corresponding path program 1 times [2022-11-02 21:14:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:14,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611740449] [2022-11-02 21:14:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-11-02 21:14:15,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:15,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611740449] [2022-11-02 21:14:15,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611740449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:15,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:15,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584335733] [2022-11-02 21:14:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:15,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:15,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:15,493 INFO L87 Difference]: Start difference. First operand 3751 states and 5647 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 21:14:17,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:17,907 INFO L93 Difference]: Finished difference Result 7633 states and 11461 transitions. [2022-11-02 21:14:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 347 [2022-11-02 21:14:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:17,914 INFO L225 Difference]: With dead ends: 7633 [2022-11-02 21:14:17,914 INFO L226 Difference]: Without dead ends: 3905 [2022-11-02 21:14:17,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:17,918 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 50 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:17,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 570 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-11-02 21:14:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3751. [2022-11-02 21:14:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5037333333333334) internal successors, (5639), 3750 states have internal predecessors, (5639), 0 states have call successors, (0), 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:14:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5639 transitions. [2022-11-02 21:14:18,071 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5639 transitions. Word has length 347 [2022-11-02 21:14:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:18,072 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5639 transitions. [2022-11-02 21:14:18,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 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 21:14:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5639 transitions. [2022-11-02 21:14:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2022-11-02 21:14:18,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:18,078 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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] [2022-11-02 21:14:18,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 21:14:18,079 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1905695684, now seen corresponding path program 1 times [2022-11-02 21:14:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:18,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955678684] [2022-11-02 21:14:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2022-11-02 21:14:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:18,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955678684] [2022-11-02 21:14:18,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955678684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:18,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:18,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756552655] [2022-11-02 21:14:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:18,609 INFO L87 Difference]: Start difference. First operand 3751 states and 5639 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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:14:20,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:21,061 INFO L93 Difference]: Finished difference Result 7550 states and 11341 transitions. [2022-11-02 21:14:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:21,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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 348 [2022-11-02 21:14:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:21,066 INFO L225 Difference]: With dead ends: 7550 [2022-11-02 21:14:21,066 INFO L226 Difference]: Without dead ends: 3822 [2022-11-02 21:14:21,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:21,069 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 49 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:21,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 569 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2022-11-02 21:14:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3751. [2022-11-02 21:14:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5029333333333332) internal successors, (5636), 3750 states have internal predecessors, (5636), 0 states have call successors, (0), 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:14:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5636 transitions. [2022-11-02 21:14:21,220 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5636 transitions. Word has length 348 [2022-11-02 21:14:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:21,220 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5636 transitions. [2022-11-02 21:14:21,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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:14:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5636 transitions. [2022-11-02 21:14:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2022-11-02 21:14:21,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:21,228 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:21,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 21:14:21,228 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash 712361294, now seen corresponding path program 1 times [2022-11-02 21:14:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721669447] [2022-11-02 21:14:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-11-02 21:14:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:21,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721669447] [2022-11-02 21:14:21,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721669447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:21,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:21,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510353475] [2022-11-02 21:14:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:21,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:21,829 INFO L87 Difference]: Start difference. First operand 3751 states and 5636 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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:14:23,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:24,198 INFO L93 Difference]: Finished difference Result 7601 states and 11395 transitions. [2022-11-02 21:14:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 348 [2022-11-02 21:14:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:24,202 INFO L225 Difference]: With dead ends: 7601 [2022-11-02 21:14:24,202 INFO L226 Difference]: Without dead ends: 3873 [2022-11-02 21:14:24,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:24,205 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 44 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:24,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 562 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 21:14:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-11-02 21:14:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3751. [2022-11-02 21:14:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.5008) internal successors, (5628), 3750 states have internal predecessors, (5628), 0 states have call successors, (0), 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:14:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5628 transitions. [2022-11-02 21:14:24,327 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5628 transitions. Word has length 348 [2022-11-02 21:14:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:24,328 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 5628 transitions. [2022-11-02 21:14:24,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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:14:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5628 transitions. [2022-11-02 21:14:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2022-11-02 21:14:24,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:24,335 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 21:14:24,335 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1303941643, now seen corresponding path program 1 times [2022-11-02 21:14:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:24,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266288633] [2022-11-02 21:14:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 668 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-02 21:14:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:24,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266288633] [2022-11-02 21:14:24,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266288633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:24,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:24,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677936553] [2022-11-02 21:14:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:24,882 INFO L87 Difference]: Start difference. First operand 3751 states and 5628 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:26,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:27,308 INFO L93 Difference]: Finished difference Result 7793 states and 11679 transitions. [2022-11-02 21:14:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2022-11-02 21:14:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:27,312 INFO L225 Difference]: With dead ends: 7793 [2022-11-02 21:14:27,312 INFO L226 Difference]: Without dead ends: 4065 [2022-11-02 21:14:27,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:27,316 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 28 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:27,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 554 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2022-11-02 21:14:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3959. [2022-11-02 21:14:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3958 states have (on average 1.4987367357251138) internal successors, (5932), 3958 states have internal predecessors, (5932), 0 states have call successors, (0), 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:14:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5932 transitions. [2022-11-02 21:14:27,409 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5932 transitions. Word has length 348 [2022-11-02 21:14:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:27,410 INFO L495 AbstractCegarLoop]: Abstraction has 3959 states and 5932 transitions. [2022-11-02 21:14:27,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5932 transitions. [2022-11-02 21:14:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-11-02 21:14:27,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:27,415 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:27,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 21:14:27,416 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1881309984, now seen corresponding path program 1 times [2022-11-02 21:14:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:27,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029211403] [2022-11-02 21:14:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-02 21:14:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029211403] [2022-11-02 21:14:27,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029211403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:27,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:27,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:14:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015939220] [2022-11-02 21:14:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:14:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:14:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:14:27,849 INFO L87 Difference]: Start difference. First operand 3959 states and 5932 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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:14:29,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:30,286 INFO L93 Difference]: Finished difference Result 8065 states and 12079 transitions. [2022-11-02 21:14:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:14:30,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2022-11-02 21:14:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:30,290 INFO L225 Difference]: With dead ends: 8065 [2022-11-02 21:14:30,291 INFO L226 Difference]: Without dead ends: 4129 [2022-11-02 21:14:30,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:30,294 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 39 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:30,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 565 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:14:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-11-02 21:14:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3959. [2022-11-02 21:14:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3958 states have (on average 1.4967155128852956) internal successors, (5924), 3958 states have internal predecessors, (5924), 0 states have call successors, (0), 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:14:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5924 transitions. [2022-11-02 21:14:30,395 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5924 transitions. Word has length 354 [2022-11-02 21:14:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:30,395 INFO L495 AbstractCegarLoop]: Abstraction has 3959 states and 5924 transitions. [2022-11-02 21:14:30,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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:14:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5924 transitions. [2022-11-02 21:14:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-02 21:14:30,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:30,402 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:14:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 21:14:30,402 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1131006309, now seen corresponding path program 2 times [2022-11-02 21:14:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706925138] [2022-11-02 21:14:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2022-11-02 21:14:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706925138] [2022-11-02 21:14:31,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706925138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:31,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:14:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365706583] [2022-11-02 21:14:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:31,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:14:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:31,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:14:31,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:31,706 INFO L87 Difference]: Start difference. First operand 3959 states and 5924 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:33,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:35,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:37,236 INFO L93 Difference]: Finished difference Result 14483 states and 21737 transitions. [2022-11-02 21:14:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:14:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-11-02 21:14:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:37,247 INFO L225 Difference]: With dead ends: 14483 [2022-11-02 21:14:37,247 INFO L226 Difference]: Without dead ends: 10547 [2022-11-02 21:14:37,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:14:37,251 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 230 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:37,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1025 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 663 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 21:14:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10547 states. [2022-11-02 21:14:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10547 to 3827. [2022-11-02 21:14:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3826 states have (on average 1.4960794563512807) internal successors, (5724), 3826 states have internal predecessors, (5724), 0 states have call successors, (0), 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:14:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 5724 transitions. [2022-11-02 21:14:37,395 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 5724 transitions. Word has length 355 [2022-11-02 21:14:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:37,395 INFO L495 AbstractCegarLoop]: Abstraction has 3827 states and 5724 transitions. [2022-11-02 21:14:37,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:14:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 5724 transitions. [2022-11-02 21:14:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-02 21:14:37,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:37,399 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 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] [2022-11-02 21:14:37,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 21:14:37,400 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1310451481, now seen corresponding path program 1 times [2022-11-02 21:14:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:37,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376077519] [2022-11-02 21:14:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2022-11-02 21:14:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376077519] [2022-11-02 21:14:40,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376077519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:40,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:14:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510669096] [2022-11-02 21:14:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:14:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:14:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:14:40,513 INFO L87 Difference]: Start difference. First operand 3827 states and 5724 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:14:42,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:44,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:44,986 INFO L93 Difference]: Finished difference Result 7651 states and 11444 transitions. [2022-11-02 21:14:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:14:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 355 [2022-11-02 21:14:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:44,990 INFO L225 Difference]: With dead ends: 7651 [2022-11-02 21:14:44,990 INFO L226 Difference]: Without dead ends: 3827 [2022-11-02 21:14:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:14:44,993 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:44,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 643 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 21:14:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-11-02 21:14:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3827. [2022-11-02 21:14:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3826 states have (on average 1.4958180867746995) internal successors, (5723), 3826 states have internal predecessors, (5723), 0 states have call successors, (0), 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:14:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 5723 transitions. [2022-11-02 21:14:45,102 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 5723 transitions. Word has length 355 [2022-11-02 21:14:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:45,102 INFO L495 AbstractCegarLoop]: Abstraction has 3827 states and 5723 transitions. [2022-11-02 21:14:45,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:14:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 5723 transitions. [2022-11-02 21:14:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-02 21:14:45,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:45,106 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 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] [2022-11-02 21:14:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 21:14:45,107 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1162756329, now seen corresponding path program 1 times [2022-11-02 21:14:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:45,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060381133] [2022-11-02 21:14:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:15:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 121 proven. 1019 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:15:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:15:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060381133] [2022-11-02 21:15:09,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060381133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:15:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737046617] [2022-11-02 21:15:09,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:15:09,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:15:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:15:09,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:15:09,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a64ca88-52ef-4024-ae7d-7c335207ac82/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:15:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:15:11,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-02 21:15:11,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:15:11,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 21:15:11,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:15:11,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-02 21:15:11,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:15:11,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2022-11-02 21:15:11,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2022-11-02 21:15:11,546 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-02 21:15:11,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2022-11-02 21:15:11,577 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-02 21:15:11,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2022-11-02 21:15:11,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2022-11-02 21:15:11,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2022-11-02 21:15:12,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 21:15:12,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 21:15:12,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:15:12,149 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-02 21:15:12,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2022-11-02 21:15:12,227 INFO L356 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-02 21:15:12,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 88 [2022-11-02 21:15:12,294 INFO L356 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-02 21:15:12,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 52 [2022-11-02 21:15:12,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 178 [2022-11-02 21:15:12,628 INFO L356 Elim1Store]: treesize reduction 149, result has 22.4 percent of original size [2022-11-02 21:15:12,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 197 treesize of output 200 [2022-11-02 21:15:12,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 200 [2022-11-02 21:15:16,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 247 [2022-11-02 21:15:16,726 INFO L356 Elim1Store]: treesize reduction 170, result has 22.0 percent of original size [2022-11-02 21:15:16,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 245 [2022-11-02 21:15:16,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 236 [2022-11-02 21:15:23,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2022-11-02 21:15:23,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-11-02 21:15:23,319 INFO L356 Elim1Store]: treesize reduction 171, result has 10.9 percent of original size [2022-11-02 21:15:23,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 73 [2022-11-02 21:15:23,487 INFO L356 Elim1Store]: treesize reduction 121, result has 27.1 percent of original size [2022-11-02 21:15:23,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2022-11-02 21:15:23,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2022-11-02 21:15:23,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2022-11-02 21:15:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:15:24,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:15:24,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2022-11-02 21:15:24,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:15:24,778 INFO L356 Elim1Store]: treesize reduction 105, result has 48.3 percent of original size [2022-11-02 21:15:24,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 137 [2022-11-02 21:15:24,827 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-11-02 21:15:24,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 130 [2022-11-02 21:15:25,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2022-11-02 21:15:25,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 132 [2022-11-02 21:15:25,215 INFO L356 Elim1Store]: treesize reduction 205, result has 9.3 percent of original size [2022-11-02 21:15:25,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 105 [2022-11-02 21:15:28,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 129 [2022-11-02 21:15:28,606 INFO L356 Elim1Store]: treesize reduction 119, result has 15.0 percent of original size [2022-11-02 21:15:28,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 102 [2022-11-02 21:15:28,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 121 [2022-11-02 21:15:28,898 INFO L356 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2022-11-02 21:15:28,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 221 treesize of output 176 [2022-11-02 21:15:28,964 INFO L356 Elim1Store]: treesize reduction 137, result has 23.5 percent of original size [2022-11-02 21:15:28,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 95 [2022-11-02 21:15:29,014 INFO L356 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2022-11-02 21:15:29,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 185 [2022-11-02 21:15:29,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 157 [2022-11-02 21:15:29,348 INFO L356 Elim1Store]: treesize reduction 119, result has 15.0 percent of original size [2022-11-02 21:15:29,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2022-11-02 21:15:29,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 157 [2022-11-02 21:15:33,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 145 [2022-11-02 21:15:33,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 91 [2022-11-02 21:15:33,847 INFO L356 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2022-11-02 21:15:33,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2022-11-02 21:15:37,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:15:37,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 150 [2022-11-02 21:15:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 346 proven. 794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:15:40,166 INFO L328 TraceCheckSpWp]: Computing backward predicates...