./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/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_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/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_4c021349-9020-401b-89b1-b2d37fbdaa51/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 c8ebe8fd9a8e0d537f351c5a7c305717ff0a45de7ead6b00d56cae7f5bf422b2 --- 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 03:42:45,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:42:45,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:42:45,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:42:45,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:42:45,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:42:45,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:42:45,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:42:45,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:42:45,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:42:45,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:42:45,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:42:45,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:42:45,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:42:45,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:42:45,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:42:45,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:42:45,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:42:45,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:42:45,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:42:45,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:42:45,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:42:45,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:42:45,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:42:45,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:42:45,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:42:45,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:42:45,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:42:45,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:42:45,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:42:45,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:42:45,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:42:45,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:42:45,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:42:45,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:42:45,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:42:45,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:42:45,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:42:45,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:42:45,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:42:45,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:42:45,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-03 03:42:45,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:42:45,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:42:45,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:42:45,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:42:45,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:42:45,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:42:45,478 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:42:45,479 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:42:45,479 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:42:45,479 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:42:45,479 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:42:45,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:42:45,483 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:42:45,483 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:42:45,483 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:42:45,484 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:42:45,484 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:42:45,484 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:42:45,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:42:45,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:42:45,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:42:45,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:42:45,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:42:45,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:42:45,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:42:45,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:42:45,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:42:45,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:42:45,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:42:45,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:42:45,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:42:45,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:42:45,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:42:45,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:42:45,493 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:42:45,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:42:45,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:42:45,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:42:45,495 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_4c021349-9020-401b-89b1-b2d37fbdaa51/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_4c021349-9020-401b-89b1-b2d37fbdaa51/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 -> c8ebe8fd9a8e0d537f351c5a7c305717ff0a45de7ead6b00d56cae7f5bf422b2 [2022-11-03 03:42:45,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:42:45,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:42:45,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:42:45,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:42:45,886 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:42:45,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2022-11-03 03:42:45,977 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/data/a4a533fee/3fbc9efacd9744b49fd163f79646b9ff/FLAG9cb721822 [2022-11-03 03:42:47,885 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:42:47,886 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2022-11-03 03:42:48,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/data/a4a533fee/3fbc9efacd9744b49fd163f79646b9ff/FLAG9cb721822 [2022-11-03 03:42:48,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/data/a4a533fee/3fbc9efacd9744b49fd163f79646b9ff [2022-11-03 03:42:48,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:42:48,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:42:48,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:42:48,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:42:48,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:42:48,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:42:48" (1/1) ... [2022-11-03 03:42:48,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f10cf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:42:48, skipping insertion in model container [2022-11-03 03:42:48,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:42:48" (1/1) ... [2022-11-03 03:42:48,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:42:48,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:43:06,251 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_4c021349-9020-401b-89b1-b2d37fbdaa51/sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i[1057113,1057126] [2022-11-03 03:43:07,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:07,152 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:43:08,729 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_4c021349-9020-401b-89b1-b2d37fbdaa51/sv-benchmarks/c/ldv-linux-3.7.3/main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i[1057113,1057126] [2022-11-03 03:43:08,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:10,295 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:43:10,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10 WrapperNode [2022-11-03 03:43:10,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:10,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:10,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:43:10,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:43:10,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:10,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,357 INFO L138 Inliner]: procedures = 1364, calls = 15139, calls flagged for inlining = 461, calls inlined = 24, statements flattened = 6423 [2022-11-03 03:43:11,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:11,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:43:11,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:43:11,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:43:11,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,754 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:43:11,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:43:11,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:43:11,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:43:11,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (1/1) ... [2022-11-03 03:43:11,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:11,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:11,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:43:11,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c021349-9020-401b-89b1-b2d37fbdaa51/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:43:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure device_lock___5 [2022-11-03 03:43:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure device_lock___5 [2022-11-03 03:43:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_usb_bus_list_lock [2022-11-03 03:43:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_usb_bus_list_lock [2022-11-03 03:43:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-11-03 03:43:11,942 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-11-03 03:43:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure usb_device_poll [2022-11-03 03:43:11,942 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_device_poll [2022-11-03 03:43:11,943 INFO L130 BoogieDeclarations]: Found specification of procedure device_unlock___5 [2022-11-03 03:43:11,943 INFO L138 BoogieDeclarations]: Found implementation of procedure device_unlock___5 [2022-11-03 03:43:11,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2022-11-03 03:43:11,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2022-11-03 03:43:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:43:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-03 03:43:11,944 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-03 03:43:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hub_find_child [2022-11-03 03:43:11,944 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hub_find_child [2022-11-03 03:43:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:43:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:43:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:43:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-03 03:43:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex [2022-11-03 03:43:11,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex [2022-11-03 03:43:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:43:11,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:43:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-03 03:43:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-03 03:43:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-03 03:43:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-03 03:43:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-11-03 03:43:11,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-11-03 03:43:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:43:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:43:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure hdev_to_hub [2022-11-03 03:43:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure hdev_to_hub [2022-11-03 03:43:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure __get_free_pages [2022-11-03 03:43:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __get_free_pages [2022-11-03 03:43:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:43:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-03 03:43:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-03 03:43:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-03 03:43:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-03 03:43:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-03 03:43:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-03 03:43:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:43:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_bus_list_lock [2022-11-03 03:43:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_bus_list_lock [2022-11-03 03:43:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex [2022-11-03 03:43:11,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex [2022-11-03 03:43:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure usb_device_dump [2022-11-03 03:43:11,952 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_device_dump [2022-11-03 03:43:11,953 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-03 03:43:11,953 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-03 03:43:11,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-03 03:43:11,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex [2022-11-03 03:43:11,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex [2022-11-03 03:43:11,954 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-11-03 03:43:11,954 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-11-03 03:43:11,954 INFO L130 BoogieDeclarations]: Found specification of procedure class_decode [2022-11-03 03:43:11,955 INFO L138 BoogieDeclarations]: Found implementation of procedure class_decode [2022-11-03 03:43:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-11-03 03:43:11,955 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-11-03 03:43:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-03 03:43:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-03 03:43:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_type [2022-11-03 03:43:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_type [2022-11-03 03:43:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 03:43:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 03:43:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-11-03 03:43:11,957 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-11-03 03:43:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure bus_to_hcd [2022-11-03 03:43:11,957 INFO L138 BoogieDeclarations]: Found implementation of procedure bus_to_hcd [2022-11-03 03:43:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex [2022-11-03 03:43:11,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex [2022-11-03 03:43:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 03:43:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-03 03:43:11,958 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-03 03:43:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-11-03 03:43:11,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-11-03 03:43:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure free_pages [2022-11-03 03:43:11,959 INFO L138 BoogieDeclarations]: Found implementation of procedure free_pages [2022-11-03 03:43:11,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:43:11,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-03 03:43:11,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-03 03:43:12,856 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:43:12,861 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:47:53,238 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:47:54,924 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:47:54,924 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:47:54,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:54 BoogieIcfgContainer [2022-11-03 03:47:54,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:47:54,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:47:54,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:47:54,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:47:54,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:42:48" (1/3) ... [2022-11-03 03:47:54,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8472a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:54, skipping insertion in model container [2022-11-03 03:47:54,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:10" (2/3) ... [2022-11-03 03:47:54,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8472a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:54, skipping insertion in model container [2022-11-03 03:47:54,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:54" (3/3) ... [2022-11-03 03:47:54,941 INFO L112 eAbstractionObserver]: Analyzing ICFG main15_drivers-usb-core-usbcore-ko--32_7a--linux-3.7.3.i [2022-11-03 03:47:54,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:47:54,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:47:55,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:47:55,082 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;@45ca1e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:47:55,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:47:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 187 states have internal predecessors, (234), 67 states have call successors, (67), 35 states have call predecessors, (67), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-11-03 03:47:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:47:55,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:55,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:47:55,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 8244193, now seen corresponding path program 1 times [2022-11-03 03:47:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885672801] [2022-11-03 03:47:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:57,529 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 03:47:57,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885672801] [2022-11-03 03:47:57,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885672801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:57,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:57,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:47:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046962132] [2022-11-03 03:47:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:57,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:47:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:47:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:47:57,598 INFO L87 Difference]: Start difference. First operand has 272 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 187 states have internal predecessors, (234), 67 states have call successors, (67), 35 states have call predecessors, (67), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:00,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:02,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:02,774 INFO L93 Difference]: Finished difference Result 690 states and 946 transitions. [2022-11-03 03:48:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:02,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-03 03:48:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:02,792 INFO L225 Difference]: With dead ends: 690 [2022-11-03 03:48:02,793 INFO L226 Difference]: Without dead ends: 418 [2022-11-03 03:48:02,798 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 03:48:02,802 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 337 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:02,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 482 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 03:48:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-11-03 03:48:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 413. [2022-11-03 03:48:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 267 states have (on average 1.3745318352059925) internal successors, (367), 283 states have internal predecessors, (367), 91 states have call successors, (91), 56 states have call predecessors, (91), 54 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 534 transitions. [2022-11-03 03:48:02,894 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 534 transitions. Word has length 10 [2022-11-03 03:48:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:02,895 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 534 transitions. [2022-11-03 03:48:02,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 534 transitions. [2022-11-03 03:48:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:48:02,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:02,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:02,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:48:02,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 255201726, now seen corresponding path program 1 times [2022-11-03 03:48:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567369402] [2022-11-03 03:48:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:04,480 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 03:48:04,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:04,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567369402] [2022-11-03 03:48:04,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567369402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:04,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:04,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987140724] [2022-11-03 03:48:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:04,486 INFO L87 Difference]: Start difference. First operand 413 states and 534 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:06,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:09,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:09,563 INFO L93 Difference]: Finished difference Result 420 states and 539 transitions. [2022-11-03 03:48:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-03 03:48:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:09,568 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:48:09,569 INFO L226 Difference]: Without dead ends: 417 [2022-11-03 03:48:09,570 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 03:48:09,571 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 330 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:09,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 477 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 03:48:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-03 03:48:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 412. [2022-11-03 03:48:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 267 states have (on average 1.3707865168539326) internal successors, (366), 282 states have internal predecessors, (366), 90 states have call successors, (90), 56 states have call predecessors, (90), 54 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 532 transitions. [2022-11-03 03:48:09,640 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 532 transitions. Word has length 11 [2022-11-03 03:48:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:09,641 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 532 transitions. [2022-11-03 03:48:09,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 532 transitions. [2022-11-03 03:48:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:48:09,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:09,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:09,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:48:09,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -679044476, now seen corresponding path program 1 times [2022-11-03 03:48:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308153474] [2022-11-03 03:48:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:11,056 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 03:48:11,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:11,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308153474] [2022-11-03 03:48:11,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308153474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:11,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:11,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116824155] [2022-11-03 03:48:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:11,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:11,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:11,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:11,060 INFO L87 Difference]: Start difference. First operand 412 states and 532 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:13,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:15,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:16,060 INFO L93 Difference]: Finished difference Result 419 states and 537 transitions. [2022-11-03 03:48:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-03 03:48:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:16,065 INFO L225 Difference]: With dead ends: 419 [2022-11-03 03:48:16,065 INFO L226 Difference]: Without dead ends: 416 [2022-11-03 03:48:16,065 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 03:48:16,067 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 327 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:16,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 475 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:48:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-03 03:48:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 411. [2022-11-03 03:48:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 267 states have (on average 1.3670411985018727) internal successors, (365), 281 states have internal predecessors, (365), 89 states have call successors, (89), 56 states have call predecessors, (89), 54 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 530 transitions. [2022-11-03 03:48:16,102 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 530 transitions. Word has length 12 [2022-11-03 03:48:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:16,103 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 530 transitions. [2022-11-03 03:48:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 530 transitions. [2022-11-03 03:48:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:48:16,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:16,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:16,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:48:16,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 424099201, now seen corresponding path program 1 times [2022-11-03 03:48:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:16,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322979777] [2022-11-03 03:48:16,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:17,571 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 03:48:17,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:17,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322979777] [2022-11-03 03:48:17,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322979777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:17,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:17,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348285445] [2022-11-03 03:48:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:17,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:17,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:17,578 INFO L87 Difference]: Start difference. First operand 411 states and 530 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:20,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:22,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:22,782 INFO L93 Difference]: Finished difference Result 420 states and 536 transitions. [2022-11-03 03:48:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-03 03:48:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:22,790 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:48:22,790 INFO L226 Difference]: Without dead ends: 416 [2022-11-03 03:48:22,791 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 03:48:22,792 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 311 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:22,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 476 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-11-03 03:48:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-03 03:48:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 411. [2022-11-03 03:48:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 268 states have (on average 1.3582089552238805) internal successors, (364), 280 states have internal predecessors, (364), 87 states have call successors, (87), 57 states have call predecessors, (87), 55 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 527 transitions. [2022-11-03 03:48:22,856 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 527 transitions. Word has length 13 [2022-11-03 03:48:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:22,856 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 527 transitions. [2022-11-03 03:48:22,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 527 transitions. [2022-11-03 03:48:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:48:22,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:22,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:22,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:48:22,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 261819687, now seen corresponding path program 1 times [2022-11-03 03:48:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:22,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671440409] [2022-11-03 03:48:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:24,403 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 03:48:24,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671440409] [2022-11-03 03:48:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671440409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950320454] [2022-11-03 03:48:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:24,406 INFO L87 Difference]: Start difference. First operand 411 states and 527 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:26,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:29,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:29,447 INFO L93 Difference]: Finished difference Result 418 states and 532 transitions. [2022-11-03 03:48:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-03 03:48:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:29,452 INFO L225 Difference]: With dead ends: 418 [2022-11-03 03:48:29,452 INFO L226 Difference]: Without dead ends: 415 [2022-11-03 03:48:29,453 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 03:48:29,454 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 319 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:29,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 469 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 03:48:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-03 03:48:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 410. [2022-11-03 03:48:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 268 states have (on average 1.3544776119402986) internal successors, (363), 279 states have internal predecessors, (363), 86 states have call successors, (86), 57 states have call predecessors, (86), 55 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 525 transitions. [2022-11-03 03:48:29,498 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 525 transitions. Word has length 14 [2022-11-03 03:48:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:29,499 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 525 transitions. [2022-11-03 03:48:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 525 transitions. [2022-11-03 03:48:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:48:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:29,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:29,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:48:29,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -473873084, now seen corresponding path program 1 times [2022-11-03 03:48:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:29,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767950132] [2022-11-03 03:48:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:30,684 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 03:48:30,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767950132] [2022-11-03 03:48:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767950132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:30,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:30,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348549004] [2022-11-03 03:48:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:30,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:30,691 INFO L87 Difference]: Start difference. First operand 410 states and 525 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:33,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:35,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:35,617 INFO L93 Difference]: Finished difference Result 417 states and 530 transitions. [2022-11-03 03:48:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:35,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-03 03:48:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:35,621 INFO L225 Difference]: With dead ends: 417 [2022-11-03 03:48:35,621 INFO L226 Difference]: Without dead ends: 414 [2022-11-03 03:48:35,622 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 03:48:35,623 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 316 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:35,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 467 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:48:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-03 03:48:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2022-11-03 03:48:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 268 states have (on average 1.3507462686567164) internal successors, (362), 278 states have internal predecessors, (362), 85 states have call successors, (85), 57 states have call predecessors, (85), 55 states have return successors, (76), 74 states have call predecessors, (76), 74 states have call successors, (76) [2022-11-03 03:48:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 523 transitions. [2022-11-03 03:48:35,656 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 523 transitions. Word has length 15 [2022-11-03 03:48:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:35,656 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 523 transitions. [2022-11-03 03:48:35,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 523 transitions. [2022-11-03 03:48:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:48:35,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:35,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:35,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:48:35,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1805507638, now seen corresponding path program 1 times [2022-11-03 03:48:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:35,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809985046] [2022-11-03 03:48:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:36,764 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 03:48:36,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:36,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809985046] [2022-11-03 03:48:36,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809985046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:36,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:36,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755193529] [2022-11-03 03:48:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:36,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:36,767 INFO L87 Difference]: Start difference. First operand 409 states and 523 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:39,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:41,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:41,696 INFO L93 Difference]: Finished difference Result 910 states and 1165 transitions. [2022-11-03 03:48:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-03 03:48:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:41,700 INFO L225 Difference]: With dead ends: 910 [2022-11-03 03:48:41,701 INFO L226 Difference]: Without dead ends: 505 [2022-11-03 03:48:41,704 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 03:48:41,705 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 179 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:41,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 474 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:48:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-03 03:48:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 496. [2022-11-03 03:48:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 322 states have (on average 1.313664596273292) internal successors, (423), 332 states have internal predecessors, (423), 103 states have call successors, (103), 76 states have call predecessors, (103), 70 states have return successors, (97), 88 states have call predecessors, (97), 90 states have call successors, (97) [2022-11-03 03:48:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2022-11-03 03:48:41,811 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 16 [2022-11-03 03:48:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:41,812 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2022-11-03 03:48:41,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2022-11-03 03:48:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:48:41,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:41,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:48:41,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -136500985, now seen corresponding path program 1 times [2022-11-03 03:48:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:41,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904361163] [2022-11-03 03:48:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:42,903 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 03:48:42,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904361163] [2022-11-03 03:48:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904361163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148570418] [2022-11-03 03:48:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:42,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:42,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:42,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:42,907 INFO L87 Difference]: Start difference. First operand 496 states and 623 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:45,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:47,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:47,779 INFO L93 Difference]: Finished difference Result 509 states and 634 transitions. [2022-11-03 03:48:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-03 03:48:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:47,784 INFO L225 Difference]: With dead ends: 509 [2022-11-03 03:48:47,784 INFO L226 Difference]: Without dead ends: 506 [2022-11-03 03:48:47,790 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 03:48:47,791 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 310 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:47,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 464 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-11-03 03:48:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-11-03 03:48:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 495. [2022-11-03 03:48:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 322 states have (on average 1.31055900621118) internal successors, (422), 331 states have internal predecessors, (422), 102 states have call successors, (102), 76 states have call predecessors, (102), 70 states have return successors, (97), 88 states have call predecessors, (97), 90 states have call successors, (97) [2022-11-03 03:48:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 621 transitions. [2022-11-03 03:48:47,840 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 621 transitions. Word has length 17 [2022-11-03 03:48:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:47,840 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 621 transitions. [2022-11-03 03:48:47,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 621 transitions. [2022-11-03 03:48:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:48:47,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:47,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:47,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:48:47,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 63102573, now seen corresponding path program 1 times [2022-11-03 03:48:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:47,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5224121] [2022-11-03 03:48:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:48,900 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 03:48:48,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5224121] [2022-11-03 03:48:48,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5224121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:48,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:48,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331847504] [2022-11-03 03:48:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:48,903 INFO L87 Difference]: Start difference. First operand 495 states and 621 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:51,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:53,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:53,740 INFO L93 Difference]: Finished difference Result 508 states and 632 transitions. [2022-11-03 03:48:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-03 03:48:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:53,744 INFO L225 Difference]: With dead ends: 508 [2022-11-03 03:48:53,745 INFO L226 Difference]: Without dead ends: 505 [2022-11-03 03:48:53,745 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 03:48:53,746 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 307 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:53,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 462 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-11-03 03:48:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-03 03:48:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2022-11-03 03:48:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 322 states have (on average 1.3074534161490683) internal successors, (421), 330 states have internal predecessors, (421), 101 states have call successors, (101), 76 states have call predecessors, (101), 70 states have return successors, (97), 88 states have call predecessors, (97), 90 states have call successors, (97) [2022-11-03 03:48:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 619 transitions. [2022-11-03 03:48:53,790 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 619 transitions. Word has length 18 [2022-11-03 03:48:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:53,790 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 619 transitions. [2022-11-03 03:48:53,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 619 transitions. [2022-11-03 03:48:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:48:53,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:53,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:53,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:48:53,793 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1955850442, now seen corresponding path program 1 times [2022-11-03 03:48:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:53,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050599830] [2022-11-03 03:48:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:54,946 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 03:48:54,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:54,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050599830] [2022-11-03 03:48:54,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050599830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:54,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376802257] [2022-11-03 03:48:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:54,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:48:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:48:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:48:54,949 INFO L87 Difference]: Start difference. First operand 494 states and 619 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:57,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:48:59,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:48:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:59,879 INFO L93 Difference]: Finished difference Result 500 states and 622 transitions. [2022-11-03 03:48:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:48:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-03 03:48:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:59,884 INFO L225 Difference]: With dead ends: 500 [2022-11-03 03:48:59,884 INFO L226 Difference]: Without dead ends: 496 [2022-11-03 03:48:59,885 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 03:48:59,886 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 82 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:59,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 452 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:48:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-11-03 03:48:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 494. [2022-11-03 03:48:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 323 states have (on average 1.3003095975232197) internal successors, (420), 329 states have internal predecessors, (420), 99 states have call successors, (99), 77 states have call predecessors, (99), 71 states have return successors, (97), 88 states have call predecessors, (97), 90 states have call successors, (97) [2022-11-03 03:48:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 616 transitions. [2022-11-03 03:48:59,927 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 616 transitions. Word has length 19 [2022-11-03 03:48:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:59,928 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 616 transitions. [2022-11-03 03:48:59,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:48:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 616 transitions. [2022-11-03 03:48:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:48:59,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:59,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:59,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:48:59,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 501497104, now seen corresponding path program 1 times [2022-11-03 03:48:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289652975] [2022-11-03 03:48:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:00,951 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 03:49:00,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289652975] [2022-11-03 03:49:00,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289652975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:00,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:00,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146228251] [2022-11-03 03:49:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:00,954 INFO L87 Difference]: Start difference. First operand 494 states and 616 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:49:03,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:05,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:05,975 INFO L93 Difference]: Finished difference Result 507 states and 627 transitions. [2022-11-03 03:49:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:05,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-03 03:49:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:05,980 INFO L225 Difference]: With dead ends: 507 [2022-11-03 03:49:05,980 INFO L226 Difference]: Without dead ends: 492 [2022-11-03 03:49:05,981 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 03:49:05,981 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 299 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:05,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 457 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 03:49:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-03 03:49:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 481. [2022-11-03 03:49:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 312 states have (on average 1.3044871794871795) internal successors, (407), 317 states have internal predecessors, (407), 97 states have call successors, (97), 76 states have call predecessors, (97), 71 states have return successors, (97), 88 states have call predecessors, (97), 90 states have call successors, (97) [2022-11-03 03:49:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 601 transitions. [2022-11-03 03:49:06,023 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 601 transitions. Word has length 20 [2022-11-03 03:49:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:06,023 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 601 transitions. [2022-11-03 03:49:06,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:49:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 601 transitions. [2022-11-03 03:49:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:49:06,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:06,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:06,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:49:06,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1248122496, now seen corresponding path program 1 times [2022-11-03 03:49:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:06,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316284624] [2022-11-03 03:49:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:07,466 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 03:49:07,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316284624] [2022-11-03 03:49:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316284624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:07,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:07,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512167653] [2022-11-03 03:49:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:07,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:07,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:07,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:07,470 INFO L87 Difference]: Start difference. First operand 481 states and 601 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:49:09,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:12,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:12,445 INFO L93 Difference]: Finished difference Result 968 states and 1215 transitions. [2022-11-03 03:49:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-11-03 03:49:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:12,449 INFO L225 Difference]: With dead ends: 968 [2022-11-03 03:49:12,450 INFO L226 Difference]: Without dead ends: 491 [2022-11-03 03:49:12,452 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 03:49:12,453 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:12,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 466 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:49:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-03 03:49:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-11-03 03:49:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 320 states have (on average 1.30625) internal successors, (418), 325 states have internal predecessors, (418), 99 states have call successors, (99), 76 states have call predecessors, (99), 71 states have return successors, (99), 90 states have call predecessors, (99), 92 states have call successors, (99) [2022-11-03 03:49:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 616 transitions. [2022-11-03 03:49:12,496 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 616 transitions. Word has length 27 [2022-11-03 03:49:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:12,496 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 616 transitions. [2022-11-03 03:49:12,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:49:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 616 transitions. [2022-11-03 03:49:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:49:12,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:12,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:12,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:49:12,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1532540731, now seen corresponding path program 1 times [2022-11-03 03:49:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:12,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146799923] [2022-11-03 03:49:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:14,763 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 03:49:14,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146799923] [2022-11-03 03:49:14,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146799923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:14,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:14,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491268268] [2022-11-03 03:49:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:14,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:14,767 INFO L87 Difference]: Start difference. First operand 491 states and 616 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 03:49:17,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:19,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:19,883 INFO L93 Difference]: Finished difference Result 504 states and 627 transitions. [2022-11-03 03:49:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-11-03 03:49:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:19,887 INFO L225 Difference]: With dead ends: 504 [2022-11-03 03:49:19,888 INFO L226 Difference]: Without dead ends: 501 [2022-11-03 03:49:19,888 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 03:49:19,889 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 213 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:19,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 505 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-11-03 03:49:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-11-03 03:49:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 490. [2022-11-03 03:49:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 320 states have (on average 1.303125) internal successors, (417), 324 states have internal predecessors, (417), 98 states have call successors, (98), 76 states have call predecessors, (98), 71 states have return successors, (99), 90 states have call predecessors, (99), 92 states have call successors, (99) [2022-11-03 03:49:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 614 transitions. [2022-11-03 03:49:19,933 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 614 transitions. Word has length 34 [2022-11-03 03:49:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:19,933 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 614 transitions. [2022-11-03 03:49:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 03:49:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 614 transitions. [2022-11-03 03:49:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:49:19,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:19,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:49:19,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 759579910, now seen corresponding path program 1 times [2022-11-03 03:49:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879801946] [2022-11-03 03:49:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:49:21,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:21,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879801946] [2022-11-03 03:49:21,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879801946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:21,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843081256] [2022-11-03 03:49:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:21,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:49:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:21,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:49:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:49:21,493 INFO L87 Difference]: Start difference. First operand 490 states and 614 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 03:49:23,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:26,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:26,574 INFO L93 Difference]: Finished difference Result 979 states and 1228 transitions. [2022-11-03 03:49:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:49:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-03 03:49:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:26,579 INFO L225 Difference]: With dead ends: 979 [2022-11-03 03:49:26,579 INFO L226 Difference]: Without dead ends: 490 [2022-11-03 03:49:26,581 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 03:49:26,582 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:26,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 742 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-03 03:49:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-03 03:49:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-11-03 03:49:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 320 states have (on average 1.3) internal successors, (416), 324 states have internal predecessors, (416), 98 states have call successors, (98), 76 states have call predecessors, (98), 71 states have return successors, (99), 90 states have call predecessors, (99), 92 states have call successors, (99) [2022-11-03 03:49:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 613 transitions. [2022-11-03 03:49:26,628 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 613 transitions. Word has length 41 [2022-11-03 03:49:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:26,628 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 613 transitions. [2022-11-03 03:49:26,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 03:49:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 613 transitions. [2022-11-03 03:49:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:49:26,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:26,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:26,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:49:26,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2110849133, now seen corresponding path program 1 times [2022-11-03 03:49:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157131614] [2022-11-03 03:49:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:49:28,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:28,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157131614] [2022-11-03 03:49:28,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157131614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:28,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:28,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817456185] [2022-11-03 03:49:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:28,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:28,494 INFO L87 Difference]: Start difference. First operand 490 states and 613 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 03:49:30,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:33,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:33,437 INFO L93 Difference]: Finished difference Result 492 states and 614 transitions. [2022-11-03 03:49:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-11-03 03:49:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:33,441 INFO L225 Difference]: With dead ends: 492 [2022-11-03 03:49:33,441 INFO L226 Difference]: Without dead ends: 489 [2022-11-03 03:49:33,442 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 03:49:33,443 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:33,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 488 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 03:49:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-03 03:49:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2022-11-03 03:49:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 320 states have (on average 1.296875) internal successors, (415), 323 states have internal predecessors, (415), 97 states have call successors, (97), 76 states have call predecessors, (97), 71 states have return successors, (99), 90 states have call predecessors, (99), 92 states have call successors, (99) [2022-11-03 03:49:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 611 transitions. [2022-11-03 03:49:33,485 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 611 transitions. Word has length 42 [2022-11-03 03:49:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:33,486 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 611 transitions. [2022-11-03 03:49:33,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 03:49:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 611 transitions. [2022-11-03 03:49:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 03:49:33,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:33,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:33,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:49:33,488 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash -823142469, now seen corresponding path program 1 times [2022-11-03 03:49:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959355630] [2022-11-03 03:49:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:49:36,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959355630] [2022-11-03 03:49:36,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959355630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:36,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:36,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356040249] [2022-11-03 03:49:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:36,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:49:36,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:36,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:49:36,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:49:36,315 INFO L87 Difference]: Start difference. First operand 489 states and 611 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 03:49:38,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:49:41,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:49:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:41,855 INFO L93 Difference]: Finished difference Result 962 states and 1210 transitions. [2022-11-03 03:49:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:41,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-11-03 03:49:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:41,860 INFO L225 Difference]: With dead ends: 962 [2022-11-03 03:49:41,861 INFO L226 Difference]: Without dead ends: 575 [2022-11-03 03:49:41,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 03:49:41,863 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 317 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 131 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:41,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 484 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 274 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-11-03 03:49:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-03 03:49:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2022-11-03 03:49:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 379 states have (on average 1.3087071240105541) internal successors, (496), 380 states have internal predecessors, (496), 108 states have call successors, (108), 87 states have call predecessors, (108), 78 states have return successors, (105), 99 states have call predecessors, (105), 101 states have call successors, (105) [2022-11-03 03:49:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 709 transitions. [2022-11-03 03:49:41,914 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 709 transitions. Word has length 60 [2022-11-03 03:49:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:41,915 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 709 transitions. [2022-11-03 03:49:41,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 03:49:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 709 transitions. [2022-11-03 03:49:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-03 03:49:41,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:41,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:41,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 03:49:41,918 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash 179758317, now seen corresponding path program 1 times [2022-11-03 03:49:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692907929] [2022-11-03 03:49:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:51:37,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.