./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro --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 64bit --witnessprinter.graph.data.programhash 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- 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-8393723 [2022-11-18 19:31:20,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:31:20,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:31:20,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:31:20,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:31:20,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:31:20,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:31:20,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:31:20,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:31:20,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:31:20,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:31:20,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:31:20,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:31:20,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:31:20,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:31:20,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:31:20,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:31:20,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:31:20,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:31:20,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:31:20,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:31:20,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:31:20,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:31:20,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:31:20,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:31:20,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:31:20,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:31:20,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:31:20,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:31:20,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:31:20,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:31:20,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:31:20,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:31:20,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:31:20,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:31:20,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:31:20,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:31:20,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:31:20,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:31:20,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:31:20,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:31:20,592 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 19:31:20,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:31:20,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:31:20,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:31:20,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:31:20,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:31:20,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:31:20,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:31:20,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:31:20,638 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:31:20,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:31:20,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:31:20,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:31:20,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:31:20,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:31:20,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:31:20,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:31:20,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:31:20,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:31:20,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:31:20,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:31:20,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:31:20,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:31:20,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:31:20,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:31:20,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:31:20,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:31:20,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:31:20,644 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:31:20,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:31:20,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:31:20,645 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_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/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_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-11-18 19:31:20,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:31:20,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:31:20,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:31:20,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:31:20,994 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:31:20,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-11-18 19:31:21,053 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/data/62ab1b0da/8fa82c4c69fc4d1e94a27f4b6c405d70/FLAG89edcbebb [2022-11-18 19:31:21,887 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:31:21,888 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-11-18 19:31:21,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/data/62ab1b0da/8fa82c4c69fc4d1e94a27f4b6c405d70/FLAG89edcbebb [2022-11-18 19:31:22,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/data/62ab1b0da/8fa82c4c69fc4d1e94a27f4b6c405d70 [2022-11-18 19:31:22,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:31:22,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:31:22,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:31:22,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:31:22,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:31:22,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:31:22" (1/1) ... [2022-11-18 19:31:22,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cdb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:22, skipping insertion in model container [2022-11-18 19:31:22,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:31:22" (1/1) ... [2022-11-18 19:31:22,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:31:22,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:31:23,215 WARN L234 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_cbcb1efb-56b2-4902-9b55-391d68d43229/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-11-18 19:31:23,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:31:23,935 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:31:24,137 WARN L234 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_cbcb1efb-56b2-4902-9b55-391d68d43229/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-11-18 19:31:24,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:31:24,540 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:31:24,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24 WrapperNode [2022-11-18 19:31:24,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:31:24,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:31:24,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:31:24,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:31:24,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,777 INFO L138 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3178 [2022-11-18 19:31:24,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:31:24,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:31:24,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:31:24,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:31:24,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,960 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:31:24,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:31:24,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:31:24,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:31:24,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (1/1) ... [2022-11-18 19:31:24,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:31:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:31:25,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:31:25,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:31:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-11-18 19:31:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-11-18 19:31:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-11-18 19:31:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-11-18 19:31:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 19:31:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-18 19:31:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 19:31:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:31:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-18 19:31:25,081 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-18 19:31:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-18 19:31:25,081 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-18 19:31:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-11-18 19:31:25,081 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-11-18 19:31:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 19:31:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 19:31:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-18 19:31:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-18 19:31:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 19:31:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 19:31:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-18 19:31:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-18 19:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-18 19:31:25,083 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-18 19:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 19:31:25,083 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 19:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-11-18 19:31:25,083 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-11-18 19:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 19:31:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 19:31:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 19:31:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 19:31:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-18 19:31:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-18 19:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 19:31:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 19:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 19:31:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 19:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-18 19:31:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-18 19:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-11-18 19:31:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-11-18 19:31:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-11-18 19:31:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-11-18 19:31:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-11-18 19:31:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-11-18 19:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-18 19:31:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-18 19:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-11-18 19:31:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-11-18 19:31:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:31:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:31:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-18 19:31:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-18 19:31:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-18 19:31:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-11-18 19:31:25,091 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-11-18 19:31:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-18 19:31:25,091 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-18 19:31:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-11-18 19:31:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-11-18 19:31:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:31:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-18 19:31:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-18 19:31:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-18 19:31:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-18 19:31:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-18 19:31:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-18 19:31:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-11-18 19:31:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-11-18 19:31:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-11-18 19:31:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-11-18 19:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-11-18 19:31:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-11-18 19:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-11-18 19:31:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-11-18 19:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-18 19:31:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-18 19:31:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-11-18 19:31:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-11-18 19:31:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-18 19:31:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-18 19:31:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-18 19:31:25,096 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-18 19:31:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-11-18 19:31:25,096 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-11-18 19:31:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-18 19:31:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-18 19:31:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 19:31:25,098 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 19:31:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 19:31:25,098 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 19:31:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-18 19:31:25,098 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-18 19:31:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-18 19:31:25,099 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-18 19:31:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:31:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-18 19:31:25,099 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-18 19:31:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-11-18 19:31:25,099 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-11-18 19:31:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-18 19:31:25,100 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-18 19:31:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-18 19:31:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-18 19:31:25,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-18 19:31:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:31:25,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:31:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-11-18 19:31:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-11-18 19:31:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-18 19:31:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-18 19:31:25,776 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:31:25,782 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:31:26,041 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 19:31:28,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:31:28,993 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:31:28,993 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:31:29,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:31:29 BoogieIcfgContainer [2022-11-18 19:31:29,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:31:29,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:31:29,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:31:29,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:31:29,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:31:22" (1/3) ... [2022-11-18 19:31:29,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ae680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:31:29, skipping insertion in model container [2022-11-18 19:31:29,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:24" (2/3) ... [2022-11-18 19:31:29,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ae680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:31:29, skipping insertion in model container [2022-11-18 19:31:29,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:31:29" (3/3) ... [2022-11-18 19:31:29,018 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-11-18 19:31:29,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:31:29,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:31:29,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:31:29,174 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;@370b7285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:31:29,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:31:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 803 states have (on average 1.4296388542963885) internal successors, (1148), 836 states have internal predecessors, (1148), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-11-18 19:31:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 19:31:29,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:31:29,218 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:31:29,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:31:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:31:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1206067803, now seen corresponding path program 1 times [2022-11-18 19:31:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:31:29,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231756531] [2022-11-18 19:31:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:31:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:31:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:31:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:31:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:31:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:31:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:31:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:31:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:31:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-18 19:31:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:31:29,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231756531] [2022-11-18 19:31:29,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231756531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:31:29,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:31:29,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:31:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607169601] [2022-11-18 19:31:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:31:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:31:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:31:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:31:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:31:29,839 INFO L87 Difference]: Start difference. First operand has 1085 states, 803 states have (on average 1.4296388542963885) internal successors, (1148), 836 states have internal predecessors, (1148), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 19:31:32,483 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-18 19:31:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:31:36,033 INFO L93 Difference]: Finished difference Result 2915 states and 4355 transitions. [2022-11-18 19:31:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:31:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-11-18 19:31:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:31:36,062 INFO L225 Difference]: With dead ends: 2915 [2022-11-18 19:31:36,063 INFO L226 Difference]: Without dead ends: 1750 [2022-11-18 19:31:36,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-18 19:31:36,078 INFO L413 NwaCegarLoop]: 1265 mSDtfsCounter, 1461 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 472 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:31:36,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 2804 Invalid, 2233 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [472 Valid, 1760 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-11-18 19:31:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-11-18 19:31:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1591. [2022-11-18 19:31:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1170 states have (on average 1.4034188034188033) internal successors, (1642), 1203 states have internal predecessors, (1642), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-11-18 19:31:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2307 transitions. [2022-11-18 19:31:36,245 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2307 transitions. Word has length 63 [2022-11-18 19:31:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:31:36,246 INFO L495 AbstractCegarLoop]: Abstraction has 1591 states and 2307 transitions. [2022-11-18 19:31:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 19:31:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2307 transitions. [2022-11-18 19:31:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 19:31:36,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:31:36,255 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-18 19:31:36,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:31:36,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:31:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:31:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash -915802875, now seen corresponding path program 1 times [2022-11-18 19:31:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:31:36,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908590525] [2022-11-18 19:31:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:31:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:31:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:31:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:31:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:31:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:31:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:31:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:31:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:31:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:31:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:31:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 19:31:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 19:31:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-18 19:31:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:31:36,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908590525] [2022-11-18 19:31:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908590525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:31:36,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:31:36,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:31:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157893253] [2022-11-18 19:31:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:31:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:31:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:31:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:31:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:31:36,710 INFO L87 Difference]: Start difference. First operand 1591 states and 2307 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 19:31:39,141 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-18 19:31:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:31:41,453 INFO L93 Difference]: Finished difference Result 3348 states and 4913 transitions. [2022-11-18 19:31:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:31:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-11-18 19:31:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:31:41,468 INFO L225 Difference]: With dead ends: 3348 [2022-11-18 19:31:41,468 INFO L226 Difference]: Without dead ends: 1781 [2022-11-18 19:31:41,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:31:41,482 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 1858 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:31:41,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 2065 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-18 19:31:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-18 19:31:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1591. [2022-11-18 19:31:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1170 states have (on average 1.4017094017094016) internal successors, (1640), 1203 states have internal predecessors, (1640), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-11-18 19:31:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2305 transitions. [2022-11-18 19:31:41,667 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2305 transitions. Word has length 104 [2022-11-18 19:31:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:31:41,669 INFO L495 AbstractCegarLoop]: Abstraction has 1591 states and 2305 transitions. [2022-11-18 19:31:41,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 19:31:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2305 transitions. [2022-11-18 19:31:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 19:31:41,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:31:41,678 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-18 19:31:41,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:31:41,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:31:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:31:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1350578311, now seen corresponding path program 1 times [2022-11-18 19:31:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:31:41,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428620732] [2022-11-18 19:31:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:31:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:31:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:31:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:31:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:31:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:31:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:31:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:31:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:31:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:31:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:31:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 19:31:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 19:31:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-18 19:31:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:31:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428620732] [2022-11-18 19:31:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428620732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:31:42,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:31:42,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:31:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385167132] [2022-11-18 19:31:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:31:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:31:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:31:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:31:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:31:42,044 INFO L87 Difference]: Start difference. First operand 1591 states and 2305 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 19:31:45,930 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-18 19:31:47,941 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-18 19:31:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:31:50,819 INFO L93 Difference]: Finished difference Result 3352 states and 4913 transitions. [2022-11-18 19:31:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:31:50,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-11-18 19:31:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:31:50,830 INFO L225 Difference]: With dead ends: 3352 [2022-11-18 19:31:50,831 INFO L226 Difference]: Without dead ends: 1781 [2022-11-18 19:31:50,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:31:50,841 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 585 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 225 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:31:50,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 3880 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2683 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-11-18 19:31:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-18 19:31:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1591. [2022-11-18 19:31:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1170 states have (on average 1.4) internal successors, (1638), 1203 states have internal predecessors, (1638), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-11-18 19:31:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2303 transitions. [2022-11-18 19:31:50,929 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2303 transitions. Word has length 104 [2022-11-18 19:31:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:31:50,931 INFO L495 AbstractCegarLoop]: Abstraction has 1591 states and 2303 transitions. [2022-11-18 19:31:50,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 19:31:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2303 transitions. [2022-11-18 19:31:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-18 19:31:50,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:31:50,939 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-18 19:31:50,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:31:50,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:31:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:31:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 214835216, now seen corresponding path program 1 times [2022-11-18 19:31:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:31:50,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007628489] [2022-11-18 19:31:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:31:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:31:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:31:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:31:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:31:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:31:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:31:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:31:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:31:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:31:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:31:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:31:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:31:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 19:31:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:31:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007628489] [2022-11-18 19:31:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007628489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:31:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:31:51,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:31:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996070957] [2022-11-18 19:31:51,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:31:51,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:31:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:31:51,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:31:51,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:31:51,367 INFO L87 Difference]: Start difference. First operand 1591 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-18 19:31:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:31:57,278 INFO L93 Difference]: Finished difference Result 2372 states and 3623 transitions. [2022-11-18 19:31:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:31:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-11-18 19:31:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:31:57,304 INFO L225 Difference]: With dead ends: 2372 [2022-11-18 19:31:57,304 INFO L226 Difference]: Without dead ends: 2369 [2022-11-18 19:31:57,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:31:57,306 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 1377 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 5558 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:31:57,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 5558 Invalid, 3409 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [425 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-18 19:31:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-11-18 19:31:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1593. [2022-11-18 19:31:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1172 states have (on average 1.3993174061433447) internal successors, (1640), 1205 states have internal predecessors, (1640), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-11-18 19:31:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2305 transitions. [2022-11-18 19:31:57,451 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2305 transitions. Word has length 107 [2022-11-18 19:31:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:31:57,452 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2305 transitions. [2022-11-18 19:31:57,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-18 19:31:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2305 transitions. [2022-11-18 19:31:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-18 19:31:57,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:31:57,460 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:31:57,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:31:57,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:31:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:31:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 507822447, now seen corresponding path program 1 times [2022-11-18 19:31:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:31:57,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074909112] [2022-11-18 19:31:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:31:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:31:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:31:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:31:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:31:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:31:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:31:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:31:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:31:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:31:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:31:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:31:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:31:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 19:31:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:31:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 19:31:57,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:31:57,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074909112] [2022-11-18 19:31:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074909112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:31:57,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:31:57,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:31:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062118839] [2022-11-18 19:31:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:31:57,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:31:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:31:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:31:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:31:57,881 INFO L87 Difference]: Start difference. First operand 1593 states and 2305 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-18 19:32:00,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:32:02,098 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-18 19:32:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:05,560 INFO L93 Difference]: Finished difference Result 3941 states and 5897 transitions. [2022-11-18 19:32:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:32:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-11-18 19:32:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:05,583 INFO L225 Difference]: With dead ends: 3941 [2022-11-18 19:32:05,583 INFO L226 Difference]: Without dead ends: 2372 [2022-11-18 19:32:05,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:32:05,594 INFO L413 NwaCegarLoop]: 1359 mSDtfsCounter, 2939 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3193 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:05,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3193 Valid, 2946 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-18 19:32:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2022-11-18 19:32:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1594. [2022-11-18 19:32:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1173 states have (on average 1.3989769820971867) internal successors, (1641), 1206 states have internal predecessors, (1641), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-11-18 19:32:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2306 transitions. [2022-11-18 19:32:05,755 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2306 transitions. Word has length 117 [2022-11-18 19:32:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:05,756 INFO L495 AbstractCegarLoop]: Abstraction has 1594 states and 2306 transitions. [2022-11-18 19:32:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-18 19:32:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2306 transitions. [2022-11-18 19:32:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 19:32:05,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:05,762 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:32:05,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1319048526, now seen corresponding path program 1 times [2022-11-18 19:32:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752285777] [2022-11-18 19:32:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 19:32:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752285777] [2022-11-18 19:32:06,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752285777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:06,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:06,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:32:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927863081] [2022-11-18 19:32:06,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:06,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:32:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:06,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:32:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:32:06,105 INFO L87 Difference]: Start difference. First operand 1594 states and 2306 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 19:32:09,911 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-18 19:32:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:16,519 INFO L93 Difference]: Finished difference Result 3304 states and 5192 transitions. [2022-11-18 19:32:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:32:16,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-11-18 19:32:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:16,539 INFO L225 Difference]: With dead ends: 3304 [2022-11-18 19:32:16,539 INFO L226 Difference]: Without dead ends: 3301 [2022-11-18 19:32:16,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:32:16,542 INFO L413 NwaCegarLoop]: 2049 mSDtfsCounter, 2349 mSDsluCounter, 6448 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 770 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 8497 SdHoareTripleChecker+Invalid, 5028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:16,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2565 Valid, 8497 Invalid, 5028 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [770 Valid, 4257 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2022-11-18 19:32:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-11-18 19:32:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 1596. [2022-11-18 19:32:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1174 states have (on average 1.3986371379897786) internal successors, (1642), 1206 states have internal predecessors, (1642), 334 states have call successors, (334), 89 states have call predecessors, (334), 87 states have return successors, (333), 329 states have call predecessors, (333), 333 states have call successors, (333) [2022-11-18 19:32:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2309 transitions. [2022-11-18 19:32:16,676 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2309 transitions. Word has length 119 [2022-11-18 19:32:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:16,676 INFO L495 AbstractCegarLoop]: Abstraction has 1596 states and 2309 transitions. [2022-11-18 19:32:16,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 19:32:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2309 transitions. [2022-11-18 19:32:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-18 19:32:16,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:16,685 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:16,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:32:16,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1874379367, now seen corresponding path program 1 times [2022-11-18 19:32:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122600899] [2022-11-18 19:32:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 19:32:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 19:32:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 19:32:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 19:32:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 19:32:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:16,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122600899] [2022-11-18 19:32:16,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122600899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:16,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:16,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:32:16,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943290832] [2022-11-18 19:32:16,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:32:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:32:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:32:16,964 INFO L87 Difference]: Start difference. First operand 1596 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 19:32:21,037 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-18 19:32:23,249 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-18 19:32:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:26,714 INFO L93 Difference]: Finished difference Result 3976 states and 5812 transitions. [2022-11-18 19:32:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:32:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2022-11-18 19:32:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:26,728 INFO L225 Difference]: With dead ends: 3976 [2022-11-18 19:32:26,728 INFO L226 Difference]: Without dead ends: 2404 [2022-11-18 19:32:26,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:32:26,734 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 2361 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 814 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2545 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2545 Valid, 2872 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 1822 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-11-18 19:32:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2022-11-18 19:32:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2128. [2022-11-18 19:32:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1556 states have (on average 1.3907455012853471) internal successors, (2164), 1597 states have internal predecessors, (2164), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:32:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3059 transitions. [2022-11-18 19:32:26,954 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3059 transitions. Word has length 149 [2022-11-18 19:32:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:26,955 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 3059 transitions. [2022-11-18 19:32:26,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 19:32:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3059 transitions. [2022-11-18 19:32:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-18 19:32:26,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:26,966 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:26,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:32:26,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2071795457, now seen corresponding path program 1 times [2022-11-18 19:32:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:26,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057835381] [2022-11-18 19:32:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 19:32:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 19:32:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 19:32:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 19:32:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 19:32:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:27,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057835381] [2022-11-18 19:32:27,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057835381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:27,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:27,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:32:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006489533] [2022-11-18 19:32:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:27,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:32:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:32:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:27,401 INFO L87 Difference]: Start difference. First operand 2128 states and 3059 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 19:32:30,344 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-18 19:32:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:33,690 INFO L93 Difference]: Finished difference Result 4562 states and 6794 transitions. [2022-11-18 19:32:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:32:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2022-11-18 19:32:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:33,708 INFO L225 Difference]: With dead ends: 4562 [2022-11-18 19:32:33,708 INFO L226 Difference]: Without dead ends: 2990 [2022-11-18 19:32:33,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:32:33,715 INFO L413 NwaCegarLoop]: 1524 mSDtfsCounter, 2784 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:33,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 3241 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-18 19:32:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2022-11-18 19:32:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2132. [2022-11-18 19:32:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1560 states have (on average 1.3903846153846153) internal successors, (2169), 1601 states have internal predecessors, (2169), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:32:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 3064 transitions. [2022-11-18 19:32:33,988 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 3064 transitions. Word has length 151 [2022-11-18 19:32:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:33,989 INFO L495 AbstractCegarLoop]: Abstraction has 2132 states and 3064 transitions. [2022-11-18 19:32:33,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 19:32:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 3064 transitions. [2022-11-18 19:32:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-18 19:32:34,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:34,001 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:34,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:32:34,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1930569565, now seen corresponding path program 1 times [2022-11-18 19:32:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:34,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851608313] [2022-11-18 19:32:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 19:32:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 19:32:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 19:32:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 19:32:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-18 19:32:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:34,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851608313] [2022-11-18 19:32:34,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851608313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:34,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:34,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:32:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883977182] [2022-11-18 19:32:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:32:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:32:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:32:34,250 INFO L87 Difference]: Start difference. First operand 2132 states and 3064 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 19:32:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:38,398 INFO L93 Difference]: Finished difference Result 4514 states and 6600 transitions. [2022-11-18 19:32:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:32:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2022-11-18 19:32:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:38,412 INFO L225 Difference]: With dead ends: 4514 [2022-11-18 19:32:38,412 INFO L226 Difference]: Without dead ends: 2406 [2022-11-18 19:32:38,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:38,420 INFO L413 NwaCegarLoop]: 1002 mSDtfsCounter, 1071 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:38,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 2493 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-18 19:32:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2022-11-18 19:32:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2132. [2022-11-18 19:32:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1560 states have (on average 1.3846153846153846) internal successors, (2160), 1601 states have internal predecessors, (2160), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:32:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 3055 transitions. [2022-11-18 19:32:38,662 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 3055 transitions. Word has length 154 [2022-11-18 19:32:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:38,662 INFO L495 AbstractCegarLoop]: Abstraction has 2132 states and 3055 transitions. [2022-11-18 19:32:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 19:32:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 3055 transitions. [2022-11-18 19:32:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-18 19:32:38,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:38,673 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:38,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:32:38,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1999113378, now seen corresponding path program 1 times [2022-11-18 19:32:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:38,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750158152] [2022-11-18 19:32:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 19:32:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 19:32:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 19:32:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 19:32:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 19:32:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:39,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750158152] [2022-11-18 19:32:39,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750158152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049670176] [2022-11-18 19:32:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:39,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:32:39,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:32:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:39,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:32:39,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 19:32:40,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 19:32:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049670176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:32:40,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:32:40,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-11-18 19:32:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26105371] [2022-11-18 19:32:40,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:32:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:32:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:32:40,312 INFO L87 Difference]: Start difference. First operand 2132 states and 3055 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-11-18 19:32:43,636 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-18 19:32:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:50,924 INFO L93 Difference]: Finished difference Result 6316 states and 9717 transitions. [2022-11-18 19:32:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:32:50,926 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 157 [2022-11-18 19:32:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:50,950 INFO L225 Difference]: With dead ends: 6316 [2022-11-18 19:32:50,951 INFO L226 Difference]: Without dead ends: 4740 [2022-11-18 19:32:50,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:32:50,957 INFO L413 NwaCegarLoop]: 2141 mSDtfsCounter, 5842 mSDsluCounter, 6034 mSDsCounter, 0 mSdLazyCounter, 4542 mSolverCounterSat, 2581 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6212 SdHoareTripleChecker+Valid, 8175 SdHoareTripleChecker+Invalid, 7124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2581 IncrementalHoareTripleChecker+Valid, 4542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:50,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6212 Valid, 8175 Invalid, 7124 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2581 Valid, 4542 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2022-11-18 19:32:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2022-11-18 19:32:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 2139. [2022-11-18 19:32:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1567 states have (on average 1.3841735800893427) internal successors, (2169), 1608 states have internal predecessors, (2169), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:32:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3064 transitions. [2022-11-18 19:32:51,263 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3064 transitions. Word has length 157 [2022-11-18 19:32:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:51,264 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 3064 transitions. [2022-11-18 19:32:51,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-11-18 19:32:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3064 transitions. [2022-11-18 19:32:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-18 19:32:51,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:51,277 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:51,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:51,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 19:32:51,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash -518538198, now seen corresponding path program 1 times [2022-11-18 19:32:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:51,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761728836] [2022-11-18 19:32:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 19:32:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 19:32:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 19:32:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-18 19:32:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 19:32:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-18 19:32:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761728836] [2022-11-18 19:32:52,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761728836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846168663] [2022-11-18 19:32:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:52,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:52,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:32:52,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:32:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:53,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 19:32:53,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-18 19:32:53,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:53,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846168663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:53,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:32:53,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-11-18 19:32:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515345479] [2022-11-18 19:32:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:53,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:32:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:32:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:32:53,320 INFO L87 Difference]: Start difference. First operand 2139 states and 3064 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 19:32:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:54,023 INFO L93 Difference]: Finished difference Result 4652 states and 6832 transitions. [2022-11-18 19:32:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:32:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2022-11-18 19:32:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:54,055 INFO L225 Difference]: With dead ends: 4652 [2022-11-18 19:32:54,055 INFO L226 Difference]: Without dead ends: 3069 [2022-11-18 19:32:54,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:32:54,062 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 920 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 5791 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:54,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 5791 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:32:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-11-18 19:32:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2141. [2022-11-18 19:32:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 1569 states have (on average 1.3836838750796685) internal successors, (2171), 1610 states have internal predecessors, (2171), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:32:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3066 transitions. [2022-11-18 19:32:54,383 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3066 transitions. Word has length 166 [2022-11-18 19:32:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:54,384 INFO L495 AbstractCegarLoop]: Abstraction has 2141 states and 3066 transitions. [2022-11-18 19:32:54,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 19:32:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3066 transitions. [2022-11-18 19:32:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-18 19:32:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:54,395 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:32:54,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:54,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:32:54,604 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1480440726, now seen corresponding path program 1 times [2022-11-18 19:32:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145923249] [2022-11-18 19:32:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:32:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:32:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:32:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:32:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:32:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:32:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:32:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:32:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:32:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:32:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:32:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:32:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 19:32:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 19:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 19:32:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 19:32:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 19:32:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 19:32:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 19:32:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-18 19:32:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:54,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145923249] [2022-11-18 19:32:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145923249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:54,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:32:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338218966] [2022-11-18 19:32:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:54,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:32:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:32:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:54,944 INFO L87 Difference]: Start difference. First operand 2141 states and 3066 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 19:32:57,739 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-18 19:33:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:02,342 INFO L93 Difference]: Finished difference Result 4628 states and 6871 transitions. [2022-11-18 19:33:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:33:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2022-11-18 19:33:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:02,357 INFO L225 Difference]: With dead ends: 4628 [2022-11-18 19:33:02,357 INFO L226 Difference]: Without dead ends: 3043 [2022-11-18 19:33:02,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:33:02,364 INFO L413 NwaCegarLoop]: 1270 mSDtfsCounter, 1589 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 652 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:02,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 4391 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3254 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-11-18 19:33:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-11-18 19:33:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2143. [2022-11-18 19:33:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 1571 states have (on average 1.3831954169318905) internal successors, (2173), 1612 states have internal predecessors, (2173), 448 states have call successors, (448), 126 states have call predecessors, (448), 123 states have return successors, (447), 440 states have call predecessors, (447), 447 states have call successors, (447) [2022-11-18 19:33:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3068 transitions. [2022-11-18 19:33:02,673 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3068 transitions. Word has length 175 [2022-11-18 19:33:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:02,674 INFO L495 AbstractCegarLoop]: Abstraction has 2143 states and 3068 transitions. [2022-11-18 19:33:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-18 19:33:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3068 transitions. [2022-11-18 19:33:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-18 19:33:02,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:02,686 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:33:02,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:33:02,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 165325262, now seen corresponding path program 1 times [2022-11-18 19:33:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:02,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702913099] [2022-11-18 19:33:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:33:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:33:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:33:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:33:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:33:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:33:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:33:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 19:33:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 19:33:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-18 19:33:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 19:33:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 19:33:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 19:33:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 19:33:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 19:33:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-18 19:33:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-18 19:33:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-18 19:33:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-18 19:33:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702913099] [2022-11-18 19:33:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702913099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:03,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515433055] [2022-11-18 19:33:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:03,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:03,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:03,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:33:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:04,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 219 conjunts are in the unsatisfiable core [2022-11-18 19:33:04,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:05,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:33:06,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:33:06,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:33:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-11-18 19:33:06,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:33:06,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:33:06,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:33:06,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:33:06,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:33:06,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:33:06,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:33:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2022-11-18 19:33:06,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-11-18 19:33:06,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:06,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-11-18 19:33:07,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2022-11-18 19:33:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-11-18 19:33:07,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 97 [2022-11-18 19:33:07,165 INFO L321 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-11-18 19:33:07,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 78 [2022-11-18 19:33:07,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2022-11-18 19:33:07,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2022-11-18 19:33:07,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2022-11-18 19:33:07,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 41 [2022-11-18 19:33:07,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2022-11-18 19:33:07,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:33:07,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:07,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-18 19:33:07,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-18 19:33:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-18 19:33:08,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:08,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:08,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:08,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:08,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-18 19:33:08,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:33:08,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 201 [2022-11-18 19:33:08,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:08,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 141 [2022-11-18 19:33:08,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 118 [2022-11-18 19:33:08,744 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-18 19:33:08,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 199 [2022-11-18 19:33:08,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 150 [2022-11-18 19:33:08,765 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-18 19:33:08,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 192 [2022-11-18 19:33:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-18 19:33:08,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:09,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515433055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:09,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:33:09,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 33 [2022-11-18 19:33:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102458989] [2022-11-18 19:33:09,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:09,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 19:33:09,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:09,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 19:33:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:33:09,253 INFO L87 Difference]: Start difference. First operand 2143 states and 3068 transitions. Second operand has 33 states, 32 states have (on average 6.40625) internal successors, (205), 24 states have internal predecessors, (205), 9 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (31), 11 states have call predecessors, (31), 9 states have call successors, (31) [2022-11-18 19:33:14,664 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-18 19:33:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:36,032 INFO L93 Difference]: Finished difference Result 5234 states and 7888 transitions. [2022-11-18 19:33:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 19:33:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 6.40625) internal successors, (205), 24 states have internal predecessors, (205), 9 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (31), 11 states have call predecessors, (31), 9 states have call successors, (31) Word has length 183 [2022-11-18 19:33:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:36,045 INFO L225 Difference]: With dead ends: 5234 [2022-11-18 19:33:36,045 INFO L226 Difference]: Without dead ends: 3626 [2022-11-18 19:33:36,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=333, Invalid=3207, Unknown=0, NotChecked=0, Total=3540 [2022-11-18 19:33:36,052 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 4843 mSDsluCounter, 19188 mSDsCounter, 0 mSdLazyCounter, 25660 mSolverCounterSat, 2218 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5096 SdHoareTripleChecker+Valid, 20729 SdHoareTripleChecker+Invalid, 27879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 2218 IncrementalHoareTripleChecker+Valid, 25660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:36,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5096 Valid, 20729 Invalid, 27879 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [2218 Valid, 25660 Invalid, 1 Unknown, 0 Unchecked, 24.7s Time] [2022-11-18 19:33:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2022-11-18 19:33:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2161. [2022-11-18 19:33:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1583 states have (on average 1.3802905874921036) internal successors, (2185), 1627 states have internal predecessors, (2185), 448 states have call successors, (448), 126 states have call predecessors, (448), 129 states have return successors, (465), 443 states have call predecessors, (465), 447 states have call successors, (465) [2022-11-18 19:33:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3098 transitions. [2022-11-18 19:33:36,385 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3098 transitions. Word has length 183 [2022-11-18 19:33:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:36,385 INFO L495 AbstractCegarLoop]: Abstraction has 2161 states and 3098 transitions. [2022-11-18 19:33:36,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 6.40625) internal successors, (205), 24 states have internal predecessors, (205), 9 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (31), 11 states have call predecessors, (31), 9 states have call successors, (31) [2022-11-18 19:33:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3098 transitions. [2022-11-18 19:33:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-18 19:33:36,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:36,397 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:33:36,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:36,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 19:33:36,607 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 926147232, now seen corresponding path program 1 times [2022-11-18 19:33:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:36,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070611099] [2022-11-18 19:33:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:33:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:33:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:33:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:33:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:33:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:33:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:33:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 19:33:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 19:33:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 19:33:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 19:33:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 19:33:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 19:33:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 19:33:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 19:33:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 19:33:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 19:33:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 19:33:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-11-18 19:33:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070611099] [2022-11-18 19:33:37,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070611099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:37,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:37,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:33:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699586552] [2022-11-18 19:33:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:37,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:33:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:33:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:33:37,356 INFO L87 Difference]: Start difference. First operand 2161 states and 3098 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 19:33:40,233 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-18 19:33:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:47,093 INFO L93 Difference]: Finished difference Result 5255 states and 7925 transitions. [2022-11-18 19:33:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:33:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 189 [2022-11-18 19:33:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:47,107 INFO L225 Difference]: With dead ends: 5255 [2022-11-18 19:33:47,107 INFO L226 Difference]: Without dead ends: 3656 [2022-11-18 19:33:47,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:33:47,115 INFO L413 NwaCegarLoop]: 1525 mSDtfsCounter, 2410 mSDsluCounter, 7168 mSDsCounter, 0 mSdLazyCounter, 7201 mSolverCounterSat, 864 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 8693 SdHoareTripleChecker+Invalid, 8066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 7201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:47,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 8693 Invalid, 8066 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [864 Valid, 7201 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-11-18 19:33:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-11-18 19:33:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 2164. [2022-11-18 19:33:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1586 states have (on average 1.3795712484237075) internal successors, (2188), 1629 states have internal predecessors, (2188), 448 states have call successors, (448), 126 states have call predecessors, (448), 129 states have return successors, (465), 444 states have call predecessors, (465), 447 states have call successors, (465) [2022-11-18 19:33:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3101 transitions. [2022-11-18 19:33:47,512 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3101 transitions. Word has length 189 [2022-11-18 19:33:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:47,513 INFO L495 AbstractCegarLoop]: Abstraction has 2164 states and 3101 transitions. [2022-11-18 19:33:47,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-18 19:33:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3101 transitions. [2022-11-18 19:33:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-18 19:33:47,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:47,524 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:33:47,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:33:47,525 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 584311538, now seen corresponding path program 1 times [2022-11-18 19:33:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:47,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345653701] [2022-11-18 19:33:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:33:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:33:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:33:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:33:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:33:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:33:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:33:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 19:33:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 19:33:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 19:33:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 19:33:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:33:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 19:33:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 19:33:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-18 19:33:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 19:33:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 19:33:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 19:33:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-18 19:33:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-18 19:33:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345653701] [2022-11-18 19:33:56,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345653701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:56,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807223675] [2022-11-18 19:33:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:56,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:56,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:33:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:57,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 192 conjunts are in the unsatisfiable core [2022-11-18 19:33:57,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:57,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:33:58,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 19:33:58,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 19:33:58,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:58,983 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-18 19:33:58,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-11-18 19:33:59,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:59,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:33:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:59,381 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:33:59,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:33:59,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:34:00,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:34:00,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-18 19:34:00,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:34:00,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:34:00,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:34:00,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:34:00,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:34:00,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:34:00,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 19:34:01,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:34:01,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:34:01,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:34:01,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 19:34:01,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:34:01,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 19:34:01,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2022-11-18 19:34:01,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 19:34:01,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:34:01,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:34:01,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2022-11-18 19:34:01,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 19:34:01,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:34:01,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:34:01,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:01,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:34:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:02,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:34:02,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:02,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:02,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:34:02,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:02,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:02,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 19:34:03,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:03,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 97 [2022-11-18 19:34:03,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:03,282 INFO L321 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-11-18 19:34:03,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 33 [2022-11-18 19:34:03,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:34:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-18 19:34:03,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:03,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1026) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1025) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1027) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (not (<= .cse0 2147483647))))) is different from false [2022-11-18 19:34:03,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807223675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:03,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:34:03,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 65 [2022-11-18 19:34:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351437804] [2022-11-18 19:34:03,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-18 19:34:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:34:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-18 19:34:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3956, Unknown=1, NotChecked=126, Total=4290 [2022-11-18 19:34:03,383 INFO L87 Difference]: Start difference. First operand 2164 states and 3101 transitions. Second operand has 65 states, 63 states have (on average 3.634920634920635) internal successors, (229), 51 states have internal predecessors, (229), 21 states have call successors, (44), 13 states have call predecessors, (44), 16 states have return successors, (36), 24 states have call predecessors, (36), 20 states have call successors, (36) [2022-11-18 19:34:44,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:34:46,681 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-18 19:34:48,586 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-18 19:34:50,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:34:54,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:34:57,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:03,015 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-18 19:35:05,397 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-18 19:35:06,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:10,751 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-18 19:35:13,206 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-18 19:35:15,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:17,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:19,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:20,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:24,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:29,137 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-18 19:35:39,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:42,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:44,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:46,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:35:48,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:06,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:09,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:12,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:14,646 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-18 19:36:16,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:21,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:22,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:24,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:36:51,130 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-18 19:40:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:40:49,736 INFO L93 Difference]: Finished difference Result 39493 states and 66468 transitions. [2022-11-18 19:40:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2022-11-18 19:40:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 3.634920634920635) internal successors, (229), 51 states have internal predecessors, (229), 21 states have call successors, (44), 13 states have call predecessors, (44), 16 states have return successors, (36), 24 states have call predecessors, (36), 20 states have call successors, (36) Word has length 195 [2022-11-18 19:40:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:40:49,955 INFO L225 Difference]: With dead ends: 39493 [2022-11-18 19:40:49,956 INFO L226 Difference]: Without dead ends: 37353 [2022-11-18 19:40:50,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 288 SyntacticMatches, 13 SemanticMatches, 313 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38375 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=5460, Invalid=92825, Unknown=1, NotChecked=624, Total=98910 [2022-11-18 19:40:50,007 INFO L413 NwaCegarLoop]: 7086 mSDtfsCounter, 23859 mSDsluCounter, 204749 mSDsCounter, 0 mSdLazyCounter, 301872 mSolverCounterSat, 35063 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 341.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24300 SdHoareTripleChecker+Valid, 211835 SdHoareTripleChecker+Invalid, 406663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.1s SdHoareTripleChecker+Time, 35063 IncrementalHoareTripleChecker+Valid, 301872 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 69714 IncrementalHoareTripleChecker+Unchecked, 371.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:40:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24300 Valid, 211835 Invalid, 406663 Unknown, 0 Unchecked, 2.1s Time], IncrementalHoareTripleChecker [35063 Valid, 301872 Invalid, 14 Unknown, 69714 Unchecked, 371.6s Time] [2022-11-18 19:40:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37353 states. [2022-11-18 19:40:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37353 to 8918. [2022-11-18 19:40:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 6532 states have (on average 1.3853337415799143) internal successors, (9049), 6756 states have internal predecessors, (9049), 1842 states have call successors, (1842), 527 states have call predecessors, (1842), 543 states have return successors, (1931), 1778 states have call predecessors, (1931), 1841 states have call successors, (1931) [2022-11-18 19:40:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 12822 transitions. [2022-11-18 19:40:52,624 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 12822 transitions. Word has length 195 [2022-11-18 19:40:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:40:52,625 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 12822 transitions. [2022-11-18 19:40:52,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 3.634920634920635) internal successors, (229), 51 states have internal predecessors, (229), 21 states have call successors, (44), 13 states have call predecessors, (44), 16 states have return successors, (36), 24 states have call predecessors, (36), 20 states have call successors, (36) [2022-11-18 19:40:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 12822 transitions. [2022-11-18 19:40:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-18 19:40:52,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:40:52,661 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:40:52,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:40:52,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 19:40:52,870 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:40:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:40:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1678013455, now seen corresponding path program 1 times [2022-11-18 19:40:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:40:52,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306930605] [2022-11-18 19:40:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:40:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:40:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:40:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:40:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:40:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:40:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:40:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:40:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:40:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:40:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:40:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:40:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 19:40:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 19:40:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 19:40:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 19:40:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-18 19:40:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:40:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 19:40:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-18 19:40:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 19:40:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-18 19:40:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 19:40:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-18 19:40:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 19:40:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-11-18 19:40:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:40:53,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306930605] [2022-11-18 19:40:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306930605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:40:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:40:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:40:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884510204] [2022-11-18 19:40:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:40:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:40:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:40:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:40:53,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:40:53,445 INFO L87 Difference]: Start difference. First operand 8918 states and 12822 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-18 19:40:59,636 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-18 19:41:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:06,916 INFO L93 Difference]: Finished difference Result 21154 states and 30760 transitions. [2022-11-18 19:41:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:41:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 199 [2022-11-18 19:41:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:06,972 INFO L225 Difference]: With dead ends: 21154 [2022-11-18 19:41:06,972 INFO L226 Difference]: Without dead ends: 12746 [2022-11-18 19:41:06,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:41:06,997 INFO L413 NwaCegarLoop]: 1382 mSDtfsCounter, 2820 mSDsluCounter, 5516 mSDsCounter, 0 mSdLazyCounter, 8432 mSolverCounterSat, 1381 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 6898 SdHoareTripleChecker+Invalid, 9814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1381 IncrementalHoareTripleChecker+Valid, 8432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:06,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 6898 Invalid, 9814 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1381 Valid, 8432 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2022-11-18 19:41:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12746 states. [2022-11-18 19:41:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12746 to 10647. [2022-11-18 19:41:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10647 states, 7800 states have (on average 1.3828205128205129) internal successors, (10786), 8064 states have internal predecessors, (10786), 2197 states have call successors, (2197), 635 states have call predecessors, (2197), 649 states have return successors, (2293), 2121 states have call predecessors, (2293), 2196 states have call successors, (2293) [2022-11-18 19:41:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10647 states to 10647 states and 15276 transitions. [2022-11-18 19:41:09,001 INFO L78 Accepts]: Start accepts. Automaton has 10647 states and 15276 transitions. Word has length 199 [2022-11-18 19:41:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:41:09,002 INFO L495 AbstractCegarLoop]: Abstraction has 10647 states and 15276 transitions. [2022-11-18 19:41:09,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-18 19:41:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10647 states and 15276 transitions. [2022-11-18 19:41:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-18 19:41:09,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:41:09,034 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:41:09,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:41:09,035 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:41:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:41:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash 733489900, now seen corresponding path program 1 times [2022-11-18 19:41:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:41:09,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500236872] [2022-11-18 19:41:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:41:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:41:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:41:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:41:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:41:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:41:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:41:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:41:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:41:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:41:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:41:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 19:41:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 19:41:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 19:41:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 19:41:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:41:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 19:41:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-18 19:41:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 19:41:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-18 19:41:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-18 19:41:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-18 19:41:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 19:41:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-11-18 19:41:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:41:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500236872] [2022-11-18 19:41:11,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500236872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:41:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206420611] [2022-11-18 19:41:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:11,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:41:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:41:11,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:41:11,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:41:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:13,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 19:41:13,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:13,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-11-18 19:41:13,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-18 19:41:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 19:41:13,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:41:13,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206420611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:41:13,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:41:13,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 19 [2022-11-18 19:41:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168826889] [2022-11-18 19:41:13,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:41:13,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:41:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:41:13,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:41:13,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:41:13,361 INFO L87 Difference]: Start difference. First operand 10647 states and 15276 transitions. Second operand has 15 states, 15 states have (on average 8.666666666666666) internal successors, (130), 13 states have internal predecessors, (130), 5 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-18 19:41:21,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:22,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:25,786 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-18 19:41:27,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:31,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:33,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:34,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:37,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:41:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:41:55,919 INFO L93 Difference]: Finished difference Result 50168 states and 78353 transitions. [2022-11-18 19:41:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-18 19:41:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.666666666666666) internal successors, (130), 13 states have internal predecessors, (130), 5 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) Word has length 198 [2022-11-18 19:41:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:41:56,098 INFO L225 Difference]: With dead ends: 50168 [2022-11-18 19:41:56,099 INFO L226 Difference]: Without dead ends: 40087 [2022-11-18 19:41:56,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=558, Invalid=3864, Unknown=0, NotChecked=0, Total=4422 [2022-11-18 19:41:56,144 INFO L413 NwaCegarLoop]: 2887 mSDtfsCounter, 7767 mSDsluCounter, 28990 mSDsCounter, 0 mSdLazyCounter, 11793 mSolverCounterSat, 2535 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7780 SdHoareTripleChecker+Valid, 31877 SdHoareTripleChecker+Invalid, 14330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2535 IncrementalHoareTripleChecker+Valid, 11793 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:41:56,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7780 Valid, 31877 Invalid, 14330 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2535 Valid, 11793 Invalid, 2 Unknown, 0 Unchecked, 29.9s Time] [2022-11-18 19:41:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40087 states. [2022-11-18 19:42:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40087 to 18007. [2022-11-18 19:42:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18007 states, 13242 states have (on average 1.400392689925993) internal successors, (18544), 13719 states have internal predecessors, (18544), 3600 states have call successors, (3600), 1144 states have call predecessors, (3600), 1164 states have return successors, (4073), 3365 states have call predecessors, (4073), 3599 states have call successors, (4073) [2022-11-18 19:42:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18007 states to 18007 states and 26217 transitions. [2022-11-18 19:42:00,619 INFO L78 Accepts]: Start accepts. Automaton has 18007 states and 26217 transitions. Word has length 198 [2022-11-18 19:42:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:42:00,619 INFO L495 AbstractCegarLoop]: Abstraction has 18007 states and 26217 transitions. [2022-11-18 19:42:00,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.666666666666666) internal successors, (130), 13 states have internal predecessors, (130), 5 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-18 19:42:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 18007 states and 26217 transitions. [2022-11-18 19:42:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-11-18 19:42:00,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:42:00,665 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:42:00,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:42:00,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 19:42:00,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:42:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:42:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -414394221, now seen corresponding path program 1 times [2022-11-18 19:42:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:42:00,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846852032] [2022-11-18 19:42:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:42:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:42:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:42:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-18 19:42:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:42:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 19:42:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 19:42:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:42:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:42:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 19:42:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:42:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:42:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 19:42:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 19:42:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 19:42:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 19:42:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 19:42:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:42:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 19:42:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 19:42:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 19:42:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-18 19:42:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-18 19:42:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-18 19:42:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 19:42:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-18 19:42:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:42:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846852032] [2022-11-18 19:42:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846852032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:42:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925691932] [2022-11-18 19:42:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:42:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:42:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:42:11,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:42:11,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbcb1efb-56b2-4902-9b55-391d68d43229/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:42:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:42:11,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 224 conjunts are in the unsatisfiable core [2022-11-18 19:42:11,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:42:11,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:42:12,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 19:42:12,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:42:13,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:42:13,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 19:42:13,352 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:42:13,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 19:42:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:14,053 INFO L321 Elim1Store]: treesize reduction 41, result has 34.9 percent of original size [2022-11-18 19:42:14,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2022-11-18 19:42:14,387 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:42:14,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 19:42:14,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 19:42:14,508 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 19:42:14,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 19:42:14,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:42:15,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:15,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:15,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-18 19:42:15,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:42:15,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:42:15,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:42:15,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:15,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:42:15,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:42:15,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:42:15,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 19:42:15,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:15,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:15,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 19:42:16,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:42:16,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:42:16,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-11-18 19:42:16,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 19:42:16,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:42:16,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:42:16,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:16,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:42:16,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:42:16,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:16,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:16,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2022-11-18 19:42:16,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-11-18 19:42:16,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:16,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-18 19:42:16,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-18 19:42:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 19:42:17,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:42:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-18 19:42:17,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-18 19:42:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 19:42:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:17,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:42:18,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 235 [2022-11-18 19:42:18,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:18,683 INFO L321 Elim1Store]: treesize reduction 33, result has 29.8 percent of original size [2022-11-18 19:42:18,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 331 treesize of output 228 [2022-11-18 19:42:18,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:18,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2022-11-18 19:42:18,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 140 [2022-11-18 19:42:18,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2022-11-18 19:42:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 68 proven. 17 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-18 19:42:18,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:42:18,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1626) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1627) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1625) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (not (<= .cse0 2147483647))))) is different from false [2022-11-18 19:42:18,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925691932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:42:18,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:42:18,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 41] total 73 [2022-11-18 19:42:18,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340184648] [2022-11-18 19:42:18,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:42:18,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-18 19:42:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:42:18,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-18 19:42:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5020, Unknown=1, NotChecked=142, Total=5402 [2022-11-18 19:42:18,830 INFO L87 Difference]: Start difference. First operand 18007 states and 26217 transitions. Second operand has 73 states, 71 states have (on average 3.3380281690140845) internal successors, (237), 59 states have internal predecessors, (237), 23 states have call successors, (46), 13 states have call predecessors, (46), 17 states have return successors, (38), 26 states have call predecessors, (38), 22 states have call successors, (38) [2022-11-18 19:43:14,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:17,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:21,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-18 19:43:22,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:25,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:26,760 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-18 19:43:29,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:31,402 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-18 19:43:34,048 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-18 19:43:37,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:38,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:40,740 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-18 19:43:42,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:44,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:50,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:43:56,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:10,332 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-18 19:44:12,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:14,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:16,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:20,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:22,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 19:44:28,317 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-18 19:44:30,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []