./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/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_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/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_a0fdd874-9058-43e0-be5b-0b42370430fa/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 64affc32c9ee6b1616cdbc82208fa978b35ea8d8fb3017d6636bda9ef421e017 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:24:25,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:24:25,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:24:25,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:24:25,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:24:25,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:24:25,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:24:25,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:24:25,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:24:25,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:24:25,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:24:25,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:24:25,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:24:25,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:24:25,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:24:25,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:24:25,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:24:25,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:24:25,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:24:25,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:24:25,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:24:25,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:24:25,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:24:25,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:24:25,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:24:25,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:24:25,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:24:25,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:24:25,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:24:25,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:24:25,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:24:25,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:24:25,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:24:25,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:24:25,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:24:25,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:24:25,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:24:25,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:24:25,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:24:25,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:24:25,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:24:25,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:24:25,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:24:25,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:24:25,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:24:25,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:24:25,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:24:25,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:24:25,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:24:25,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:24:25,633 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:24:25,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:24:25,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:24:25,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:24:25,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:24:25,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:24:25,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:24:25,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:24:25,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:24:25,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:24:25,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:24:25,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:24:25,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:24:25,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:24:25,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:24:25,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:24:25,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:25,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:24:25,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:24:25,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:24:25,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:24:25,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:24:25,639 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:24:25,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:24:25,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:24:25,640 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_a0fdd874-9058-43e0-be5b-0b42370430fa/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_a0fdd874-9058-43e0-be5b-0b42370430fa/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 -> 64affc32c9ee6b1616cdbc82208fa978b35ea8d8fb3017d6636bda9ef421e017 [2022-11-02 20:24:25,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:24:26,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:24:26,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:24:26,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:24:26,029 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:24:26,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c [2022-11-02 20:24:26,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/data/0043705b8/03ae7ce50cbd41a7a1a15279b9b3be13/FLAG64ee0d4b4 [2022-11-02 20:24:26,820 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:24:26,821 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c [2022-11-02 20:24:26,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/data/0043705b8/03ae7ce50cbd41a7a1a15279b9b3be13/FLAG64ee0d4b4 [2022-11-02 20:24:26,989 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/data/0043705b8/03ae7ce50cbd41a7a1a15279b9b3be13 [2022-11-02 20:24:26,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:24:26,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:24:26,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:26,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:24:27,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:24:27,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:26" (1/1) ... [2022-11-02 20:24:27,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea77b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27, skipping insertion in model container [2022-11-02 20:24:27,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:24:26" (1/1) ... [2022-11-02 20:24:27,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:24:27,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:24:27,625 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_a0fdd874-9058-43e0-be5b-0b42370430fa/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c[75436,75449] [2022-11-02 20:24:27,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:27,649 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:24:27,784 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_a0fdd874-9058-43e0-be5b-0b42370430fa/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-2.c[75436,75449] [2022-11-02 20:24:27,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:24:27,806 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:24:27,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27 WrapperNode [2022-11-02 20:24:27,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:24:27,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:27,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:24:27,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:24:27,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:27,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:27,896 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 798 [2022-11-02 20:24:27,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:24:27,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:24:27,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:24:27,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:24:27,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:27,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:27,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:27,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:24:28,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:24:28,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:24:28,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:24:28,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (1/1) ... [2022-11-02 20:24:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:24:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:28,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:24:28,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:24:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:24:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:24:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:24:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:24:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:24:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:24:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:24:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:24:28,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:24:28,465 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:24:28,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:24:28,491 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:24:31,682 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 20:24:31,682 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 20:24:31,682 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:24:31,703 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:24:31,704 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:24:31,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:31 BoogieIcfgContainer [2022-11-02 20:24:31,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:24:31,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:24:31,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:24:31,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:24:31,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:24:26" (1/3) ... [2022-11-02 20:24:31,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f12e163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:31, skipping insertion in model container [2022-11-02 20:24:31,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:24:27" (2/3) ... [2022-11-02 20:24:31,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f12e163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:24:31, skipping insertion in model container [2022-11-02 20:24:31,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:24:31" (3/3) ... [2022-11-02 20:24:31,723 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2022-11-02 20:24:31,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:24:31,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:24:31,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:24:31,836 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;@2a7cafcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:24:31,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:24:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 151 states have (on average 1.7218543046357615) internal successors, (260), 152 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:24:31,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:31,865 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] [2022-11-02 20:24:31,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 918515972, now seen corresponding path program 1 times [2022-11-02 20:24:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:31,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841535432] [2022-11-02 20:24:31,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:33,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841535432] [2022-11-02 20:24:33,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841535432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:33,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:33,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457398564] [2022-11-02 20:24:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:33,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:33,351 INFO L87 Difference]: Start difference. First operand has 153 states, 151 states have (on average 1.7218543046357615) internal successors, (260), 152 states have internal predecessors, (260), 0 states have call successors, (0), 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 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:35,353 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 20:24:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:36,234 INFO L93 Difference]: Finished difference Result 431 states and 736 transitions. [2022-11-02 20:24:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:24:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:36,263 INFO L225 Difference]: With dead ends: 431 [2022-11-02 20:24:36,263 INFO L226 Difference]: Without dead ends: 263 [2022-11-02 20:24:36,267 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 20:24:36,281 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 164 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:36,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 459 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:24:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-02 20:24:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 180. [2022-11-02 20:24:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.6145251396648044) internal successors, (289), 179 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-11-02 20:24:36,390 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 44 [2022-11-02 20:24:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:36,391 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-11-02 20:24:36,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-11-02 20:24:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:24:36,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:36,394 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] [2022-11-02 20:24:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:24:36,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1831970075, now seen corresponding path program 1 times [2022-11-02 20:24:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:36,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030557416] [2022-11-02 20:24:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030557416] [2022-11-02 20:24:37,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030557416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:37,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:37,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740588382] [2022-11-02 20:24:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:37,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:37,056 INFO L87 Difference]: Start difference. First operand 180 states and 289 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:37,980 INFO L93 Difference]: Finished difference Result 378 states and 605 transitions. [2022-11-02 20:24:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-11-02 20:24:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:37,983 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:24:37,983 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:24:37,984 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 20:24:37,985 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:37,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 487 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:24:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:24:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-11-02 20:24:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.6210526315789473) internal successors, (308), 190 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 308 transitions. [2022-11-02 20:24:37,999 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 308 transitions. Word has length 45 [2022-11-02 20:24:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:38,000 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 308 transitions. [2022-11-02 20:24:38,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 308 transitions. [2022-11-02 20:24:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:24:38,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:38,003 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] [2022-11-02 20:24:38,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:24:38,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 265450500, now seen corresponding path program 1 times [2022-11-02 20:24:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:38,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586385099] [2022-11-02 20:24:38,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:38,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:38,614 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 20:24:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:38,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586385099] [2022-11-02 20:24:38,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586385099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:38,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:38,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274591148] [2022-11-02 20:24:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:38,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:38,620 INFO L87 Difference]: Start difference. First operand 191 states and 308 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:40,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:24:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:40,761 INFO L93 Difference]: Finished difference Result 522 states and 847 transitions. [2022-11-02 20:24:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-02 20:24:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:40,764 INFO L225 Difference]: With dead ends: 522 [2022-11-02 20:24:40,764 INFO L226 Difference]: Without dead ends: 352 [2022-11-02 20:24:40,765 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 20:24:40,766 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 153 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:40,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 652 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:24:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-02 20:24:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 223. [2022-11-02 20:24:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.617117117117117) internal successors, (359), 222 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 359 transitions. [2022-11-02 20:24:40,800 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 359 transitions. Word has length 58 [2022-11-02 20:24:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:40,801 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 359 transitions. [2022-11-02 20:24:40,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 359 transitions. [2022-11-02 20:24:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:24:40,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:40,806 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] [2022-11-02 20:24:40,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:24:40,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:40,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:40,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1851609621, now seen corresponding path program 1 times [2022-11-02 20:24:40,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:40,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013675488] [2022-11-02 20:24:40,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:41,340 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 20:24:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013675488] [2022-11-02 20:24:41,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013675488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:41,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:41,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225991713] [2022-11-02 20:24:41,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:41,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:41,344 INFO L87 Difference]: Start difference. First operand 223 states and 359 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:42,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:24:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:43,266 INFO L93 Difference]: Finished difference Result 530 states and 850 transitions. [2022-11-02 20:24:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:43,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 20:24:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:43,268 INFO L225 Difference]: With dead ends: 530 [2022-11-02 20:24:43,269 INFO L226 Difference]: Without dead ends: 328 [2022-11-02 20:24:43,269 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 20:24:43,271 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 158 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:43,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 352 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:24:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-02 20:24:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 223. [2022-11-02 20:24:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.5990990990990992) internal successors, (355), 222 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 355 transitions. [2022-11-02 20:24:43,284 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 355 transitions. Word has length 59 [2022-11-02 20:24:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:43,285 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 355 transitions. [2022-11-02 20:24:43,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2022-11-02 20:24:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:24:43,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:43,287 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] [2022-11-02 20:24:43,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:24:43,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash -556454231, now seen corresponding path program 1 times [2022-11-02 20:24:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:43,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438290021] [2022-11-02 20:24:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:43,771 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 20:24:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:43,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438290021] [2022-11-02 20:24:43,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438290021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:43,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:43,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595110793] [2022-11-02 20:24:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:43,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:43,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:43,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:43,775 INFO L87 Difference]: Start difference. First operand 223 states and 355 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:45,784 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 20:24:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:46,197 INFO L93 Difference]: Finished difference Result 441 states and 699 transitions. [2022-11-02 20:24:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 20:24:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:46,200 INFO L225 Difference]: With dead ends: 441 [2022-11-02 20:24:46,200 INFO L226 Difference]: Without dead ends: 239 [2022-11-02 20:24:46,201 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 20:24:46,202 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 26 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:46,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 491 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:24:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-02 20:24:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2022-11-02 20:24:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.5945945945945945) internal successors, (354), 222 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 354 transitions. [2022-11-02 20:24:46,213 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 354 transitions. Word has length 59 [2022-11-02 20:24:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 354 transitions. [2022-11-02 20:24:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 354 transitions. [2022-11-02 20:24:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:24:46,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:46,216 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] [2022-11-02 20:24:46,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:24:46,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:46,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1408571008, now seen corresponding path program 1 times [2022-11-02 20:24:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:46,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45260140] [2022-11-02 20:24:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:46,637 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 20:24:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:46,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45260140] [2022-11-02 20:24:46,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45260140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:46,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:46,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770919918] [2022-11-02 20:24:46,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:46,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:46,641 INFO L87 Difference]: Start difference. First operand 223 states and 354 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:48,651 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 20:24:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:48,988 INFO L93 Difference]: Finished difference Result 440 states and 697 transitions. [2022-11-02 20:24:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 20:24:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:48,990 INFO L225 Difference]: With dead ends: 440 [2022-11-02 20:24:48,990 INFO L226 Difference]: Without dead ends: 238 [2022-11-02 20:24:48,990 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 20:24:48,991 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 19 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:48,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 493 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:24:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-02 20:24:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2022-11-02 20:24:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.59009009009009) internal successors, (353), 222 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 20:24:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 353 transitions. [2022-11-02 20:24:48,999 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 353 transitions. Word has length 59 [2022-11-02 20:24:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 353 transitions. [2022-11-02 20:24:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 353 transitions. [2022-11-02 20:24:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:24:49,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:49,002 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] [2022-11-02 20:24:49,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:24:49,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:49,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash 883176000, now seen corresponding path program 1 times [2022-11-02 20:24:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:49,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646408750] [2022-11-02 20:24:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:49,382 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 20:24:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646408750] [2022-11-02 20:24:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646408750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:49,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:49,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297861458] [2022-11-02 20:24:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:49,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:49,387 INFO L87 Difference]: Start difference. First operand 223 states and 353 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:50,825 INFO L93 Difference]: Finished difference Result 530 states and 841 transitions. [2022-11-02 20:24:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 20:24:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:50,827 INFO L225 Difference]: With dead ends: 530 [2022-11-02 20:24:50,827 INFO L226 Difference]: Without dead ends: 328 [2022-11-02 20:24:50,828 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 20:24:50,828 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 151 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:50,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 352 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:24:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-02 20:24:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 224. [2022-11-02 20:24:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.5784753363228698) internal successors, (352), 223 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 20:24:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 352 transitions. [2022-11-02 20:24:50,836 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 352 transitions. Word has length 59 [2022-11-02 20:24:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:50,840 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 352 transitions. [2022-11-02 20:24:50,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 352 transitions. [2022-11-02 20:24:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:24:50,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:50,842 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] [2022-11-02 20:24:50,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:24:50,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:50,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1725722285, now seen corresponding path program 1 times [2022-11-02 20:24:50,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:50,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395839815] [2022-11-02 20:24:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:51,169 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 20:24:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:51,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395839815] [2022-11-02 20:24:51,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395839815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:51,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:51,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583626077] [2022-11-02 20:24:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:51,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:51,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:51,171 INFO L87 Difference]: Start difference. First operand 224 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:52,234 INFO L93 Difference]: Finished difference Result 440 states and 693 transitions. [2022-11-02 20:24:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-02 20:24:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:52,236 INFO L225 Difference]: With dead ends: 440 [2022-11-02 20:24:52,236 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 20:24:52,236 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 20:24:52,237 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 22 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:52,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 497 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:24:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 20:24:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 224. [2022-11-02 20:24:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.5739910313901346) internal successors, (351), 223 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 20:24:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 351 transitions. [2022-11-02 20:24:52,245 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 351 transitions. Word has length 60 [2022-11-02 20:24:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:52,245 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 351 transitions. [2022-11-02 20:24:52,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 351 transitions. [2022-11-02 20:24:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:24:52,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:52,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:52,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:24:52,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 723512942, now seen corresponding path program 1 times [2022-11-02 20:24:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842975443] [2022-11-02 20:24:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:52,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:52,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842975443] [2022-11-02 20:24:52,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842975443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:52,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:52,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:52,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871593422] [2022-11-02 20:24:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:52,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:52,551 INFO L87 Difference]: Start difference. First operand 224 states and 351 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:24:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:54,634 INFO L93 Difference]: Finished difference Result 440 states and 692 transitions. [2022-11-02 20:24:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-11-02 20:24:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:54,637 INFO L225 Difference]: With dead ends: 440 [2022-11-02 20:24:54,637 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 20:24:54,637 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 20:24:54,638 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 20 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 497 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:54,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 497 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:24:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 20:24:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 224. [2022-11-02 20:24:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.5695067264573992) internal successors, (350), 223 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2022-11-02 20:24:54,648 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 61 [2022-11-02 20:24:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:54,648 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2022-11-02 20:24:54,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2022-11-02 20:24:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:24:54,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:54,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:54,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:24:54,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 984557074, now seen corresponding path program 1 times [2022-11-02 20:24:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:54,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142650705] [2022-11-02 20:24:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:55,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142650705] [2022-11-02 20:24:55,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142650705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:55,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:55,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118792649] [2022-11-02 20:24:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:55,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:55,014 INFO L87 Difference]: Start difference. First operand 224 states and 350 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 20:24:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:56,016 INFO L93 Difference]: Finished difference Result 430 states and 678 transitions. [2022-11-02 20:24:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:56,017 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 20:24:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:56,018 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:24:56,018 INFO L226 Difference]: Without dead ends: 227 [2022-11-02 20:24:56,019 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 20:24:56,019 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 11 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:56,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 511 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:24:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-02 20:24:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2022-11-02 20:24:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.5650224215246638) internal successors, (349), 223 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 349 transitions. [2022-11-02 20:24:56,028 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 349 transitions. Word has length 62 [2022-11-02 20:24:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:56,029 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 349 transitions. [2022-11-02 20:24:56,029 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 20:24:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 349 transitions. [2022-11-02 20:24:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:24:56,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:56,033 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] [2022-11-02 20:24:56,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:24:56,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash 372683642, now seen corresponding path program 1 times [2022-11-02 20:24:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:56,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084144469] [2022-11-02 20:24:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,301 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 20:24:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084144469] [2022-11-02 20:24:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084144469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:56,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:56,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252931256] [2022-11-02 20:24:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:56,304 INFO L87 Difference]: Start difference. First operand 224 states and 349 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 20:24:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:57,443 INFO L93 Difference]: Finished difference Result 467 states and 733 transitions. [2022-11-02 20:24:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:57,443 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 20:24:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:57,445 INFO L225 Difference]: With dead ends: 467 [2022-11-02 20:24:57,445 INFO L226 Difference]: Without dead ends: 264 [2022-11-02 20:24:57,446 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 20:24:57,446 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 31 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:57,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 515 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:24:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-02 20:24:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2022-11-02 20:24:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2022-11-02 20:24:57,457 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 62 [2022-11-02 20:24:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:57,457 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2022-11-02 20:24:57,457 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 20:24:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2022-11-02 20:24:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:24:57,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:57,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:57,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:24:57,460 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash 91774590, now seen corresponding path program 1 times [2022-11-02 20:24:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:57,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142338099] [2022-11-02 20:24:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142338099] [2022-11-02 20:24:57,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142338099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:57,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:57,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542897504] [2022-11-02 20:24:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:57,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:57,817 INFO L87 Difference]: Start difference. First operand 246 states and 384 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:58,942 INFO L93 Difference]: Finished difference Result 575 states and 905 transitions. [2022-11-02 20:24:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:24:58,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-11-02 20:24:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:58,944 INFO L225 Difference]: With dead ends: 575 [2022-11-02 20:24:58,944 INFO L226 Difference]: Without dead ends: 350 [2022-11-02 20:24:58,945 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 20:24:58,946 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:58,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 352 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:24:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-02 20:24:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2022-11-02 20:24:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5510204081632653) internal successors, (380), 245 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 380 transitions. [2022-11-02 20:24:58,959 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 380 transitions. Word has length 76 [2022-11-02 20:24:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:58,960 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 380 transitions. [2022-11-02 20:24:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 380 transitions. [2022-11-02 20:24:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:24:58,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:58,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:24:58,962 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:24:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash -760342187, now seen corresponding path program 1 times [2022-11-02 20:24:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917197261] [2022-11-02 20:24:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:59,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917197261] [2022-11-02 20:24:59,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917197261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:59,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:24:59,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:24:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881640544] [2022-11-02 20:24:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:59,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:24:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:24:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:24:59,271 INFO L87 Difference]: Start difference. First operand 246 states and 380 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:00,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:01,046 INFO L93 Difference]: Finished difference Result 488 states and 758 transitions. [2022-11-02 20:25:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-11-02 20:25:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:01,048 INFO L225 Difference]: With dead ends: 488 [2022-11-02 20:25:01,049 INFO L226 Difference]: Without dead ends: 263 [2022-11-02 20:25:01,049 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 20:25:01,050 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 33 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:01,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 517 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:25:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-02 20:25:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 246. [2022-11-02 20:25:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 379 transitions. [2022-11-02 20:25:01,063 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 379 transitions. Word has length 76 [2022-11-02 20:25:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:01,064 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 379 transitions. [2022-11-02 20:25:01,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 379 transitions. [2022-11-02 20:25:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:25:01,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:01,066 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:01,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:25:01,066 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 345979256, now seen corresponding path program 1 times [2022-11-02 20:25:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450406085] [2022-11-02 20:25:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:01,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450406085] [2022-11-02 20:25:01,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450406085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:01,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:01,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824552298] [2022-11-02 20:25:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:01,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:01,478 INFO L87 Difference]: Start difference. First operand 246 states and 379 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 20:25:02,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:03,264 INFO L93 Difference]: Finished difference Result 575 states and 895 transitions. [2022-11-02 20:25:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:03,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 77 [2022-11-02 20:25:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:03,266 INFO L225 Difference]: With dead ends: 575 [2022-11-02 20:25:03,266 INFO L226 Difference]: Without dead ends: 350 [2022-11-02 20:25:03,267 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 20:25:03,268 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 154 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:03,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 352 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:25:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-02 20:25:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2022-11-02 20:25:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.530612244897959) internal successors, (375), 245 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 375 transitions. [2022-11-02 20:25:03,280 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 375 transitions. Word has length 77 [2022-11-02 20:25:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:03,280 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 375 transitions. [2022-11-02 20:25:03,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 20:25:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 375 transitions. [2022-11-02 20:25:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:25:03,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:03,282 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2022-11-02 20:25:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:25:03,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 901152003, now seen corresponding path program 1 times [2022-11-02 20:25:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:03,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624691787] [2022-11-02 20:25:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:03,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624691787] [2022-11-02 20:25:03,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624691787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:03,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:03,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969157316] [2022-11-02 20:25:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:03,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:03,678 INFO L87 Difference]: Start difference. First operand 246 states and 375 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:05,694 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 20:25:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:06,283 INFO L93 Difference]: Finished difference Result 575 states and 887 transitions. [2022-11-02 20:25:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-11-02 20:25:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:06,286 INFO L225 Difference]: With dead ends: 575 [2022-11-02 20:25:06,286 INFO L226 Difference]: Without dead ends: 350 [2022-11-02 20:25:06,286 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 20:25:06,287 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 152 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 352 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.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:06,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 352 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:25:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-02 20:25:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2022-11-02 20:25:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5142857142857142) internal successors, (371), 245 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 371 transitions. [2022-11-02 20:25:06,330 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 371 transitions. Word has length 78 [2022-11-02 20:25:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:06,330 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 371 transitions. [2022-11-02 20:25:06,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 371 transitions. [2022-11-02 20:25:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:25:06,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:06,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:06,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:25:06,333 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2098566627, now seen corresponding path program 1 times [2022-11-02 20:25:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:06,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113793078] [2022-11-02 20:25:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113793078] [2022-11-02 20:25:06,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113793078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:06,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:06,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749248412] [2022-11-02 20:25:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:06,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:06,696 INFO L87 Difference]: Start difference. First operand 246 states and 371 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:08,712 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 20:25:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:09,311 INFO L93 Difference]: Finished difference Result 565 states and 866 transitions. [2022-11-02 20:25:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-11-02 20:25:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:09,315 INFO L225 Difference]: With dead ends: 565 [2022-11-02 20:25:09,315 INFO L226 Difference]: Without dead ends: 340 [2022-11-02 20:25:09,316 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 20:25:09,317 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:09,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 372 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:25:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-02 20:25:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 246. [2022-11-02 20:25:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.4979591836734694) internal successors, (367), 245 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 367 transitions. [2022-11-02 20:25:09,328 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 367 transitions. Word has length 79 [2022-11-02 20:25:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:09,329 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 367 transitions. [2022-11-02 20:25:09,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 367 transitions. [2022-11-02 20:25:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:25:09,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:09,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:25:09,331 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -549995900, now seen corresponding path program 1 times [2022-11-02 20:25:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986117945] [2022-11-02 20:25:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:25:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986117945] [2022-11-02 20:25:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986117945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:09,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893435946] [2022-11-02 20:25:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:09,824 INFO L87 Difference]: Start difference. First operand 246 states and 367 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:11,678 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 20:25:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:12,219 INFO L93 Difference]: Finished difference Result 565 states and 858 transitions. [2022-11-02 20:25:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-11-02 20:25:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:12,222 INFO L225 Difference]: With dead ends: 565 [2022-11-02 20:25:12,222 INFO L226 Difference]: Without dead ends: 340 [2022-11-02 20:25:12,223 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 20:25:12,223 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 117 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:12,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 390 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:25:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-02 20:25:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 269. [2022-11-02 20:25:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.537313432835821) internal successors, (412), 268 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2022-11-02 20:25:12,234 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 84 [2022-11-02 20:25:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:12,235 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2022-11-02 20:25:12,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2022-11-02 20:25:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:25:12,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:12,237 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] [2022-11-02 20:25:12,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:25:12,237 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -234714967, now seen corresponding path program 1 times [2022-11-02 20:25:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:12,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837655037] [2022-11-02 20:25:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:12,736 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 20:25:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:12,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837655037] [2022-11-02 20:25:12,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837655037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:12,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:12,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076224506] [2022-11-02 20:25:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:12,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:12,738 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 20:25:13,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:14,273 INFO L93 Difference]: Finished difference Result 604 states and 932 transitions. [2022-11-02 20:25:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 112 [2022-11-02 20:25:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:14,276 INFO L225 Difference]: With dead ends: 604 [2022-11-02 20:25:14,276 INFO L226 Difference]: Without dead ends: 356 [2022-11-02 20:25:14,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 20:25:14,277 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 84 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 493 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:25:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-02 20:25:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 303. [2022-11-02 20:25:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.5397350993377483) internal successors, (465), 302 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 465 transitions. [2022-11-02 20:25:14,289 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 465 transitions. Word has length 112 [2022-11-02 20:25:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:14,290 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 465 transitions. [2022-11-02 20:25:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 20:25:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 465 transitions. [2022-11-02 20:25:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:25:14,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:14,292 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] [2022-11-02 20:25:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:25:14,293 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash -727341141, now seen corresponding path program 1 times [2022-11-02 20:25:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997283513] [2022-11-02 20:25:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:14,838 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 20:25:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997283513] [2022-11-02 20:25:14,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997283513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:14,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:14,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576118715] [2022-11-02 20:25:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:14,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:14,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:14,843 INFO L87 Difference]: Start difference. First operand 303 states and 465 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 20:25:16,853 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 20:25:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:17,466 INFO L93 Difference]: Finished difference Result 732 states and 1136 transitions. [2022-11-02 20:25:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 112 [2022-11-02 20:25:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:17,470 INFO L225 Difference]: With dead ends: 732 [2022-11-02 20:25:17,470 INFO L226 Difference]: Without dead ends: 450 [2022-11-02 20:25:17,471 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 20:25:17,472 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 123 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:17,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 382 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:25:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-02 20:25:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 333. [2022-11-02 20:25:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.5481927710843373) internal successors, (514), 332 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 514 transitions. [2022-11-02 20:25:17,490 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 514 transitions. Word has length 112 [2022-11-02 20:25:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:17,490 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 514 transitions. [2022-11-02 20:25:17,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 20:25:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 514 transitions. [2022-11-02 20:25:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:25:17,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:17,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:17,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:25:17,493 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1925843136, now seen corresponding path program 1 times [2022-11-02 20:25:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:17,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090181284] [2022-11-02 20:25:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:25:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090181284] [2022-11-02 20:25:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090181284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:18,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:18,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237693420] [2022-11-02 20:25:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:18,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:18,014 INFO L87 Difference]: Start difference. First operand 333 states and 514 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:19,545 INFO L93 Difference]: Finished difference Result 756 states and 1171 transitions. [2022-11-02 20:25:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 118 [2022-11-02 20:25:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:19,549 INFO L225 Difference]: With dead ends: 756 [2022-11-02 20:25:19,549 INFO L226 Difference]: Without dead ends: 444 [2022-11-02 20:25:19,550 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 20:25:19,551 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 119 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 370 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:25:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-02 20:25:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 370. [2022-11-02 20:25:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.5528455284552845) internal successors, (573), 369 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 573 transitions. [2022-11-02 20:25:19,567 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 573 transitions. Word has length 118 [2022-11-02 20:25:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:19,568 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 573 transitions. [2022-11-02 20:25:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 573 transitions. [2022-11-02 20:25:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:25:19,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:19,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:25:19,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1453716479, now seen corresponding path program 1 times [2022-11-02 20:25:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:19,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739647199] [2022-11-02 20:25:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:25:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:20,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739647199] [2022-11-02 20:25:20,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739647199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:20,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833457601] [2022-11-02 20:25:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:20,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:20,007 INFO L87 Difference]: Start difference. First operand 370 states and 573 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:22,020 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 20:25:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:22,508 INFO L93 Difference]: Finished difference Result 803 states and 1248 transitions. [2022-11-02 20:25:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-02 20:25:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:22,511 INFO L225 Difference]: With dead ends: 803 [2022-11-02 20:25:22,511 INFO L226 Difference]: Without dead ends: 454 [2022-11-02 20:25:22,512 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 20:25:22,513 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 73 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:22,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 495 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:25:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-02 20:25:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2022-11-02 20:25:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.5550122249388754) internal successors, (636), 409 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 636 transitions. [2022-11-02 20:25:22,530 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 636 transitions. Word has length 119 [2022-11-02 20:25:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:22,530 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 636 transitions. [2022-11-02 20:25:22,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 636 transitions. [2022-11-02 20:25:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:25:22,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:22,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:25:22,533 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash 763913919, now seen corresponding path program 1 times [2022-11-02 20:25:22,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363461975] [2022-11-02 20:25:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:25:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363461975] [2022-11-02 20:25:23,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363461975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:23,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:23,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754617685] [2022-11-02 20:25:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:23,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:23,005 INFO L87 Difference]: Start difference. First operand 410 states and 636 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:23,909 INFO L93 Difference]: Finished difference Result 836 states and 1301 transitions. [2022-11-02 20:25:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-02 20:25:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:23,916 INFO L225 Difference]: With dead ends: 836 [2022-11-02 20:25:23,916 INFO L226 Difference]: Without dead ends: 447 [2022-11-02 20:25:23,917 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 20:25:23,918 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 28 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:23,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 595 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:25:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-02 20:25:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 434. [2022-11-02 20:25:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.5496535796766744) internal successors, (671), 433 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 671 transitions. [2022-11-02 20:25:23,936 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 671 transitions. Word has length 119 [2022-11-02 20:25:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:23,936 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 671 transitions. [2022-11-02 20:25:23,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 671 transitions. [2022-11-02 20:25:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-02 20:25:23,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:23,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:25:23,940 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1150598766, now seen corresponding path program 1 times [2022-11-02 20:25:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121142648] [2022-11-02 20:25:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:25:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:24,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121142648] [2022-11-02 20:25:24,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121142648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:24,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:24,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975501673] [2022-11-02 20:25:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:24,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:24,438 INFO L87 Difference]: Start difference. First operand 434 states and 671 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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 20:25:26,451 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 20:25:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:26,954 INFO L93 Difference]: Finished difference Result 885 states and 1371 transitions. [2022-11-02 20:25:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:26,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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 126 [2022-11-02 20:25:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:26,957 INFO L225 Difference]: With dead ends: 885 [2022-11-02 20:25:26,957 INFO L226 Difference]: Without dead ends: 472 [2022-11-02 20:25:26,958 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 20:25:26,959 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:26,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:25:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-02 20:25:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 437. [2022-11-02 20:25:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5458715596330275) internal successors, (674), 436 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 674 transitions. [2022-11-02 20:25:26,976 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 674 transitions. Word has length 126 [2022-11-02 20:25:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:26,977 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 674 transitions. [2022-11-02 20:25:26,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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 20:25:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 674 transitions. [2022-11-02 20:25:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:25:26,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:26,980 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-11-02 20:25:26,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:25:26,980 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 29247942, now seen corresponding path program 1 times [2022-11-02 20:25:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:26,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834489189] [2022-11-02 20:25:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:25:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:27,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834489189] [2022-11-02 20:25:27,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834489189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:27,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:27,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901170404] [2022-11-02 20:25:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:27,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:27,482 INFO L87 Difference]: Start difference. First operand 437 states and 674 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:29,390 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 20:25:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:29,811 INFO L93 Difference]: Finished difference Result 887 states and 1372 transitions. [2022-11-02 20:25:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-11-02 20:25:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:29,814 INFO L225 Difference]: With dead ends: 887 [2022-11-02 20:25:29,814 INFO L226 Difference]: Without dead ends: 471 [2022-11-02 20:25:29,814 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 20:25:29,815 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 83 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:29,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:25:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-02 20:25:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 437. [2022-11-02 20:25:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5435779816513762) internal successors, (673), 436 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 673 transitions. [2022-11-02 20:25:29,829 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 673 transitions. Word has length 133 [2022-11-02 20:25:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:29,829 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 673 transitions. [2022-11-02 20:25:29,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 673 transitions. [2022-11-02 20:25:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:25:29,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:29,832 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-11-02 20:25:29,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:25:29,832 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1906311172, now seen corresponding path program 1 times [2022-11-02 20:25:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:29,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125862111] [2022-11-02 20:25:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:25:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:30,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125862111] [2022-11-02 20:25:30,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125862111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:30,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:30,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965488705] [2022-11-02 20:25:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:30,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:30,192 INFO L87 Difference]: Start difference. First operand 437 states and 673 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:31,253 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2022-11-02 20:25:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-11-02 20:25:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:31,256 INFO L225 Difference]: With dead ends: 865 [2022-11-02 20:25:31,256 INFO L226 Difference]: Without dead ends: 449 [2022-11-02 20:25:31,257 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 20:25:31,258 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 33 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:31,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 595 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:25:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-11-02 20:25:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 437. [2022-11-02 20:25:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2022-11-02 20:25:31,272 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 133 [2022-11-02 20:25:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:31,272 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2022-11-02 20:25:31,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2022-11-02 20:25:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 20:25:31,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:31,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:31,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:25:31,275 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 130218183, now seen corresponding path program 1 times [2022-11-02 20:25:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447354486] [2022-11-02 20:25:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:25:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:31,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447354486] [2022-11-02 20:25:31,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447354486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:31,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:31,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81596155] [2022-11-02 20:25:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:31,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:31,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:31,699 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:32,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:33,436 INFO L93 Difference]: Finished difference Result 964 states and 1486 transitions. [2022-11-02 20:25:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 139 [2022-11-02 20:25:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:33,439 INFO L225 Difference]: With dead ends: 964 [2022-11-02 20:25:33,439 INFO L226 Difference]: Without dead ends: 548 [2022-11-02 20:25:33,440 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 20:25:33,441 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 126 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:33,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 390 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:25:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-02 20:25:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 467. [2022-11-02 20:25:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.5321888412017168) internal successors, (714), 466 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 714 transitions. [2022-11-02 20:25:33,456 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 714 transitions. Word has length 139 [2022-11-02 20:25:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:33,457 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 714 transitions. [2022-11-02 20:25:33,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 714 transitions. [2022-11-02 20:25:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:25:33,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:33,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:33,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:25:33,460 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1668573377, now seen corresponding path program 1 times [2022-11-02 20:25:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:33,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045786167] [2022-11-02 20:25:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:25:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:33,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045786167] [2022-11-02 20:25:33,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045786167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:33,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:33,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252928877] [2022-11-02 20:25:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:33,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:33,863 INFO L87 Difference]: Start difference. First operand 467 states and 714 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:35,873 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 20:25:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:36,369 INFO L93 Difference]: Finished difference Result 984 states and 1506 transitions. [2022-11-02 20:25:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 140 [2022-11-02 20:25:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:36,372 INFO L225 Difference]: With dead ends: 984 [2022-11-02 20:25:36,372 INFO L226 Difference]: Without dead ends: 538 [2022-11-02 20:25:36,373 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 20:25:36,373 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:36,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 370 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:25:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-02 20:25:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 467. [2022-11-02 20:25:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.51931330472103) internal successors, (708), 466 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 708 transitions. [2022-11-02 20:25:36,389 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 708 transitions. Word has length 140 [2022-11-02 20:25:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:36,390 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 708 transitions. [2022-11-02 20:25:36,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 708 transitions. [2022-11-02 20:25:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:25:36,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:36,392 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-11-02 20:25:36,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:25:36,393 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 902292681, now seen corresponding path program 1 times [2022-11-02 20:25:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:36,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676384295] [2022-11-02 20:25:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:25:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676384295] [2022-11-02 20:25:36,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676384295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:36,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955221083] [2022-11-02 20:25:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:36,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:36,753 INFO L87 Difference]: Start difference. First operand 467 states and 708 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:38,468 INFO L93 Difference]: Finished difference Result 945 states and 1438 transitions. [2022-11-02 20:25:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 141 [2022-11-02 20:25:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:38,472 INFO L225 Difference]: With dead ends: 945 [2022-11-02 20:25:38,472 INFO L226 Difference]: Without dead ends: 499 [2022-11-02 20:25:38,473 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 20:25:38,473 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 73 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:38,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 521 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:25:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-02 20:25:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 467. [2022-11-02 20:25:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.5171673819742488) internal successors, (707), 466 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 707 transitions. [2022-11-02 20:25:38,494 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 707 transitions. Word has length 141 [2022-11-02 20:25:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:38,494 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 707 transitions. [2022-11-02 20:25:38,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 707 transitions. [2022-11-02 20:25:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:25:38,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:38,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-11-02 20:25:38,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:25:38,497 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1004110585, now seen corresponding path program 1 times [2022-11-02 20:25:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:38,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559482125] [2022-11-02 20:25:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:25:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559482125] [2022-11-02 20:25:38,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559482125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:38,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:38,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290223977] [2022-11-02 20:25:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:38,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:38,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:38,666 INFO L87 Difference]: Start difference. First operand 467 states and 707 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:38,740 INFO L93 Difference]: Finished difference Result 1356 states and 2069 transitions. [2022-11-02 20:25:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 141 [2022-11-02 20:25:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:38,744 INFO L225 Difference]: With dead ends: 1356 [2022-11-02 20:25:38,744 INFO L226 Difference]: Without dead ends: 910 [2022-11-02 20:25:38,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:38,752 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 145 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 431 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-11-02 20:25:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2022-11-02 20:25:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 1.5115511551155116) internal successors, (1374), 909 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1374 transitions. [2022-11-02 20:25:38,782 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1374 transitions. Word has length 141 [2022-11-02 20:25:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:38,782 INFO L495 AbstractCegarLoop]: Abstraction has 910 states and 1374 transitions. [2022-11-02 20:25:38,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1374 transitions. [2022-11-02 20:25:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:25:38,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:38,785 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-11-02 20:25:38,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:25:38,785 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 893386181, now seen corresponding path program 1 times [2022-11-02 20:25:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932158467] [2022-11-02 20:25:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-02 20:25:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932158467] [2022-11-02 20:25:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932158467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:38,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:38,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024776334] [2022-11-02 20:25:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:38,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:38,926 INFO L87 Difference]: Start difference. First operand 910 states and 1374 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:38,997 INFO L93 Difference]: Finished difference Result 1826 states and 2760 transitions. [2022-11-02 20:25:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-11-02 20:25:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:39,001 INFO L225 Difference]: With dead ends: 1826 [2022-11-02 20:25:39,002 INFO L226 Difference]: Without dead ends: 937 [2022-11-02 20:25:39,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:39,004 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:39,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 416 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:25:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-11-02 20:25:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2022-11-02 20:25:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.5053418803418803) internal successors, (1409), 936 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1409 transitions. [2022-11-02 20:25:39,033 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1409 transitions. Word has length 141 [2022-11-02 20:25:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:39,033 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1409 transitions. [2022-11-02 20:25:39,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1409 transitions. [2022-11-02 20:25:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:25:39,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:39,036 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-11-02 20:25:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:25:39,036 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash -199249021, now seen corresponding path program 1 times [2022-11-02 20:25:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:39,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479103875] [2022-11-02 20:25:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-02 20:25:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479103875] [2022-11-02 20:25:39,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479103875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:39,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:39,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071023673] [2022-11-02 20:25:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:39,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:39,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:39,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:39,173 INFO L87 Difference]: Start difference. First operand 937 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:39,220 INFO L93 Difference]: Finished difference Result 1855 states and 2796 transitions. [2022-11-02 20:25:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 141 [2022-11-02 20:25:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:39,224 INFO L225 Difference]: With dead ends: 1855 [2022-11-02 20:25:39,224 INFO L226 Difference]: Without dead ends: 939 [2022-11-02 20:25:39,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:39,226 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:39,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 395 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:25:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-11-02 20:25:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2022-11-02 20:25:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.504264392324094) internal successors, (1411), 938 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1411 transitions. [2022-11-02 20:25:39,260 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1411 transitions. Word has length 141 [2022-11-02 20:25:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:39,260 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1411 transitions. [2022-11-02 20:25:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1411 transitions. [2022-11-02 20:25:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 20:25:39,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:39,263 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-11-02 20:25:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:25:39,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1694375453, now seen corresponding path program 1 times [2022-11-02 20:25:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817279974] [2022-11-02 20:25:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:25:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:39,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817279974] [2022-11-02 20:25:39,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817279974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:39,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:39,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290534777] [2022-11-02 20:25:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:39,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:39,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:39,438 INFO L87 Difference]: Start difference. First operand 939 states and 1411 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:39,537 INFO L93 Difference]: Finished difference Result 2298 states and 3475 transitions. [2022-11-02 20:25:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 143 [2022-11-02 20:25:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:39,543 INFO L225 Difference]: With dead ends: 2298 [2022-11-02 20:25:39,543 INFO L226 Difference]: Without dead ends: 1382 [2022-11-02 20:25:39,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:39,545 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:39,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 576 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-02 20:25:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-02 20:25:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1381 states have (on average 1.5047067342505431) internal successors, (2078), 1381 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2078 transitions. [2022-11-02 20:25:39,587 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2078 transitions. Word has length 143 [2022-11-02 20:25:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:39,588 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 2078 transitions. [2022-11-02 20:25:39,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2078 transitions. [2022-11-02 20:25:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-02 20:25:39,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:39,591 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:39,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:25:39,592 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1592335477, now seen corresponding path program 1 times [2022-11-02 20:25:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:39,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763571705] [2022-11-02 20:25:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-02 20:25:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:39,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763571705] [2022-11-02 20:25:39,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763571705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:39,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:39,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425719887] [2022-11-02 20:25:39,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:39,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:39,930 INFO L87 Difference]: Start difference. First operand 1382 states and 2078 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:41,220 INFO L93 Difference]: Finished difference Result 2894 states and 4357 transitions. [2022-11-02 20:25:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:41,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-11-02 20:25:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:41,231 INFO L225 Difference]: With dead ends: 2894 [2022-11-02 20:25:41,231 INFO L226 Difference]: Without dead ends: 1535 [2022-11-02 20:25:41,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 20:25:41,234 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 42 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 611 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:25:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2022-11-02 20:25:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1466. [2022-11-02 20:25:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1465 states have (on average 1.5064846416382252) internal successors, (2207), 1465 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2207 transitions. [2022-11-02 20:25:41,278 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2207 transitions. Word has length 172 [2022-11-02 20:25:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:41,279 INFO L495 AbstractCegarLoop]: Abstraction has 1466 states and 2207 transitions. [2022-11-02 20:25:41,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2207 transitions. [2022-11-02 20:25:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-02 20:25:41,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:41,283 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:41,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:25:41,283 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1996367824, now seen corresponding path program 1 times [2022-11-02 20:25:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:41,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122083333] [2022-11-02 20:25:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-02 20:25:41,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:41,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122083333] [2022-11-02 20:25:41,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122083333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:41,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:41,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:41,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040165868] [2022-11-02 20:25:41,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:41,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:41,704 INFO L87 Difference]: Start difference. First operand 1466 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:43,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:25:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:43,534 INFO L93 Difference]: Finished difference Result 3114 states and 4666 transitions. [2022-11-02 20:25:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2022-11-02 20:25:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:43,540 INFO L225 Difference]: With dead ends: 3114 [2022-11-02 20:25:43,541 INFO L226 Difference]: Without dead ends: 1671 [2022-11-02 20:25:43,542 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 20:25:43,543 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 137 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:43,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 372 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:25:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-11-02 20:25:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1466. [2022-11-02 20:25:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1465 states have (on average 1.4921501706484641) internal successors, (2186), 1465 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2186 transitions. [2022-11-02 20:25:43,594 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2186 transitions. Word has length 186 [2022-11-02 20:25:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:43,594 INFO L495 AbstractCegarLoop]: Abstraction has 1466 states and 2186 transitions. [2022-11-02 20:25:43,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2186 transitions. [2022-11-02 20:25:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-02 20:25:43,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:43,598 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:43,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:25:43,598 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 519444691, now seen corresponding path program 1 times [2022-11-02 20:25:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206696] [2022-11-02 20:25:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 252 proven. 38 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:25:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:44,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206696] [2022-11-02 20:25:44,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:25:44,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997536206] [2022-11-02 20:25:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:44,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:25:44,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:25:44,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:25:44,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:25:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:45,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:25:45,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 20:25:45,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:25:45,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997536206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:45,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:25:45,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-02 20:25:45,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851555757] [2022-11-02 20:25:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:45,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:45,462 INFO L87 Difference]: Start difference. First operand 1466 states and 2186 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:45,610 INFO L93 Difference]: Finished difference Result 3381 states and 5062 transitions. [2022-11-02 20:25:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 194 [2022-11-02 20:25:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:45,617 INFO L225 Difference]: With dead ends: 3381 [2022-11-02 20:25:45,618 INFO L226 Difference]: Without dead ends: 1938 [2022-11-02 20:25:45,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 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 20:25:45,620 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:45,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 378 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-11-02 20:25:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2022-11-02 20:25:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1937 states have (on average 1.4945792462570986) internal successors, (2895), 1937 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2895 transitions. [2022-11-02 20:25:45,712 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2895 transitions. Word has length 194 [2022-11-02 20:25:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:45,713 INFO L495 AbstractCegarLoop]: Abstraction has 1938 states and 2895 transitions. [2022-11-02 20:25:45,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2895 transitions. [2022-11-02 20:25:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-11-02 20:25:45,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:45,719 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:45,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:45,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-02 20:25:45,944 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1867638988, now seen corresponding path program 1 times [2022-11-02 20:25:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781708911] [2022-11-02 20:25:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-11-02 20:25:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:46,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781708911] [2022-11-02 20:25:46,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781708911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:46,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:46,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262634740] [2022-11-02 20:25:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:46,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:46,181 INFO L87 Difference]: Start difference. First operand 1938 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:46,305 INFO L93 Difference]: Finished difference Result 4325 states and 6480 transitions. [2022-11-02 20:25:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 196 [2022-11-02 20:25:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:46,313 INFO L225 Difference]: With dead ends: 4325 [2022-11-02 20:25:46,313 INFO L226 Difference]: Without dead ends: 2410 [2022-11-02 20:25:46,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:46,316 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:46,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 377 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-11-02 20:25:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2022-11-02 20:25:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 1.4964715649647156) internal successors, (3605), 2409 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3605 transitions. [2022-11-02 20:25:46,458 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3605 transitions. Word has length 196 [2022-11-02 20:25:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:46,458 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 3605 transitions. [2022-11-02 20:25:46,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3605 transitions. [2022-11-02 20:25:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-02 20:25:46,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:46,464 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:46,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:25:46,464 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1420264172, now seen corresponding path program 1 times [2022-11-02 20:25:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:46,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909052494] [2022-11-02 20:25:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-02 20:25:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:46,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909052494] [2022-11-02 20:25:46,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909052494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:46,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:46,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411677372] [2022-11-02 20:25:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:46,706 INFO L87 Difference]: Start difference. First operand 2410 states and 3605 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 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 20:25:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:46,828 INFO L93 Difference]: Finished difference Result 5269 states and 7900 transitions. [2022-11-02 20:25:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 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 235 [2022-11-02 20:25:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:46,838 INFO L225 Difference]: With dead ends: 5269 [2022-11-02 20:25:46,839 INFO L226 Difference]: Without dead ends: 2882 [2022-11-02 20:25:46,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:46,842 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 161 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:46,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 376 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2022-11-02 20:25:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2022-11-02 20:25:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2881 states have (on average 1.498090940645609) internal successors, (4316), 2881 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4316 transitions. [2022-11-02 20:25:46,938 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 4316 transitions. Word has length 235 [2022-11-02 20:25:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:46,939 INFO L495 AbstractCegarLoop]: Abstraction has 2882 states and 4316 transitions. [2022-11-02 20:25:46,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 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 20:25:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 4316 transitions. [2022-11-02 20:25:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-02 20:25:46,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:46,945 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:46,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:25:46,945 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash -390648618, now seen corresponding path program 1 times [2022-11-02 20:25:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:46,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736516913] [2022-11-02 20:25:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-02 20:25:47,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:47,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736516913] [2022-11-02 20:25:47,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736516913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:47,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:47,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:47,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554823117] [2022-11-02 20:25:47,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:47,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:47,222 INFO L87 Difference]: Start difference. First operand 2882 states and 4316 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:47,356 INFO L93 Difference]: Finished difference Result 6213 states and 9322 transitions. [2022-11-02 20:25:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:47,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 237 [2022-11-02 20:25:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:47,379 INFO L225 Difference]: With dead ends: 6213 [2022-11-02 20:25:47,386 INFO L226 Difference]: Without dead ends: 3354 [2022-11-02 20:25:47,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:47,390 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 162 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:47,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 375 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2022-11-02 20:25:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3354. [2022-11-02 20:25:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3353 states have (on average 1.4995526394273784) internal successors, (5028), 3353 states have internal predecessors, (5028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5028 transitions. [2022-11-02 20:25:47,507 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5028 transitions. Word has length 237 [2022-11-02 20:25:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:47,508 INFO L495 AbstractCegarLoop]: Abstraction has 3354 states and 5028 transitions. [2022-11-02 20:25:47,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5028 transitions. [2022-11-02 20:25:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-02 20:25:47,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:47,516 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:47,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:25:47,516 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash -746542110, now seen corresponding path program 1 times [2022-11-02 20:25:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:47,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835445574] [2022-11-02 20:25:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-11-02 20:25:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:47,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835445574] [2022-11-02 20:25:47,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835445574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:47,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:47,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38429209] [2022-11-02 20:25:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:47,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:47,808 INFO L87 Difference]: Start difference. First operand 3354 states and 5028 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:47,949 INFO L93 Difference]: Finished difference Result 7152 states and 10739 transitions. [2022-11-02 20:25:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 269 [2022-11-02 20:25:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:47,958 INFO L225 Difference]: With dead ends: 7152 [2022-11-02 20:25:47,959 INFO L226 Difference]: Without dead ends: 3821 [2022-11-02 20:25:47,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:47,964 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 146 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:47,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 575 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-11-02 20:25:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3821. [2022-11-02 20:25:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3820 states have (on average 1.4989528795811518) internal successors, (5726), 3820 states have internal predecessors, (5726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5726 transitions. [2022-11-02 20:25:48,093 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5726 transitions. Word has length 269 [2022-11-02 20:25:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:48,094 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5726 transitions. [2022-11-02 20:25:48,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5726 transitions. [2022-11-02 20:25:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-02 20:25:48,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:48,102 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:25:48,102 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2118349408, now seen corresponding path program 1 times [2022-11-02 20:25:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:48,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580990018] [2022-11-02 20:25:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 20:25:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580990018] [2022-11-02 20:25:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580990018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:48,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:48,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383984655] [2022-11-02 20:25:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:48,448 INFO L87 Difference]: Start difference. First operand 3821 states and 5726 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:48,595 INFO L93 Difference]: Finished difference Result 8058 states and 12093 transitions. [2022-11-02 20:25:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:48,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2022-11-02 20:25:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:48,603 INFO L225 Difference]: With dead ends: 8058 [2022-11-02 20:25:48,603 INFO L226 Difference]: Without dead ends: 4260 [2022-11-02 20:25:48,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:48,607 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:48,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 578 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2022-11-02 20:25:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4260. [2022-11-02 20:25:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4260 states, 4259 states have (on average 1.4982390232448932) internal successors, (6381), 4259 states have internal predecessors, (6381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 6381 transitions. [2022-11-02 20:25:48,738 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 6381 transitions. Word has length 269 [2022-11-02 20:25:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:48,739 INFO L495 AbstractCegarLoop]: Abstraction has 4260 states and 6381 transitions. [2022-11-02 20:25:48,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6381 transitions. [2022-11-02 20:25:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-11-02 20:25:48,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:48,747 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:48,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:25:48,747 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -113807666, now seen corresponding path program 1 times [2022-11-02 20:25:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:48,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015184017] [2022-11-02 20:25:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:48,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-11-02 20:25:49,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:49,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015184017] [2022-11-02 20:25:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015184017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:49,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:49,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539979125] [2022-11-02 20:25:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:49,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:49,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:49,075 INFO L87 Difference]: Start difference. First operand 4260 states and 6381 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:49,248 INFO L93 Difference]: Finished difference Result 8969 states and 13452 transitions. [2022-11-02 20:25:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:49,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-11-02 20:25:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:49,258 INFO L225 Difference]: With dead ends: 8969 [2022-11-02 20:25:49,259 INFO L226 Difference]: Without dead ends: 4732 [2022-11-02 20:25:49,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:49,264 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 154 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 372 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2022-11-02 20:25:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 4732. [2022-11-02 20:25:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 4731 states have (on average 1.4998943140984993) internal successors, (7096), 4731 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 7096 transitions. [2022-11-02 20:25:49,403 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 7096 transitions. Word has length 344 [2022-11-02 20:25:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:49,403 INFO L495 AbstractCegarLoop]: Abstraction has 4732 states and 7096 transitions. [2022-11-02 20:25:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 7096 transitions. [2022-11-02 20:25:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2022-11-02 20:25:49,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:49,412 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:49,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:25:49,413 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1102282041, now seen corresponding path program 1 times [2022-11-02 20:25:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120970693] [2022-11-02 20:25:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2022-11-02 20:25:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120970693] [2022-11-02 20:25:49,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120970693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:49,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:49,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417795441] [2022-11-02 20:25:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:49,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:49,783 INFO L87 Difference]: Start difference. First operand 4732 states and 7096 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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 20:25:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:49,932 INFO L93 Difference]: Finished difference Result 5206 states and 7814 transitions. [2022-11-02 20:25:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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 385 [2022-11-02 20:25:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:49,942 INFO L225 Difference]: With dead ends: 5206 [2022-11-02 20:25:49,942 INFO L226 Difference]: Without dead ends: 5204 [2022-11-02 20:25:49,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:49,947 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 155 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:49,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 371 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2022-11-02 20:25:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5204. [2022-11-02 20:25:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 5203 states have (on average 1.5014414760714971) internal successors, (7812), 5203 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7812 transitions. [2022-11-02 20:25:50,135 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7812 transitions. Word has length 385 [2022-11-02 20:25:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:50,136 INFO L495 AbstractCegarLoop]: Abstraction has 5204 states and 7812 transitions. [2022-11-02 20:25:50,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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 20:25:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7812 transitions. [2022-11-02 20:25:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2022-11-02 20:25:50,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:50,145 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:50,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:25:50,146 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -904105078, now seen corresponding path program 1 times [2022-11-02 20:25:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106565007] [2022-11-02 20:25:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2022-11-02 20:25:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106565007] [2022-11-02 20:25:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106565007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:50,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:50,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519060442] [2022-11-02 20:25:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:50,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:51,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:51,000 INFO L87 Difference]: Start difference. First operand 5204 states and 7812 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,016 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 20:25:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:53,528 INFO L93 Difference]: Finished difference Result 11286 states and 16902 transitions. [2022-11-02 20:25:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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 392 [2022-11-02 20:25:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:53,540 INFO L225 Difference]: With dead ends: 11286 [2022-11-02 20:25:53,540 INFO L226 Difference]: Without dead ends: 6105 [2022-11-02 20:25:53,545 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 20:25:53,546 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 69 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:53,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 659 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:25:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2022-11-02 20:25:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5655. [2022-11-02 20:25:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5654 states have (on average 1.5022992571630704) internal successors, (8494), 5654 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 8494 transitions. [2022-11-02 20:25:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 8494 transitions. Word has length 392 [2022-11-02 20:25:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:53,805 INFO L495 AbstractCegarLoop]: Abstraction has 5655 states and 8494 transitions. [2022-11-02 20:25:53,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 8494 transitions. [2022-11-02 20:25:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2022-11-02 20:25:53,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:53,815 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:53,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:25:53,817 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:25:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash 42932808, now seen corresponding path program 1 times [2022-11-02 20:25:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:53,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868723577] [2022-11-02 20:25:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2022-11-02 20:25:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:58,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868723577] [2022-11-02 20:25:58,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868723577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:58,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:58,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:25:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418268886] [2022-11-02 20:25:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:58,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:58,247 INFO L87 Difference]: Start difference. First operand 5655 states and 8494 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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 20:26:00,256 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 20:26:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:01,378 INFO L93 Difference]: Finished difference Result 11307 states and 16984 transitions. [2022-11-02 20:26:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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 392 [2022-11-02 20:26:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:01,390 INFO L225 Difference]: With dead ends: 11307 [2022-11-02 20:26:01,390 INFO L226 Difference]: Without dead ends: 5655 [2022-11-02 20:26:01,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:01,396 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 7 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:01,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 695 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 20:26:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2022-11-02 20:26:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 5655. [2022-11-02 20:26:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5654 states have (on average 1.5021223912274495) internal successors, (8493), 5654 states have internal predecessors, (8493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 8493 transitions. [2022-11-02 20:26:01,616 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 8493 transitions. Word has length 392 [2022-11-02 20:26:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:01,617 INFO L495 AbstractCegarLoop]: Abstraction has 5655 states and 8493 transitions. [2022-11-02 20:26:01,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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 20:26:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 8493 transitions. [2022-11-02 20:26:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2022-11-02 20:26:01,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:01,625 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:01,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:26:01,626 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash -729601146, now seen corresponding path program 1 times [2022-11-02 20:26:01,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:01,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12352783] [2022-11-02 20:26:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:01,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 737 proven. 577 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-11-02 20:26:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12352783] [2022-11-02 20:26:28,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12352783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949492874] [2022-11-02 20:26:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:28,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:28,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:28,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0fdd874-9058-43e0-be5b-0b42370430fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:26:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:30,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 199 conjunts are in the unsatisfiable core [2022-11-02 20:26:30,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:46,742 WARN L234 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 62 DAG size of output: 26 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:26:46,743 INFO L356 Elim1Store]: treesize reduction 749, result has 4.0 percent of original size [2022-11-02 20:26:47,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1025020938822860 treesize of output 253593272854004