./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:35:36,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:35:36,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:35:36,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:35:36,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:35:36,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:35:36,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:35:36,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:35:36,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:35:36,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:35:36,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:35:36,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:35:36,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:35:36,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:35:36,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:35:36,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:35:36,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:35:36,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:35:36,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:35:36,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:35:36,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:35:36,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:35:36,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:35:36,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:35:36,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:35:36,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:35:36,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:35:36,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:35:36,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:35:36,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:35:36,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:35:36,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:35:36,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:35:36,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:35:36,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:35:36,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:35:36,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:35:36,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:35:36,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:35:36,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:35:36,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:35:36,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-03 01:35:36,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:35:36,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:35:36,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:35:36,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:35:36,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:35:36,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:35:36,629 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:35:36,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:35:36,630 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:35:36,630 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:35:36,631 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:35:36,631 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:35:36,631 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:35:36,632 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:35:36,632 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:35:36,632 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:35:36,632 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:35:36,633 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:35:36,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:35:36,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:35:36,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:35:36,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:35:36,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:35:36,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:35:36,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:35:36,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:35:36,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:35:36,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:35:36,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:35:36,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:35:36,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:35:36,638 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:35:36,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:35:36,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:35:36,638 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:35:36,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:35:36,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:35:36,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:35:36,639 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_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/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_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 [2022-11-03 01:35:36,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:35:36,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:35:36,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:35:36,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:35:36,987 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:35:36,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-11-03 01:35:37,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/data/1c64ab4bb/76b20aa97ca1459f9e5d75c506fe122f/FLAG85bf15287 [2022-11-03 01:35:37,887 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:35:37,888 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-11-03 01:35:37,945 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/data/1c64ab4bb/76b20aa97ca1459f9e5d75c506fe122f/FLAG85bf15287 [2022-11-03 01:35:38,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/data/1c64ab4bb/76b20aa97ca1459f9e5d75c506fe122f [2022-11-03 01:35:38,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:35:38,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:35:38,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:35:38,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:35:38,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:35:38,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:35:38" (1/1) ... [2022-11-03 01:35:38,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400649be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:38, skipping insertion in model container [2022-11-03 01:35:38,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:35:38" (1/1) ... [2022-11-03 01:35:38,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:35:38,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:35:40,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2022-11-03 01:35:40,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:35:40,368 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:35:40,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2022-11-03 01:35:40,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:35:40,838 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:35:40,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40 WrapperNode [2022-11-03 01:35:40,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:35:40,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:35:40,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:35:40,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:35:40,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:40,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,048 INFO L138 Inliner]: procedures = 216, calls = 1408, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3072 [2022-11-03 01:35:41,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:35:41,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:35:41,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:35:41,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:35:41,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,227 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:35:41,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:35:41,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:35:41,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:35:41,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:35:41,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:41,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:35:41,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:35:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-11-03 01:35:41,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-11-03 01:35:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-11-03 01:35:41,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-11-03 01:35:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-03 01:35:41,369 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-03 01:35:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-03 01:35:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-03 01:35:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-11-03 01:35:41,370 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-11-03 01:35:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-11-03 01:35:41,370 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-11-03 01:35:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-03 01:35:41,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-03 01:35:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2022-11-03 01:35:41,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2022-11-03 01:35:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-11-03 01:35:41,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-11-03 01:35:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-03 01:35:41,371 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-03 01:35:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-03 01:35:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-03 01:35:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2022-11-03 01:35:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2022-11-03 01:35:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-11-03 01:35:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-11-03 01:35:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-03 01:35:41,373 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-03 01:35:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:35:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-11-03 01:35:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-11-03 01:35:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-03 01:35:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-03 01:35:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:35:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-03 01:35:41,375 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-03 01:35:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-11-03 01:35:41,375 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-11-03 01:35:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:35:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:35:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-11-03 01:35:41,376 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-11-03 01:35:41,376 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-03 01:35:41,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-03 01:35:41,376 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-03 01:35:41,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-03 01:35:41,377 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-03 01:35:41,378 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-03 01:35:41,378 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-03 01:35:41,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-03 01:35:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-03 01:35:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-03 01:35:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-03 01:35:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-03 01:35:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-11-03 01:35:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-11-03 01:35:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-11-03 01:35:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-11-03 01:35:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-11-03 01:35:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-11-03 01:35:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-11-03 01:35:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-11-03 01:35:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-03 01:35:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-03 01:35:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-11-03 01:35:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-11-03 01:35:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-03 01:35:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-11-03 01:35:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-11-03 01:35:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-03 01:35:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-03 01:35:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-03 01:35:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-11-03 01:35:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-11-03 01:35:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-11-03 01:35:41,386 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-11-03 01:35:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:35:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-03 01:35:41,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-03 01:35:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-03 01:35:41,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-03 01:35:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-03 01:35:41,387 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-03 01:35:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-03 01:35:41,388 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-03 01:35:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-11-03 01:35:41,388 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-11-03 01:35:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-11-03 01:35:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-11-03 01:35:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:35:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-11-03 01:35:41,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-11-03 01:35:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-11-03 01:35:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-11-03 01:35:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-03 01:35:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-03 01:35:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-11-03 01:35:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-11-03 01:35:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-11-03 01:35:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-11-03 01:35:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:35:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:35:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:35:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2022-11-03 01:35:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2022-11-03 01:35:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-03 01:35:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-03 01:35:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-03 01:35:41,431 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-03 01:35:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-11-03 01:35:41,432 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-11-03 01:35:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-03 01:35:41,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-03 01:35:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:35:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:35:41,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:35:42,134 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:35:42,137 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:35:48,164 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:35:49,015 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:35:49,020 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:35:49,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:35:49 BoogieIcfgContainer [2022-11-03 01:35:49,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:35:49,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:35:49,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:35:49,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:35:49,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:35:38" (1/3) ... [2022-11-03 01:35:49,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12745f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:35:49, skipping insertion in model container [2022-11-03 01:35:49,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40" (2/3) ... [2022-11-03 01:35:49,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12745f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:35:49, skipping insertion in model container [2022-11-03 01:35:49,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:35:49" (3/3) ... [2022-11-03 01:35:49,037 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-11-03 01:35:49,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:35:49,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:35:49,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:35:49,155 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=FINITE_AUTOMATA, 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;@60427634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:35:49,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:35:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 670 states, 414 states have (on average 1.3357487922705313) internal successors, (553), 434 states have internal predecessors, (553), 204 states have call successors, (204), 50 states have call predecessors, (204), 50 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2022-11-03 01:35:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:35:49,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:49,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:49,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1219217795, now seen corresponding path program 1 times [2022-11-03 01:35:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:49,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955277595] [2022-11-03 01:35:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:35:49,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955277595] [2022-11-03 01:35:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955277595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:35:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:35:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82806112] [2022-11-03 01:35:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:35:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:35:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:49,804 INFO L87 Difference]: Start difference. First operand has 670 states, 414 states have (on average 1.3357487922705313) internal successors, (553), 434 states have internal predecessors, (553), 204 states have call successors, (204), 50 states have call predecessors, (204), 50 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:35:52,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:35:54,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:35:56,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:35:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:57,451 INFO L93 Difference]: Finished difference Result 1926 states and 2808 transitions. [2022-11-03 01:35:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:35:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:35:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:57,488 INFO L225 Difference]: With dead ends: 1926 [2022-11-03 01:35:57,489 INFO L226 Difference]: Without dead ends: 1253 [2022-11-03 01:35:57,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:57,507 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 850 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:57,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1767 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 312 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-11-03 01:35:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2022-11-03 01:35:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1249. [2022-11-03 01:35:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 776 states have (on average 1.3260309278350515) internal successors, (1029), 805 states have internal predecessors, (1029), 376 states have call successors, (376), 98 states have call predecessors, (376), 96 states have return successors, (375), 355 states have call predecessors, (375), 368 states have call successors, (375) [2022-11-03 01:35:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1780 transitions. [2022-11-03 01:35:57,735 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1780 transitions. Word has length 7 [2022-11-03 01:35:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:57,736 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1780 transitions. [2022-11-03 01:35:57,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:35:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1780 transitions. [2022-11-03 01:35:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:35:57,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:57,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:57,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:35:57,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -859360151, now seen corresponding path program 1 times [2022-11-03 01:35:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:57,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339909453] [2022-11-03 01:35:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:35:57,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339909453] [2022-11-03 01:35:57,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339909453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:57,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:35:57,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:35:57,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654406144] [2022-11-03 01:35:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:35:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:35:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:57,917 INFO L87 Difference]: Start difference. First operand 1249 states and 1780 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:00,082 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-03 01:36:03,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:03,754 INFO L93 Difference]: Finished difference Result 2457 states and 3496 transitions. [2022-11-03 01:36:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:36:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:03,771 INFO L225 Difference]: With dead ends: 2457 [2022-11-03 01:36:03,772 INFO L226 Difference]: Without dead ends: 2454 [2022-11-03 01:36:03,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:03,775 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 884 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:03,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1776 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-11-03 01:36:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2022-11-03 01:36:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2447. [2022-11-03 01:36:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 1524 states have (on average 1.3267716535433072) internal successors, (2022), 1576 states have internal predecessors, (2022), 730 states have call successors, (730), 195 states have call predecessors, (730), 192 states have return successors, (735), 695 states have call predecessors, (735), 722 states have call successors, (735) [2022-11-03 01:36:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3487 transitions. [2022-11-03 01:36:03,982 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3487 transitions. Word has length 8 [2022-11-03 01:36:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:03,982 INFO L495 AbstractCegarLoop]: Abstraction has 2447 states and 3487 transitions. [2022-11-03 01:36:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3487 transitions. [2022-11-03 01:36:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:36:03,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:03,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:03,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:36:03,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash -870762170, now seen corresponding path program 1 times [2022-11-03 01:36:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741966869] [2022-11-03 01:36:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:04,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741966869] [2022-11-03 01:36:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741966869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:04,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:36:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79097356] [2022-11-03 01:36:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:04,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:04,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:04,145 INFO L87 Difference]: Start difference. First operand 2447 states and 3487 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:06,306 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-03 01:36:10,740 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-03 01:36:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:11,271 INFO L93 Difference]: Finished difference Result 2458 states and 3497 transitions. [2022-11-03 01:36:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:36:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:11,287 INFO L225 Difference]: With dead ends: 2458 [2022-11-03 01:36:11,287 INFO L226 Difference]: Without dead ends: 2455 [2022-11-03 01:36:11,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:11,290 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 881 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:11,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1779 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-11-03 01:36:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-11-03 01:36:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2448. [2022-11-03 01:36:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 1525 states have (on average 1.3265573770491803) internal successors, (2023), 1577 states have internal predecessors, (2023), 730 states have call successors, (730), 195 states have call predecessors, (730), 192 states have return successors, (735), 695 states have call predecessors, (735), 722 states have call successors, (735) [2022-11-03 01:36:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3488 transitions. [2022-11-03 01:36:11,421 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3488 transitions. Word has length 9 [2022-11-03 01:36:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:11,422 INFO L495 AbstractCegarLoop]: Abstraction has 2448 states and 3488 transitions. [2022-11-03 01:36:11,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3488 transitions. [2022-11-03 01:36:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:36:11,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:11,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:36:11,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1224219892, now seen corresponding path program 1 times [2022-11-03 01:36:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:11,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102961107] [2022-11-03 01:36:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:11,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102961107] [2022-11-03 01:36:11,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102961107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:11,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:11,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:36:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606059464] [2022-11-03 01:36:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:11,622 INFO L87 Difference]: Start difference. First operand 2448 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:13,756 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-03 01:36:16,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:19,112 INFO L93 Difference]: Finished difference Result 4700 states and 6775 transitions. [2022-11-03 01:36:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 01:36:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:19,147 INFO L225 Difference]: With dead ends: 4700 [2022-11-03 01:36:19,147 INFO L226 Difference]: Without dead ends: 4691 [2022-11-03 01:36:19,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:19,154 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 872 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:19,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1833 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 318 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-11-03 01:36:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-11-03 01:36:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4684. [2022-11-03 01:36:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 2917 states have (on average 1.3239629756599245) internal successors, (3862), 3013 states have internal predecessors, (3862), 1388 states have call successors, (1388), 383 states have call predecessors, (1388), 378 states have return successors, (1503), 1327 states have call predecessors, (1503), 1380 states have call successors, (1503) [2022-11-03 01:36:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6753 transitions. [2022-11-03 01:36:19,464 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6753 transitions. Word has length 10 [2022-11-03 01:36:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:19,464 INFO L495 AbstractCegarLoop]: Abstraction has 4684 states and 6753 transitions. [2022-11-03 01:36:19,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:36:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6753 transitions. [2022-11-03 01:36:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-03 01:36:19,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:19,479 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-03 01:36:19,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:36:19,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1628095722, now seen corresponding path program 1 times [2022-11-03 01:36:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:19,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345779326] [2022-11-03 01:36:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:36:19,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:19,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345779326] [2022-11-03 01:36:19,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345779326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:19,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:19,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912163672] [2022-11-03 01:36:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:19,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:19,863 INFO L87 Difference]: Start difference. First operand 4684 states and 6753 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-03 01:36:22,079 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-03 01:36:24,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:25,099 INFO L93 Difference]: Finished difference Result 9415 states and 13592 transitions. [2022-11-03 01:36:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2022-11-03 01:36:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:25,133 INFO L225 Difference]: With dead ends: 9415 [2022-11-03 01:36:25,133 INFO L226 Difference]: Without dead ends: 4732 [2022-11-03 01:36:25,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:25,154 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 230 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:25,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1318 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 01:36:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2022-11-03 01:36:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 4732. [2022-11-03 01:36:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 2965 states have (on average 1.3264755480607082) internal successors, (3933), 3061 states have internal predecessors, (3933), 1388 states have call successors, (1388), 383 states have call predecessors, (1388), 378 states have return successors, (1503), 1327 states have call predecessors, (1503), 1380 states have call successors, (1503) [2022-11-03 01:36:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2022-11-03 01:36:25,501 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 84 [2022-11-03 01:36:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:25,502 INFO L495 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2022-11-03 01:36:25,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-03 01:36:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2022-11-03 01:36:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-03 01:36:25,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:25,507 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:25,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:36:25,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 485203591, now seen corresponding path program 1 times [2022-11-03 01:36:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694418717] [2022-11-03 01:36:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:36:25,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:25,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694418717] [2022-11-03 01:36:25,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694418717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:25,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:25,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436348869] [2022-11-03 01:36:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:25,924 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-03 01:36:28,080 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-03 01:36:32,553 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-03 01:36:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:33,350 INFO L93 Difference]: Finished difference Result 11616 states and 16713 transitions. [2022-11-03 01:36:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 97 [2022-11-03 01:36:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:33,398 INFO L225 Difference]: With dead ends: 11616 [2022-11-03 01:36:33,398 INFO L226 Difference]: Without dead ends: 6885 [2022-11-03 01:36:33,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:33,421 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 824 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:33,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1775 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 301 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-11-03 01:36:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2022-11-03 01:36:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 6862. [2022-11-03 01:36:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 4290 states have (on average 1.3202797202797203) internal successors, (5664), 4432 states have internal predecessors, (5664), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:36:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 9839 transitions. [2022-11-03 01:36:33,885 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 9839 transitions. Word has length 97 [2022-11-03 01:36:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:33,887 INFO L495 AbstractCegarLoop]: Abstraction has 6862 states and 9839 transitions. [2022-11-03 01:36:33,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-03 01:36:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 9839 transitions. [2022-11-03 01:36:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 01:36:33,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:33,893 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-03 01:36:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:36:33,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash -735956694, now seen corresponding path program 1 times [2022-11-03 01:36:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:33,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139822134] [2022-11-03 01:36:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-03 01:36:34,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139822134] [2022-11-03 01:36:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139822134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:34,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:34,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:36:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679655459] [2022-11-03 01:36:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:34,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:36:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:36:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:36:34,558 INFO L87 Difference]: Start difference. First operand 6862 states and 9839 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-03 01:36:36,834 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-03 01:36:41,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:45,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:46,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:48,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:36:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:48,585 INFO L93 Difference]: Finished difference Result 17591 states and 26389 transitions. [2022-11-03 01:36:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:36:48,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 99 [2022-11-03 01:36:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:48,644 INFO L225 Difference]: With dead ends: 17591 [2022-11-03 01:36:48,645 INFO L226 Difference]: Without dead ends: 10730 [2022-11-03 01:36:48,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:36:48,675 INFO L413 NwaCegarLoop]: 1064 mSDtfsCounter, 719 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 216 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:48,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 3907 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 726 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2022-11-03 01:36:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10730 states. [2022-11-03 01:36:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10730 to 6898. [2022-11-03 01:36:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6898 states, 4326 states have (on average 1.317614424410541) internal successors, (5700), 4468 states have internal predecessors, (5700), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:36:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 9875 transitions. [2022-11-03 01:36:49,323 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 9875 transitions. Word has length 99 [2022-11-03 01:36:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:49,324 INFO L495 AbstractCegarLoop]: Abstraction has 6898 states and 9875 transitions. [2022-11-03 01:36:49,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-03 01:36:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 9875 transitions. [2022-11-03 01:36:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-03 01:36:49,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:49,333 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-03 01:36:49,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:36:49,334 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1663331234, now seen corresponding path program 1 times [2022-11-03 01:36:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:49,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308868409] [2022-11-03 01:36:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:49,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-03 01:36:49,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308868409] [2022-11-03 01:36:49,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308868409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:49,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:49,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220823383] [2022-11-03 01:36:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:49,731 INFO L87 Difference]: Start difference. First operand 6898 states and 9875 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-03 01:36:51,917 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-03 01:36:57,379 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-03 01:36:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:57,389 INFO L93 Difference]: Finished difference Result 15288 states and 22281 transitions. [2022-11-03 01:36:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 106 [2022-11-03 01:36:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:57,466 INFO L225 Difference]: With dead ends: 15288 [2022-11-03 01:36:57,466 INFO L226 Difference]: Without dead ends: 8391 [2022-11-03 01:36:57,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:57,495 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 118 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:57,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1811 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-11-03 01:36:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2022-11-03 01:36:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 6910. [2022-11-03 01:36:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6910 states, 4338 states have (on average 1.3167358229598893) internal successors, (5712), 4480 states have internal predecessors, (5712), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:36:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6910 states to 6910 states and 9887 transitions. [2022-11-03 01:36:58,062 INFO L78 Accepts]: Start accepts. Automaton has 6910 states and 9887 transitions. Word has length 106 [2022-11-03 01:36:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:58,065 INFO L495 AbstractCegarLoop]: Abstraction has 6910 states and 9887 transitions. [2022-11-03 01:36:58,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-03 01:36:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6910 states and 9887 transitions. [2022-11-03 01:36:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 01:36:58,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:58,068 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:36:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:36:58,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1268749558, now seen corresponding path program 1 times [2022-11-03 01:36:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884350004] [2022-11-03 01:36:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:36:58,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:58,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884350004] [2022-11-03 01:36:58,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884350004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:58,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:58,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:36:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676881103] [2022-11-03 01:36:58,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:58,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:36:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:58,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:36:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:36:58,510 INFO L87 Difference]: Start difference. First operand 6910 states and 9887 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-03 01:37:02,575 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-03 01:37:04,896 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-03 01:37:07,144 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-03 01:37:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:07,369 INFO L93 Difference]: Finished difference Result 13893 states and 19870 transitions. [2022-11-03 01:37:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:37:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2022-11-03 01:37:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:07,398 INFO L225 Difference]: With dead ends: 13893 [2022-11-03 01:37:07,398 INFO L226 Difference]: Without dead ends: 6982 [2022-11-03 01:37:07,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:07,423 INFO L413 NwaCegarLoop]: 810 mSDtfsCounter, 21 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:07,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2411 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-11-03 01:37:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6982 states. [2022-11-03 01:37:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6982 to 6924. [2022-11-03 01:37:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6924 states, 4352 states have (on average 1.3154871323529411) internal successors, (5725), 4494 states have internal predecessors, (5725), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:37:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6924 states to 6924 states and 9900 transitions. [2022-11-03 01:37:07,915 INFO L78 Accepts]: Start accepts. Automaton has 6924 states and 9900 transitions. Word has length 103 [2022-11-03 01:37:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:07,916 INFO L495 AbstractCegarLoop]: Abstraction has 6924 states and 9900 transitions. [2022-11-03 01:37:07,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-03 01:37:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6924 states and 9900 transitions. [2022-11-03 01:37:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-03 01:37:07,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:07,919 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:37:07,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:37:07,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1785857547, now seen corresponding path program 1 times [2022-11-03 01:37:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:07,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72438265] [2022-11-03 01:37:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:37:08,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:08,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72438265] [2022-11-03 01:37:08,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72438265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:08,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787414008] [2022-11-03 01:37:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:08,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:08,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:37:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:09,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:37:09,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 01:37:09,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:09,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787414008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:09,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:09,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 01:37:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110836947] [2022-11-03 01:37:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:37:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:37:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:09,306 INFO L87 Difference]: Start difference. First operand 6924 states and 9900 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-03 01:37:12,516 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-03 01:37:15,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:15,853 INFO L93 Difference]: Finished difference Result 13871 states and 19879 transitions. [2022-11-03 01:37:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:37:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 116 [2022-11-03 01:37:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:15,883 INFO L225 Difference]: With dead ends: 13871 [2022-11-03 01:37:15,884 INFO L226 Difference]: Without dead ends: 6948 [2022-11-03 01:37:15,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:15,906 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 2 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1594 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-11-03 01:37:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-11-03 01:37:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 6936. [2022-11-03 01:37:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 4364 states have (on average 1.3146196150320806) internal successors, (5737), 4506 states have internal predecessors, (5737), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:37:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 9912 transitions. [2022-11-03 01:37:16,513 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 9912 transitions. Word has length 116 [2022-11-03 01:37:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:16,514 INFO L495 AbstractCegarLoop]: Abstraction has 6936 states and 9912 transitions. [2022-11-03 01:37:16,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-03 01:37:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 9912 transitions. [2022-11-03 01:37:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 01:37:16,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:16,517 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:37:16,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:37:16,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash -380657438, now seen corresponding path program 1 times [2022-11-03 01:37:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:16,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60801800] [2022-11-03 01:37:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 01:37:17,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:17,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60801800] [2022-11-03 01:37:17,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60801800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:17,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407628416] [2022-11-03 01:37:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:17,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:17,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:17,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:37:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:18,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 2347 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:37:18,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 01:37:18,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:18,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407628416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:18,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:18,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 01:37:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850992777] [2022-11-03 01:37:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:18,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:37:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:37:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:18,250 INFO L87 Difference]: Start difference. First operand 6936 states and 9912 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-03 01:37:21,766 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-03 01:37:24,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:25,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:26,108 INFO L93 Difference]: Finished difference Result 13883 states and 19879 transitions. [2022-11-03 01:37:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:37:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 118 [2022-11-03 01:37:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:26,134 INFO L225 Difference]: With dead ends: 13883 [2022-11-03 01:37:26,134 INFO L226 Difference]: Without dead ends: 6948 [2022-11-03 01:37:26,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:26,156 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 0 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:26,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1595 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-11-03 01:37:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-11-03 01:37:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 6948. [2022-11-03 01:37:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6948 states, 4376 states have (on average 1.3137568555758683) internal successors, (5749), 4518 states have internal predecessors, (5749), 2004 states have call successors, (2004), 574 states have call predecessors, (2004), 567 states have return successors, (2171), 1915 states have call predecessors, (2171), 1996 states have call successors, (2171) [2022-11-03 01:37:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6948 states to 6948 states and 9924 transitions. [2022-11-03 01:37:26,631 INFO L78 Accepts]: Start accepts. Automaton has 6948 states and 9924 transitions. Word has length 118 [2022-11-03 01:37:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:26,632 INFO L495 AbstractCegarLoop]: Abstraction has 6948 states and 9924 transitions. [2022-11-03 01:37:26,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-03 01:37:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6948 states and 9924 transitions. [2022-11-03 01:37:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-03 01:37:26,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:26,635 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:37:26,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:26,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:37:26,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1988012089, now seen corresponding path program 1 times [2022-11-03 01:37:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:26,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254823255] [2022-11-03 01:37:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-03 01:37:27,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254823255] [2022-11-03 01:37:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254823255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457688284] [2022-11-03 01:37:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:27,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:27,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:37:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:28,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 2374 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:37:28,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:37:28,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:37:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-03 01:37:28,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457688284] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:37:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1984329781] [2022-11-03 01:37:28,561 INFO L159 IcfgInterpreter]: Started Sifa with 99 locations of interest [2022-11-03 01:37:28,561 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:37:28,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:37:28,570 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:37:28,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:37:36,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:37:36,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 01:37:42,020 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: not yet implemented, we need term in nnf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PrenexNormalForm.convertApplicationTerm(PrenexNormalForm.java:89) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:85) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:71) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:37:42,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:37:42,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 01:37:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719419758] [2022-11-03 01:37:42,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:37:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:37:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:37:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:42,030 INFO L87 Difference]: Start difference. First operand 6948 states and 9924 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2022-11-03 01:37:44,482 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-03 01:37:51,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:52,640 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-03 01:37:54,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:57,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:37:59,176 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-03 01:38:01,009 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-03 01:38:03,072 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-03 01:38:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:03,145 INFO L93 Difference]: Finished difference Result 19859 states and 29915 transitions. [2022-11-03 01:38:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:38:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 119 [2022-11-03 01:38:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:03,203 INFO L225 Difference]: With dead ends: 19859 [2022-11-03 01:38:03,203 INFO L226 Difference]: Without dead ends: 12912 [2022-11-03 01:38:03,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:38:03,237 INFO L413 NwaCegarLoop]: 1104 mSDtfsCounter, 590 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 4780 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:03,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 4780 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1357 Invalid, 3 Unknown, 0 Unchecked, 20.3s Time] [2022-11-03 01:38:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-11-03 01:38:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 7092. [2022-11-03 01:38:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7092 states, 4484 states have (on average 1.314228367528992) internal successors, (5893), 4626 states have internal predecessors, (5893), 2040 states have call successors, (2040), 574 states have call predecessors, (2040), 567 states have return successors, (2207), 1951 states have call predecessors, (2207), 2032 states have call successors, (2207) [2022-11-03 01:38:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 10140 transitions. [2022-11-03 01:38:03,976 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 10140 transitions. Word has length 119 [2022-11-03 01:38:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:03,978 INFO L495 AbstractCegarLoop]: Abstraction has 7092 states and 10140 transitions. [2022-11-03 01:38:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2022-11-03 01:38:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 10140 transitions. [2022-11-03 01:38:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-03 01:38:03,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:03,982 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-03 01:38:04,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:04,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:04,198 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 528024864, now seen corresponding path program 2 times [2022-11-03 01:38:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070772998] [2022-11-03 01:38:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-03 01:38:04,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:04,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070772998] [2022-11-03 01:38:04,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070772998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:04,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907227593] [2022-11-03 01:38:04,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:38:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:04,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:04,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:38:05,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:38:05,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:05,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:38:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-03 01:38:05,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:38:05,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907227593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:05,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:38:05,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-03 01:38:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738495777] [2022-11-03 01:38:05,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:05,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:38:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:05,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:38:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:38:05,715 INFO L87 Difference]: Start difference. First operand 7092 states and 10140 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-03 01:38:07,991 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-03 01:38:12,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:38:13,389 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-03 01:38:14,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:38:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:14,925 INFO L93 Difference]: Finished difference Result 7142 states and 10234 transitions. [2022-11-03 01:38:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:38:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2022-11-03 01:38:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:14,947 INFO L225 Difference]: With dead ends: 7142 [2022-11-03 01:38:14,947 INFO L226 Difference]: Without dead ends: 7139 [2022-11-03 01:38:14,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:38:14,951 INFO L413 NwaCegarLoop]: 803 mSDtfsCounter, 51 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:14,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2314 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-11-03 01:38:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2022-11-03 01:38:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7139. [2022-11-03 01:38:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7139 states, 4514 states have (on average 1.31346920691183) internal successors, (5929), 4661 states have internal predecessors, (5929), 2039 states have call successors, (2039), 586 states have call predecessors, (2039), 585 states have return successors, (2258), 1951 states have call predecessors, (2258), 2032 states have call successors, (2258) [2022-11-03 01:38:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 10226 transitions. [2022-11-03 01:38:15,451 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 10226 transitions. Word has length 149 [2022-11-03 01:38:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:15,452 INFO L495 AbstractCegarLoop]: Abstraction has 7139 states and 10226 transitions. [2022-11-03 01:38:15,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-03 01:38:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 10226 transitions. [2022-11-03 01:38:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-03 01:38:15,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:15,456 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:38:15,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:15,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:38:15,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 531118459, now seen corresponding path program 1 times [2022-11-03 01:38:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381844101] [2022-11-03 01:38:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-03 01:38:16,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:16,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381844101] [2022-11-03 01:38:16,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381844101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:16,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:16,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:38:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631656388] [2022-11-03 01:38:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:16,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:38:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:38:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:38:16,044 INFO L87 Difference]: Start difference. First operand 7139 states and 10226 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-03 01:38:18,275 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-03 01:38:20,856 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-03 01:38:22,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:38:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:22,751 INFO L93 Difference]: Finished difference Result 14313 states and 20535 transitions. [2022-11-03 01:38:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:38:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2022-11-03 01:38:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:22,781 INFO L225 Difference]: With dead ends: 14313 [2022-11-03 01:38:22,782 INFO L226 Difference]: Without dead ends: 7175 [2022-11-03 01:38:22,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:38:22,809 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:22,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1590 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-11-03 01:38:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2022-11-03 01:38:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 7151. [2022-11-03 01:38:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7151 states, 4526 states have (on average 1.3126380910296067) internal successors, (5941), 4673 states have internal predecessors, (5941), 2039 states have call successors, (2039), 586 states have call predecessors, (2039), 585 states have return successors, (2258), 1951 states have call predecessors, (2258), 2032 states have call successors, (2258) [2022-11-03 01:38:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 10238 transitions. [2022-11-03 01:38:23,442 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 10238 transitions. Word has length 156 [2022-11-03 01:38:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:23,443 INFO L495 AbstractCegarLoop]: Abstraction has 7151 states and 10238 transitions. [2022-11-03 01:38:23,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-03 01:38:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 10238 transitions. [2022-11-03 01:38:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-03 01:38:23,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:23,448 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:38:23,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:38:23,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1522226009, now seen corresponding path program 1 times [2022-11-03 01:38:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:23,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841391249] [2022-11-03 01:38:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-03 01:38:23,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:23,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841391249] [2022-11-03 01:38:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841391249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332892845] [2022-11-03 01:38:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:23,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:23,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:38:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:24,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 2429 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:38:24,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-03 01:38:24,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:38:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332892845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:38:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 01:38:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399134304] [2022-11-03 01:38:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:24,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:38:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:38:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:38:24,968 INFO L87 Difference]: Start difference. First operand 7151 states and 10238 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:38:28,284 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-03 01:38:30,100 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-03 01:38:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:31,094 INFO L93 Difference]: Finished difference Result 14337 states and 20583 transitions. [2022-11-03 01:38:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:38:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 161 [2022-11-03 01:38:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:31,113 INFO L225 Difference]: With dead ends: 14337 [2022-11-03 01:38:31,113 INFO L226 Difference]: Without dead ends: 7187 [2022-11-03 01:38:31,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:38:31,131 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:31,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1591 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-11-03 01:38:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2022-11-03 01:38:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 7163. [2022-11-03 01:38:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7163 states, 4538 states have (on average 1.3118113706478625) internal successors, (5953), 4685 states have internal predecessors, (5953), 2039 states have call successors, (2039), 586 states have call predecessors, (2039), 585 states have return successors, (2258), 1951 states have call predecessors, (2258), 2032 states have call successors, (2258) [2022-11-03 01:38:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7163 states to 7163 states and 10250 transitions. [2022-11-03 01:38:31,526 INFO L78 Accepts]: Start accepts. Automaton has 7163 states and 10250 transitions. Word has length 161 [2022-11-03 01:38:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:31,526 INFO L495 AbstractCegarLoop]: Abstraction has 7163 states and 10250 transitions. [2022-11-03 01:38:31,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:38:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 7163 states and 10250 transitions. [2022-11-03 01:38:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-03 01:38:31,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:31,531 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:38:31,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 01:38:31,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:38:31,754 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash -136275018, now seen corresponding path program 1 times [2022-11-03 01:38:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:31,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598756069] [2022-11-03 01:38:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-03 01:38:32,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:32,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598756069] [2022-11-03 01:38:32,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598756069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595346731] [2022-11-03 01:38:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:32,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:32,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:32,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:32,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:38:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:33,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 2447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:38:33,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-03 01:38:33,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-03 01:38:33,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595346731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:33,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341915074] [2022-11-03 01:38:33,468 INFO L159 IcfgInterpreter]: Started Sifa with 130 locations of interest [2022-11-03 01:38:33,469 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:38:33,469 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:38:33,470 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:38:33,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:38:38,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:38:38,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 01:38:54,995 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: not yet implemented, we need term in nnf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PrenexNormalForm.convertApplicationTerm(PrenexNormalForm.java:89) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:85) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:71) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:38:54,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:55,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 01:38:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617459420] [2022-11-03 01:38:55,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:55,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:38:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:38:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:38:55,003 INFO L87 Difference]: Start difference. First operand 7163 states and 10250 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2022-11-03 01:38:59,208 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-03 01:39:01,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:39:03,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:39:04,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:39:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:04,754 INFO L93 Difference]: Finished difference Result 14433 states and 20703 transitions. [2022-11-03 01:39:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:39:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 166 [2022-11-03 01:39:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:04,779 INFO L225 Difference]: With dead ends: 14433 [2022-11-03 01:39:04,779 INFO L226 Difference]: Without dead ends: 7271 [2022-11-03 01:39:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:04,797 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 4 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2384 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 456 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-11-03 01:39:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2022-11-03 01:39:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7271. [2022-11-03 01:39:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7271 states, 4610 states have (on average 1.306941431670282) internal successors, (6025), 4757 states have internal predecessors, (6025), 2075 states have call successors, (2075), 586 states have call predecessors, (2075), 585 states have return successors, (2294), 1987 states have call predecessors, (2294), 2068 states have call successors, (2294) [2022-11-03 01:39:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7271 states to 7271 states and 10394 transitions. [2022-11-03 01:39:05,188 INFO L78 Accepts]: Start accepts. Automaton has 7271 states and 10394 transitions. Word has length 166 [2022-11-03 01:39:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:05,189 INFO L495 AbstractCegarLoop]: Abstraction has 7271 states and 10394 transitions. [2022-11-03 01:39:05,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2022-11-03 01:39:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7271 states and 10394 transitions. [2022-11-03 01:39:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-03 01:39:05,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:05,196 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:39:05,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 01:39:05,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:39:05,398 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1491631202, now seen corresponding path program 2 times [2022-11-03 01:39:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:05,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767360784] [2022-11-03 01:39:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-03 01:39:05,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:05,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767360784] [2022-11-03 01:39:05,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767360784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:05,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913852473] [2022-11-03 01:39:05,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:39:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:05,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:05,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:39:06,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:39:06,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:06,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:39:06,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-03 01:39:06,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913852473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:06,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:06,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2022-11-03 01:39:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677612992] [2022-11-03 01:39:06,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:06,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:06,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:39:06,764 INFO L87 Difference]: Start difference. First operand 7271 states and 10394 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-11-03 01:39:11,974 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-03 01:39:15,209 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-03 01:39:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:15,486 INFO L93 Difference]: Finished difference Result 7298 states and 10420 transitions. [2022-11-03 01:39:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:39:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2022-11-03 01:39:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:15,510 INFO L225 Difference]: With dead ends: 7298 [2022-11-03 01:39:15,510 INFO L226 Difference]: Without dead ends: 7295 [2022-11-03 01:39:15,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:39:15,515 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 15 mSDsluCounter, 3691 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3910 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3910 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 799 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-11-03 01:39:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2022-11-03 01:39:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 7295. [2022-11-03 01:39:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7295 states, 4628 states have (on average 1.3057476231633536) internal successors, (6043), 4769 states have internal predecessors, (6043), 2075 states have call successors, (2075), 598 states have call predecessors, (2075), 591 states have return successors, (2294), 1987 states have call predecessors, (2294), 2068 states have call successors, (2294) [2022-11-03 01:39:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 10412 transitions. [2022-11-03 01:39:16,023 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 10412 transitions. Word has length 181 [2022-11-03 01:39:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:16,024 INFO L495 AbstractCegarLoop]: Abstraction has 7295 states and 10412 transitions. [2022-11-03 01:39:16,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-11-03 01:39:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 10412 transitions. [2022-11-03 01:39:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-03 01:39:16,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:16,029 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:39:16,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:16,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:39:16,246 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1149427253, now seen corresponding path program 1 times [2022-11-03 01:39:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:16,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530415681] [2022-11-03 01:39:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-03 01:39:16,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:16,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530415681] [2022-11-03 01:39:16,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530415681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158762080] [2022-11-03 01:39:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:16,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:16,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:39:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:17,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 2538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:39:17,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-03 01:39:17,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:17,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158762080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:17,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:17,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 01:39:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477093039] [2022-11-03 01:39:17,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:17,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:39:17,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:39:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:17,768 INFO L87 Difference]: Start difference. First operand 7295 states and 10412 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:39:21,375 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-03 01:39:24,011 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-03 01:39:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:25,143 INFO L93 Difference]: Finished difference Result 17496 states and 25544 transitions. [2022-11-03 01:39:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:39:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2022-11-03 01:39:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:25,175 INFO L225 Difference]: With dead ends: 17496 [2022-11-03 01:39:25,175 INFO L226 Difference]: Without dead ends: 10202 [2022-11-03 01:39:25,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:25,191 INFO L413 NwaCegarLoop]: 1222 mSDtfsCounter, 277 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:25,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2110 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 350 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-11-03 01:39:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2022-11-03 01:39:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 7295. [2022-11-03 01:39:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7295 states, 4628 states have (on average 1.3031547104580812) internal successors, (6031), 4757 states have internal predecessors, (6031), 2075 states have call successors, (2075), 598 states have call predecessors, (2075), 591 states have return successors, (2294), 1987 states have call predecessors, (2294), 2068 states have call successors, (2294) [2022-11-03 01:39:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 10400 transitions. [2022-11-03 01:39:25,746 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 10400 transitions. Word has length 189 [2022-11-03 01:39:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:25,747 INFO L495 AbstractCegarLoop]: Abstraction has 7295 states and 10400 transitions. [2022-11-03 01:39:25,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:39:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 10400 transitions. [2022-11-03 01:39:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-03 01:39:25,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:25,753 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:39:25,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:25,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:39:25,970 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -490404673, now seen corresponding path program 1 times [2022-11-03 01:39:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:25,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779716134] [2022-11-03 01:39:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-11-03 01:39:26,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:26,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779716134] [2022-11-03 01:39:26,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779716134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:26,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129507197] [2022-11-03 01:39:26,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:26,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:26,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:26,485 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:26,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:39:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 2960 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:27,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-03 01:39:27,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-11-03 01:39:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129507197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1252466963] [2022-11-03 01:39:27,910 INFO L159 IcfgInterpreter]: Started Sifa with 135 locations of interest [2022-11-03 01:39:27,910 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:39:27,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:39:27,911 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:39:27,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:39:33,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 01:39:33,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:39:38,077 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: not yet implemented, we need term in nnf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PrenexNormalForm.convertApplicationTerm(PrenexNormalForm.java:89) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:85) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:71) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:39:38,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:39:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 01:39:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219757940] [2022-11-03 01:39:38,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:38,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:39:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:39:38,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:38,082 INFO L87 Difference]: Start difference. First operand 7295 states and 10400 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2022-11-03 01:39:41,726 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-03 01:39:43,525 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-03 01:39:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:39:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:45,782 INFO L93 Difference]: Finished difference Result 14697 states and 21027 transitions. [2022-11-03 01:39:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:39:45,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 194 [2022-11-03 01:39:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:45,803 INFO L225 Difference]: With dead ends: 14697 [2022-11-03 01:39:45,803 INFO L226 Difference]: Without dead ends: 7403 [2022-11-03 01:39:45,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:45,823 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 6 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:45,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1592 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 307 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-11-03 01:39:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2022-11-03 01:39:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 7403. [2022-11-03 01:39:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7403 states, 4700 states have (on average 1.2985106382978724) internal successors, (6103), 4829 states have internal predecessors, (6103), 2111 states have call successors, (2111), 598 states have call predecessors, (2111), 591 states have return successors, (2330), 2023 states have call predecessors, (2330), 2104 states have call successors, (2330) [2022-11-03 01:39:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7403 states to 7403 states and 10544 transitions. [2022-11-03 01:39:46,205 INFO L78 Accepts]: Start accepts. Automaton has 7403 states and 10544 transitions. Word has length 194 [2022-11-03 01:39:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:46,207 INFO L495 AbstractCegarLoop]: Abstraction has 7403 states and 10544 transitions. [2022-11-03 01:39:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 5 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2022-11-03 01:39:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7403 states and 10544 transitions. [2022-11-03 01:39:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-11-03 01:39:46,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:46,213 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-03 01:39:46,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:46,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:46,426 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1871530921, now seen corresponding path program 1 times [2022-11-03 01:39:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:46,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142070925] [2022-11-03 01:39:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-03 01:39:46,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142070925] [2022-11-03 01:39:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142070925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145037560] [2022-11-03 01:39:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:46,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:46,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:46,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:39:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:48,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 2905 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:39:48,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-03 01:39:48,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-03 01:39:48,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145037560] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:48,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864246005] [2022-11-03 01:39:48,241 INFO L159 IcfgInterpreter]: Started Sifa with 135 locations of interest [2022-11-03 01:39:48,241 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:39:48,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:39:48,242 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:39:48,242 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:39:53,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 01:39:53,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:39:58,548 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: not yet implemented, we need term in nnf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PrenexNormalForm.convertApplicationTerm(PrenexNormalForm.java:89) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:85) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:71) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:39:58,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:39:58,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 01:39:58,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577080480] [2022-11-03 01:39:58,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:58,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:39:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:39:58,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:58,553 INFO L87 Difference]: Start difference. First operand 7403 states and 10544 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-03 01:40:01,684 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-03 01:40:04,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:05,221 INFO L93 Difference]: Finished difference Result 14841 states and 21191 transitions. [2022-11-03 01:40:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:40:05,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 191 [2022-11-03 01:40:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:05,241 INFO L225 Difference]: With dead ends: 14841 [2022-11-03 01:40:05,241 INFO L226 Difference]: Without dead ends: 7439 [2022-11-03 01:40:05,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:40:05,258 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 0 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:05,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-11-03 01:40:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7439 states. [2022-11-03 01:40:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7439 to 7439. [2022-11-03 01:40:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7439 states, 4736 states have (on average 1.296241554054054) internal successors, (6139), 4865 states have internal predecessors, (6139), 2111 states have call successors, (2111), 598 states have call predecessors, (2111), 591 states have return successors, (2330), 2023 states have call predecessors, (2330), 2104 states have call successors, (2330) [2022-11-03 01:40:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 10580 transitions. [2022-11-03 01:40:05,634 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 10580 transitions. Word has length 191 [2022-11-03 01:40:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:05,634 INFO L495 AbstractCegarLoop]: Abstraction has 7439 states and 10580 transitions. [2022-11-03 01:40:05,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-03 01:40:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 10580 transitions. [2022-11-03 01:40:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-03 01:40:05,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:05,641 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-03 01:40:05,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:40:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:05,862 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:40:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 692416804, now seen corresponding path program 2 times [2022-11-03 01:40:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:05,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603294995] [2022-11-03 01:40:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-03 01:40:06,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603294995] [2022-11-03 01:40:06,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603294995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859427566] [2022-11-03 01:40:06,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:40:06,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:06,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:06,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:06,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:40:07,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:40:07,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:40:07,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:40:07,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-03 01:40:07,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:40:07,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859427566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:07,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:40:07,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-03 01:40:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665741907] [2022-11-03 01:40:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:40:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:40:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:40:07,399 INFO L87 Difference]: Start difference. First operand 7439 states and 10580 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-03 01:40:11,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:14,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:15,970 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-03 01:40:17,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:20,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:22,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:22,570 INFO L93 Difference]: Finished difference Result 9874 states and 14461 transitions. [2022-11-03 01:40:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:40:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 194 [2022-11-03 01:40:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:22,599 INFO L225 Difference]: With dead ends: 9874 [2022-11-03 01:40:22,599 INFO L226 Difference]: Without dead ends: 9847 [2022-11-03 01:40:22,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:40:22,605 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 381 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:22,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3064 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 477 Invalid, 2 Unknown, 0 Unchecked, 14.7s Time] [2022-11-03 01:40:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9847 states. [2022-11-03 01:40:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9847 to 7439. [2022-11-03 01:40:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7439 states, 4736 states have (on average 1.2939189189189189) internal successors, (6128), 4865 states have internal predecessors, (6128), 2111 states have call successors, (2111), 598 states have call predecessors, (2111), 591 states have return successors, (2330), 2023 states have call predecessors, (2330), 2104 states have call successors, (2330) [2022-11-03 01:40:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 10569 transitions. [2022-11-03 01:40:23,007 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 10569 transitions. Word has length 194 [2022-11-03 01:40:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:23,008 INFO L495 AbstractCegarLoop]: Abstraction has 7439 states and 10569 transitions. [2022-11-03 01:40:23,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-03 01:40:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 10569 transitions. [2022-11-03 01:40:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-03 01:40:23,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:23,013 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:40:23,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:40:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 01:40:23,230 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:40:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash 418488742, now seen corresponding path program 1 times [2022-11-03 01:40:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997685981] [2022-11-03 01:40:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-11-03 01:40:23,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997685981] [2022-11-03 01:40:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997685981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010591864] [2022-11-03 01:40:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:40:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:23,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:40:23,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:40:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:25,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 3127 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:40:25,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-03 01:40:25,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-11-03 01:40:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010591864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:40:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1534789669] [2022-11-03 01:40:25,272 INFO L159 IcfgInterpreter]: Started Sifa with 127 locations of interest [2022-11-03 01:40:25,273 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:40:25,273 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:40:25,273 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:40:25,274 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:40:30,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 01:40:30,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:40:35,934 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: not yet implemented, we need term in nnf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PrenexNormalForm.convertApplicationTerm(PrenexNormalForm.java:89) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:85) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:71) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:40:35,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:40:35,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 01:40:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814038468] [2022-11-03 01:40:35,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:40:35,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:40:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:40:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:40:35,938 INFO L87 Difference]: Start difference. First operand 7439 states and 10569 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-11-03 01:40:41,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:44,606 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-03 01:40:46,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:48,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:48,935 INFO L93 Difference]: Finished difference Result 15093 states and 21457 transitions. [2022-11-03 01:40:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:40:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 201 [2022-11-03 01:40:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:48,959 INFO L225 Difference]: With dead ends: 15093 [2022-11-03 01:40:48,959 INFO L226 Difference]: Without dead ends: 7655 [2022-11-03 01:40:48,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:40:48,978 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 8 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:48,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3180 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 595 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2022-11-03 01:40:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7655 states. [2022-11-03 01:40:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7655 to 7655. [2022-11-03 01:40:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7655 states, 4952 states have (on average 1.2883683360258482) internal successors, (6380), 5081 states have internal predecessors, (6380), 2111 states have call successors, (2111), 598 states have call predecessors, (2111), 591 states have return successors, (2330), 2023 states have call predecessors, (2330), 2104 states have call successors, (2330) [2022-11-03 01:40:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 10821 transitions. [2022-11-03 01:40:49,477 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 10821 transitions. Word has length 201 [2022-11-03 01:40:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:49,477 INFO L495 AbstractCegarLoop]: Abstraction has 7655 states and 10821 transitions. [2022-11-03 01:40:49,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-11-03 01:40:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 10821 transitions. [2022-11-03 01:40:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-03 01:40:49,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:49,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:40:49,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:40:49,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 01:40:49,710 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:40:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash 249110662, now seen corresponding path program 2 times [2022-11-03 01:40:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:49,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096094271] [2022-11-03 01:40:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-11-03 01:40:50,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:50,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096094271] [2022-11-03 01:40:50,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096094271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:50,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:50,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:40:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572844853] [2022-11-03 01:40:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:50,308 INFO L87 Difference]: Start difference. First operand 7655 states and 10821 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-03 01:40:53,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:56,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:40:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:57,158 INFO L93 Difference]: Finished difference Result 10145 states and 14381 transitions. [2022-11-03 01:40:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 209 [2022-11-03 01:40:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:57,198 INFO L225 Difference]: With dead ends: 10145 [2022-11-03 01:40:57,198 INFO L226 Difference]: Without dead ends: 10140 [2022-11-03 01:40:57,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:57,207 INFO L413 NwaCegarLoop]: 1102 mSDtfsCounter, 835 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:57,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1886 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-11-03 01:40:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10140 states. [2022-11-03 01:40:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10140 to 10115. [2022-11-03 01:40:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10115 states, 6538 states have (on average 1.2887733251758948) internal successors, (8426), 6710 states have internal predecessors, (8426), 2797 states have call successors, (2797), 790 states have call predecessors, (2797), 779 states have return successors, (3123), 2678 states have call predecessors, (3123), 2790 states have call successors, (3123) [2022-11-03 01:40:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10115 states to 10115 states and 14346 transitions. [2022-11-03 01:40:57,881 INFO L78 Accepts]: Start accepts. Automaton has 10115 states and 14346 transitions. Word has length 209 [2022-11-03 01:40:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 10115 states and 14346 transitions. [2022-11-03 01:40:57,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-03 01:40:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10115 states and 14346 transitions. [2022-11-03 01:40:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-03 01:40:57,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:57,885 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:40:57,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:40:57,885 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:40:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1697636904, now seen corresponding path program 1 times [2022-11-03 01:40:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903133229] [2022-11-03 01:40:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-03 01:41:03,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903133229] [2022-11-03 01:41:03,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903133229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:03,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:03,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:41:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565950558] [2022-11-03 01:41:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:03,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:41:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:41:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:41:03,758 INFO L87 Difference]: Start difference. First operand 10115 states and 14346 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-03 01:41:08,924 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-03 01:41:13,173 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-03 01:41:14,679 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-03 01:41:16,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:18,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:20,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:22,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:24,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:26,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:29,300 INFO L93 Difference]: Finished difference Result 14925 states and 21202 transitions. [2022-11-03 01:41:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:41:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) Word has length 226 [2022-11-03 01:41:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:29,346 INFO L225 Difference]: With dead ends: 14925 [2022-11-03 01:41:29,347 INFO L226 Difference]: Without dead ends: 14917 [2022-11-03 01:41:29,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:41:29,356 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 1312 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 1039 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:29,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 2043 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 1928 Invalid, 5 Unknown, 0 Unchecked, 24.5s Time] [2022-11-03 01:41:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2022-11-03 01:41:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 14854. [2022-11-03 01:41:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14854 states, 9596 states have (on average 1.2897040433513964) internal successors, (12376), 9861 states have internal predecessors, (12376), 4119 states have call successors, (4119), 1162 states have call predecessors, (4119), 1138 states have return successors, (4608), 3926 states have call predecessors, (4608), 4112 states have call successors, (4608) [2022-11-03 01:41:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14854 states to 14854 states and 21103 transitions. [2022-11-03 01:41:30,361 INFO L78 Accepts]: Start accepts. Automaton has 14854 states and 21103 transitions. Word has length 226 [2022-11-03 01:41:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:30,361 INFO L495 AbstractCegarLoop]: Abstraction has 14854 states and 21103 transitions. [2022-11-03 01:41:30,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (35), 4 states have call predecessors, (35), 3 states have call successors, (35) [2022-11-03 01:41:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14854 states and 21103 transitions. [2022-11-03 01:41:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-03 01:41:30,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:30,365 INFO L195 NwaCegarLoop]: trace histogram [16, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:41:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 01:41:30,365 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1793268417, now seen corresponding path program 2 times [2022-11-03 01:41:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:30,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906671599] [2022-11-03 01:41:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-11-03 01:41:39,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:39,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906671599] [2022-11-03 01:41:39,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906671599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:39,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:39,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:41:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229751081] [2022-11-03 01:41:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:39,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:41:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:41:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:41:39,199 INFO L87 Difference]: Start difference. First operand 14854 states and 21103 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:41:42,889 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-03 01:41:46,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:41:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:47,070 INFO L93 Difference]: Finished difference Result 29731 states and 42253 transitions. [2022-11-03 01:41:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:41:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 219 [2022-11-03 01:41:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:47,128 INFO L225 Difference]: With dead ends: 29731 [2022-11-03 01:41:47,128 INFO L226 Difference]: Without dead ends: 14878 [2022-11-03 01:41:47,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:41:47,169 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 0 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:47,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1589 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 01:41:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14878 states. [2022-11-03 01:41:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14878 to 14878. [2022-11-03 01:41:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14878 states, 9620 states have (on average 1.288981288981289) internal successors, (12400), 9885 states have internal predecessors, (12400), 4119 states have call successors, (4119), 1162 states have call predecessors, (4119), 1138 states have return successors, (4608), 3926 states have call predecessors, (4608), 4112 states have call successors, (4608) [2022-11-03 01:41:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14878 states to 14878 states and 21127 transitions. [2022-11-03 01:41:48,151 INFO L78 Accepts]: Start accepts. Automaton has 14878 states and 21127 transitions. Word has length 219 [2022-11-03 01:41:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:48,152 INFO L495 AbstractCegarLoop]: Abstraction has 14878 states and 21127 transitions. [2022-11-03 01:41:48,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-03 01:41:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14878 states and 21127 transitions. [2022-11-03 01:41:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-03 01:41:48,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:48,157 INFO L195 NwaCegarLoop]: trace histogram [16, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:41:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 01:41:48,157 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 821347647, now seen corresponding path program 1 times [2022-11-03 01:41:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:48,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789900089] [2022-11-03 01:41:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-11-03 01:41:55,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:55,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789900089] [2022-11-03 01:41:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789900089] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648546215] [2022-11-03 01:41:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:55,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:55,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:41:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:57,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 3766 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:41:57,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-11-03 01:41:57,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:41:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648546215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:57,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:41:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2022-11-03 01:41:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772946825] [2022-11-03 01:41:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:57,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:41:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:41:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:41:57,267 INFO L87 Difference]: Start difference. First operand 14878 states and 21127 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-03 01:42:05,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:08,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:10,176 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-03 01:42:11,589 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-03 01:42:13,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:15,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:17,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:19,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:24,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:26,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:28,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:30,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:32,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:33,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:35,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:37,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:39,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:41,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:43,629 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-03 01:42:45,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:47,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:42:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:42:49,182 INFO L93 Difference]: Finished difference Result 45953 states and 70664 transitions. [2022-11-03 01:42:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:42:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 220 [2022-11-03 01:42:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:42:49,298 INFO L225 Difference]: With dead ends: 45953 [2022-11-03 01:42:49,298 INFO L226 Difference]: Without dead ends: 31076 [2022-11-03 01:42:49,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:42:49,345 INFO L413 NwaCegarLoop]: 1296 mSDtfsCounter, 1942 mSDsluCounter, 11156 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 937 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 10813 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:42:49,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 10813 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [937 Valid, 1985 Invalid, 12 Unknown, 0 Unchecked, 48.0s Time] [2022-11-03 01:42:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31076 states. [2022-11-03 01:42:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31076 to 12577. [2022-11-03 01:42:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12577 states, 8183 states have (on average 1.2653061224489797) internal successors, (10354), 8394 states have internal predecessors, (10354), 3300 states have call successors, (3300), 1099 states have call predecessors, (3300), 1093 states have return successors, (3950), 3164 states have call predecessors, (3950), 3293 states have call successors, (3950) [2022-11-03 01:42:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 17604 transitions. [2022-11-03 01:42:50,915 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 17604 transitions. Word has length 220 [2022-11-03 01:42:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:42:50,916 INFO L495 AbstractCegarLoop]: Abstraction has 12577 states and 17604 transitions. [2022-11-03 01:42:50,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-03 01:42:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 17604 transitions. [2022-11-03 01:42:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-11-03 01:42:50,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:42:50,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:42:50,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:42:51,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c34260-8084-46fe-b01e-7da4608469f8/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:51,122 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:42:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:42:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash -866412915, now seen corresponding path program 1 times [2022-11-03 01:42:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:42:51,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514684606] [2022-11-03 01:42:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:42:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-03 01:42:54,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:42:54,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514684606] [2022-11-03 01:42:54,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514684606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:42:54,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:42:54,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:42:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976024519] [2022-11-03 01:42:54,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:42:54,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:42:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:42:54,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:42:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:42:54,715 INFO L87 Difference]: Start difference. First operand 12577 states and 17604 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 4 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-11-03 01:42:59,011 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-03 01:43:02,785 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-03 01:43:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:04,809 INFO L93 Difference]: Finished difference Result 17271 states and 24014 transitions. [2022-11-03 01:43:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:43:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 4 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 240 [2022-11-03 01:43:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:04,866 INFO L225 Difference]: With dead ends: 17271 [2022-11-03 01:43:04,866 INFO L226 Difference]: Without dead ends: 17260 [2022-11-03 01:43:04,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:43:04,876 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 943 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 492 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:04,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1586 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1362 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2022-11-03 01:43:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17260 states. [2022-11-03 01:43:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17260 to 15993. [2022-11-03 01:43:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15993 states, 10328 states have (on average 1.2607474825716498) internal successors, (13021), 10614 states have internal predecessors, (13021), 4209 states have call successors, (4209), 1467 states have call predecessors, (4209), 1455 states have return successors, (5039), 4019 states have call predecessors, (5039), 4202 states have call successors, (5039) [2022-11-03 01:43:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15993 states to 15993 states and 22269 transitions. [2022-11-03 01:43:06,357 INFO L78 Accepts]: Start accepts. Automaton has 15993 states and 22269 transitions. Word has length 240 [2022-11-03 01:43:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:06,358 INFO L495 AbstractCegarLoop]: Abstraction has 15993 states and 22269 transitions. [2022-11-03 01:43:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 4 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-11-03 01:43:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15993 states and 22269 transitions. [2022-11-03 01:43:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-11-03 01:43:06,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:06,364 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:43:06,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 01:43:06,364 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:06,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 78399180, now seen corresponding path program 1 times [2022-11-03 01:43:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:06,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486255093] [2022-11-03 01:43:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-11-03 01:43:07,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:07,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486255093] [2022-11-03 01:43:07,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486255093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:07,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:43:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014507019] [2022-11-03 01:43:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:07,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:07,214 INFO L87 Difference]: Start difference. First operand 15993 states and 22269 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:10,170 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-03 01:43:12,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:43:14,526 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-03 01:43:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:17,144 INFO L93 Difference]: Finished difference Result 20192 states and 28165 transitions. [2022-11-03 01:43:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 242 [2022-11-03 01:43:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:17,213 INFO L225 Difference]: With dead ends: 20192 [2022-11-03 01:43:17,213 INFO L226 Difference]: Without dead ends: 20188 [2022-11-03 01:43:17,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:17,224 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 814 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:17,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1784 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-11-03 01:43:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20188 states. [2022-11-03 01:43:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20188 to 20049. [2022-11-03 01:43:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20049 states, 12925 states have (on average 1.2615860735009672) internal successors, (16306), 13313 states have internal predecessors, (16306), 5303 states have call successors, (5303), 1842 states have call predecessors, (5303), 1820 states have return successors, (6364), 5030 states have call predecessors, (6364), 5296 states have call successors, (6364) [2022-11-03 01:43:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20049 states to 20049 states and 27973 transitions. [2022-11-03 01:43:19,063 INFO L78 Accepts]: Start accepts. Automaton has 20049 states and 27973 transitions. Word has length 242 [2022-11-03 01:43:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 20049 states and 27973 transitions. [2022-11-03 01:43:19,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20049 states and 27973 transitions. [2022-11-03 01:43:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-11-03 01:43:19,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:19,071 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:43:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 01:43:19,071 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1980396842, now seen corresponding path program 1 times [2022-11-03 01:43:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66306867] [2022-11-03 01:43:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-03 01:43:19,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66306867] [2022-11-03 01:43:19,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66306867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:19,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:19,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:43:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53579402] [2022-11-03 01:43:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:19,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:19,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:19,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:19,423 INFO L87 Difference]: Start difference. First operand 20049 states and 27973 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:22,282 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-03 01:43:24,790 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-03 01:43:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:28,779 INFO L93 Difference]: Finished difference Result 33643 states and 46799 transitions. [2022-11-03 01:43:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 242 [2022-11-03 01:43:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:28,874 INFO L225 Difference]: With dead ends: 33643 [2022-11-03 01:43:28,875 INFO L226 Difference]: Without dead ends: 33640 [2022-11-03 01:43:28,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:28,887 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 838 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:28,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1779 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-11-03 01:43:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33640 states. [2022-11-03 01:43:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33640 to 33626. [2022-11-03 01:43:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33626 states, 21544 states have (on average 1.2601652432231711) internal successors, (27149), 22222 states have internal predecessors, (27149), 8931 states have call successors, (8931), 3192 states have call predecessors, (8931), 3150 states have return successors, (10638), 8448 states have call predecessors, (10638), 8924 states have call successors, (10638) [2022-11-03 01:43:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33626 states to 33626 states and 46718 transitions. [2022-11-03 01:43:32,033 INFO L78 Accepts]: Start accepts. Automaton has 33626 states and 46718 transitions. Word has length 242 [2022-11-03 01:43:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:32,034 INFO L495 AbstractCegarLoop]: Abstraction has 33626 states and 46718 transitions. [2022-11-03 01:43:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 33626 states and 46718 transitions. [2022-11-03 01:43:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-03 01:43:32,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:32,041 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:43:32,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 01:43:32,041 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1263161223, now seen corresponding path program 1 times [2022-11-03 01:43:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:32,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959874312] [2022-11-03 01:43:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-03 01:43:32,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:32,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959874312] [2022-11-03 01:43:32,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959874312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:32,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:32,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:43:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659208919] [2022-11-03 01:43:32,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:32,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:32,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:32,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:32,474 INFO L87 Difference]: Start difference. First operand 33626 states and 46718 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:35,329 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-03 01:43:37,772 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-03 01:43:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:41,999 INFO L93 Difference]: Finished difference Result 33637 states and 46728 transitions. [2022-11-03 01:43:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:41,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 243 [2022-11-03 01:43:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:42,104 INFO L225 Difference]: With dead ends: 33637 [2022-11-03 01:43:42,104 INFO L226 Difference]: Without dead ends: 33628 [2022-11-03 01:43:42,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:42,119 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 835 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:42,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1782 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-11-03 01:43:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33628 states. [2022-11-03 01:43:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33628 to 33618. [2022-11-03 01:43:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33618 states, 21536 states have (on average 1.2577080237741456) internal successors, (27086), 22214 states have internal predecessors, (27086), 8931 states have call successors, (8931), 3192 states have call predecessors, (8931), 3150 states have return successors, (10638), 8448 states have call predecessors, (10638), 8924 states have call successors, (10638) [2022-11-03 01:43:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33618 states to 33618 states and 46655 transitions. [2022-11-03 01:43:45,369 INFO L78 Accepts]: Start accepts. Automaton has 33618 states and 46655 transitions. Word has length 243 [2022-11-03 01:43:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:45,370 INFO L495 AbstractCegarLoop]: Abstraction has 33618 states and 46655 transitions. [2022-11-03 01:43:45,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-11-03 01:43:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33618 states and 46655 transitions. [2022-11-03 01:43:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-03 01:43:45,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:45,375 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:43:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 01:43:45,376 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1244047875, now seen corresponding path program 1 times [2022-11-03 01:43:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113264220] [2022-11-03 01:43:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-11-03 01:43:45,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:45,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113264220] [2022-11-03 01:43:45,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113264220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:45,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:45,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:43:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342107170] [2022-11-03 01:43:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:45,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:43:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:43:45,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:43:45,815 INFO L87 Difference]: Start difference. First operand 33618 states and 46655 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-03 01:43:50,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:43:53,163 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-03 01:44:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:00,512 INFO L93 Difference]: Finished difference Result 78648 states and 111982 transitions. [2022-11-03 01:44:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) Word has length 259 [2022-11-03 01:44:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:00,663 INFO L225 Difference]: With dead ends: 78648 [2022-11-03 01:44:00,664 INFO L226 Difference]: Without dead ends: 45031 [2022-11-03 01:44:00,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:44:00,761 INFO L413 NwaCegarLoop]: 1224 mSDtfsCounter, 273 mSDsluCounter, 3881 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:00,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 4553 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 789 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-11-03 01:44:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45031 states. [2022-11-03 01:44:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45031 to 33577. [2022-11-03 01:44:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33577 states, 21564 states have (on average 1.2556112038582823) internal successors, (27076), 22178 states have internal predecessors, (27076), 8868 states have call successors, (8868), 3173 states have call predecessors, (8868), 3144 states have return successors, (10555), 8462 states have call predecessors, (10555), 8861 states have call successors, (10555) [2022-11-03 01:44:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33577 states to 33577 states and 46499 transitions. [2022-11-03 01:44:04,976 INFO L78 Accepts]: Start accepts. Automaton has 33577 states and 46499 transitions. Word has length 259 [2022-11-03 01:44:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:04,977 INFO L495 AbstractCegarLoop]: Abstraction has 33577 states and 46499 transitions. [2022-11-03 01:44:04,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (38), 3 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-03 01:44:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33577 states and 46499 transitions. [2022-11-03 01:44:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-11-03 01:44:04,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:04,987 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:44:04,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 01:44:04,987 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:44:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -627646807, now seen corresponding path program 1 times [2022-11-03 01:44:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:04,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941203342] [2022-11-03 01:44:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-11-03 01:44:05,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941203342] [2022-11-03 01:44:05,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941203342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:05,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:05,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:44:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322926222] [2022-11-03 01:44:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:05,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:44:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:44:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:44:05,534 INFO L87 Difference]: Start difference. First operand 33577 states and 46499 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2022-11-03 01:44:10,444 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-03 01:44:13,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 01:44:14,132 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-03 01:44:16,910 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-03 01:44:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:23,373 INFO L93 Difference]: Finished difference Result 74445 states and 106199 transitions. [2022-11-03 01:44:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) Word has length 251 [2022-11-03 01:44:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:23,663 INFO L225 Difference]: With dead ends: 74445 [2022-11-03 01:44:23,663 INFO L226 Difference]: Without dead ends: 44161 [2022-11-03 01:44:23,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:44:23,741 INFO L413 NwaCegarLoop]: 1227 mSDtfsCounter, 302 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 4558 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:23,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 4558 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 802 Invalid, 2 Unknown, 0 Unchecked, 12.8s Time] [2022-11-03 01:44:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44161 states. [2022-11-03 01:44:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44161 to 33438. [2022-11-03 01:44:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33438 states, 21476 states have (on average 1.255308251070963) internal successors, (26959), 22086 states have internal predecessors, (26959), 8822 states have call successors, (8822), 3166 states have call predecessors, (8822), 3139 states have return successors, (10505), 8422 states have call predecessors, (10505), 8815 states have call successors, (10505) [2022-11-03 01:44:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33438 states to 33438 states and 46286 transitions. [2022-11-03 01:44:27,677 INFO L78 Accepts]: Start accepts. Automaton has 33438 states and 46286 transitions. Word has length 251 [2022-11-03 01:44:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:27,677 INFO L495 AbstractCegarLoop]: Abstraction has 33438 states and 46286 transitions. [2022-11-03 01:44:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2022-11-03 01:44:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33438 states and 46286 transitions. [2022-11-03 01:44:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-03 01:44:27,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:27,685 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 01:44:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 01:44:27,685 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:44:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash 443299718, now seen corresponding path program 1 times [2022-11-03 01:44:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581357704] [2022-11-03 01:44:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-03 01:44:28,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:28,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581357704] [2022-11-03 01:44:28,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581357704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:28,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:28,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:44:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002363221] [2022-11-03 01:44:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:28,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:44:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:44:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:44:28,141 INFO L87 Difference]: Start difference. First operand 33438 states and 46286 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (40), 4 states have call predecessors, (40), 3 states have call successors, (40) [2022-11-03 01:44:33,847 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-03 01:44:36,700 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-03 01:44:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:44,716 INFO L93 Difference]: Finished difference Result 78003 states and 110915 transitions. [2022-11-03 01:44:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:44:44,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (40), 4 states have call predecessors, (40), 3 states have call successors, (40) Word has length 271 [2022-11-03 01:44:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:44,856 INFO L225 Difference]: With dead ends: 78003 [2022-11-03 01:44:44,856 INFO L226 Difference]: Without dead ends: 44566 [2022-11-03 01:44:44,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:44:44,942 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 279 mSDsluCounter, 5324 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 5808 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:44,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 5808 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1021 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-11-03 01:44:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44566 states.