./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:50:26,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:26,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:26,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:26,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:26,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:26,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:26,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:26,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:26,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:26,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:26,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:26,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:26,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:26,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:26,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:26,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:26,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:26,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:26,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:26,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:26,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:26,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:26,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:26,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:26,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:26,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:26,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:26,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:26,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:26,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:26,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:26,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:26,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:26,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:26,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:26,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:26,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:26,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:26,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:26,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:26,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:50:26,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:26,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:26,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:26,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:26,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:26,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:26,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:26,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:26,663 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:26,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:26,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:26,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:26,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:26,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:26,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:26,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:26,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:26,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:26,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:26,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:26,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:26,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:26,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:26,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:26,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:26,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:26,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:26,678 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:26,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:26,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:26,679 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_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9a20f3f691c8614da828fa262b8d39a0b290d1ce7d7bab1e11653a91cb5fcdd [2022-11-02 20:50:26,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:27,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:27,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:27,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:27,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:27,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2022-11-02 20:50:27,104 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/data/706860a50/2a16a7bb6e5b4edfb98b9295897ce646/FLAGa24a0810a [2022-11-02 20:50:27,942 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:27,943 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2022-11-02 20:50:27,975 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/data/706860a50/2a16a7bb6e5b4edfb98b9295897ce646/FLAGa24a0810a [2022-11-02 20:50:28,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/data/706860a50/2a16a7bb6e5b4edfb98b9295897ce646 [2022-11-02 20:50:28,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:28,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:28,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:28,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:28,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:28,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:28" (1/1) ... [2022-11-02 20:50:28,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcf9863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:28, skipping insertion in model container [2022-11-02 20:50:28,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:28" (1/1) ... [2022-11-02 20:50:28,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:28,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:29,337 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_2d6df7b6-bde5-43d0-a381-310458192509/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2022-11-02 20:50:29,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:29,985 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:30,163 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_2d6df7b6-bde5-43d0-a381-310458192509/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2022-11-02 20:50:30,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:30,368 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:30,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30 WrapperNode [2022-11-02 20:50:30,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:30,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:30,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:30,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:30,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,513 INFO L138 Inliner]: procedures = 139, calls = 575, calls flagged for inlining = 59, calls inlined = 59, statements flattened = 1725 [2022-11-02 20:50:30,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:30,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:30,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:30,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:30,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:30,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:30,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:30,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:30,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (1/1) ... [2022-11-02 20:50:30,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:30,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:30,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2022-11-02 20:50:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2022-11-02 20:50:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:50:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:50:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:50:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:50:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:50:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:50:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2022-11-02 20:50:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2022-11-02 20:50:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-11-02 20:50:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-11-02 20:50:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:50:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:50:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:50:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:50:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-11-02 20:50:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2022-11-02 20:50:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2022-11-02 20:50:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2022-11-02 20:50:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:50:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:50:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2022-11-02 20:50:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2022-11-02 20:50:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:50:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:50:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-02 20:50:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-02 20:50:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:50:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:50:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:50:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:50:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2022-11-02 20:50:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2022-11-02 20:50:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:50:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-02 20:50:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-02 20:50:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2022-11-02 20:50:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2022-11-02 20:50:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:50:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:50:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:50:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:50:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:50:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2022-11-02 20:50:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2022-11-02 20:50:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2022-11-02 20:50:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2022-11-02 20:50:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:50:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:50:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:50:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-11-02 20:50:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:50:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:50:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:50:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2022-11-02 20:50:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2022-11-02 20:50:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 20:50:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 20:50:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2022-11-02 20:50:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2022-11-02 20:50:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2022-11-02 20:50:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2022-11-02 20:50:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-11-02 20:50:30,940 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-11-02 20:50:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:50:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:50:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:50:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:30,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2022-11-02 20:50:30,942 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2022-11-02 20:50:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-02 20:50:30,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-02 20:50:31,427 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:31,430 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:32,313 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:50:32,622 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-02 20:50:33,019 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:33,030 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:33,031 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:50:33,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:33 BoogieIcfgContainer [2022-11-02 20:50:33,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:33,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:33,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:33,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:33,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:28" (1/3) ... [2022-11-02 20:50:33,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6203b698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:33, skipping insertion in model container [2022-11-02 20:50:33,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:30" (2/3) ... [2022-11-02 20:50:33,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6203b698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:33, skipping insertion in model container [2022-11-02 20:50:33,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:33" (3/3) ... [2022-11-02 20:50:33,050 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2022-11-02 20:50:33,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:33,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:50:33,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:33,175 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59e6dd4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:33,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:50:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 398 states have (on average 1.407035175879397) internal successors, (560), 412 states have internal predecessors, (560), 94 states have call successors, (94), 31 states have call predecessors, (94), 29 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-02 20:50:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:50:33,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:33,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:33,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1589467643, now seen corresponding path program 1 times [2022-11-02 20:50:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046436083] [2022-11-02 20:50:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:50:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:33,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046436083] [2022-11-02 20:50:33,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046436083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:33,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:33,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046135991] [2022-11-02 20:50:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:33,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:33,984 INFO L87 Difference]: Start difference. First operand has 523 states, 398 states have (on average 1.407035175879397) internal successors, (560), 412 states have internal predecessors, (560), 94 states have call successors, (94), 31 states have call predecessors, (94), 29 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:50:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:36,582 INFO L93 Difference]: Finished difference Result 1672 states and 2474 transitions. [2022-11-02 20:50:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-11-02 20:50:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:36,635 INFO L225 Difference]: With dead ends: 1672 [2022-11-02 20:50:36,635 INFO L226 Difference]: Without dead ends: 1132 [2022-11-02 20:50:36,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:36,657 INFO L413 NwaCegarLoop]: 753 mSDtfsCounter, 1145 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:36,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2187 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:50:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-11-02 20:50:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 969. [2022-11-02 20:50:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 753 states have (on average 1.3957503320053122) internal successors, (1051), 760 states have internal predecessors, (1051), 159 states have call successors, (159), 57 states have call predecessors, (159), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-11-02 20:50:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1363 transitions. [2022-11-02 20:50:36,844 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1363 transitions. Word has length 40 [2022-11-02 20:50:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:36,845 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1363 transitions. [2022-11-02 20:50:36,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:50:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1363 transitions. [2022-11-02 20:50:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:50:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:36,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:36,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:36,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1949626109, now seen corresponding path program 1 times [2022-11-02 20:50:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:36,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118559621] [2022-11-02 20:50:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118559621] [2022-11-02 20:50:37,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118559621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:37,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143611836] [2022-11-02 20:50:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:37,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:37,388 INFO L87 Difference]: Start difference. First operand 969 states and 1363 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:38,791 INFO L93 Difference]: Finished difference Result 1131 states and 1631 transitions. [2022-11-02 20:50:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2022-11-02 20:50:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:38,804 INFO L225 Difference]: With dead ends: 1131 [2022-11-02 20:50:38,804 INFO L226 Difference]: Without dead ends: 1128 [2022-11-02 20:50:38,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:38,813 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 948 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:38,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1470 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:50:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-11-02 20:50:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 968. [2022-11-02 20:50:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 753 states have (on average 1.3944223107569722) internal successors, (1050), 759 states have internal predecessors, (1050), 158 states have call successors, (158), 57 states have call predecessors, (158), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-11-02 20:50:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1361 transitions. [2022-11-02 20:50:38,934 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1361 transitions. Word has length 50 [2022-11-02 20:50:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:38,936 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1361 transitions. [2022-11-02 20:50:38,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1361 transitions. [2022-11-02 20:50:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:50:38,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:38,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:38,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 308647439, now seen corresponding path program 1 times [2022-11-02 20:50:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778078604] [2022-11-02 20:50:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:39,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:39,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778078604] [2022-11-02 20:50:39,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778078604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:39,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:39,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:39,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129243065] [2022-11-02 20:50:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:39,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:39,341 INFO L87 Difference]: Start difference. First operand 968 states and 1361 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:40,779 INFO L93 Difference]: Finished difference Result 1130 states and 1629 transitions. [2022-11-02 20:50:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-11-02 20:50:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:40,788 INFO L225 Difference]: With dead ends: 1130 [2022-11-02 20:50:40,788 INFO L226 Difference]: Without dead ends: 1127 [2022-11-02 20:50:40,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:40,791 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 945 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:40,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1466 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:50:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-02 20:50:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 967. [2022-11-02 20:50:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 753 states have (on average 1.3930942895086322) internal successors, (1049), 758 states have internal predecessors, (1049), 157 states have call successors, (157), 57 states have call predecessors, (157), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-11-02 20:50:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1359 transitions. [2022-11-02 20:50:40,889 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1359 transitions. Word has length 51 [2022-11-02 20:50:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:40,889 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1359 transitions. [2022-11-02 20:50:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1359 transitions. [2022-11-02 20:50:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:50:40,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:40,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:40,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:40,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash 977921088, now seen corresponding path program 1 times [2022-11-02 20:50:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281323335] [2022-11-02 20:50:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281323335] [2022-11-02 20:50:41,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281323335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:41,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:41,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138498669] [2022-11-02 20:50:41,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:41,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:41,071 INFO L87 Difference]: Start difference. First operand 967 states and 1359 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:42,346 INFO L93 Difference]: Finished difference Result 1129 states and 1627 transitions. [2022-11-02 20:50:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-11-02 20:50:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:42,354 INFO L225 Difference]: With dead ends: 1129 [2022-11-02 20:50:42,354 INFO L226 Difference]: Without dead ends: 1126 [2022-11-02 20:50:42,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:42,356 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 942 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:42,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1462 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:50:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2022-11-02 20:50:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 966. [2022-11-02 20:50:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 753 states have (on average 1.3917662682602923) internal successors, (1048), 757 states have internal predecessors, (1048), 156 states have call successors, (156), 57 states have call predecessors, (156), 56 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-11-02 20:50:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1357 transitions. [2022-11-02 20:50:42,465 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1357 transitions. Word has length 52 [2022-11-02 20:50:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:42,466 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1357 transitions. [2022-11-02 20:50:42,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1357 transitions. [2022-11-02 20:50:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:50:42,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:42,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:42,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 250572594, now seen corresponding path program 1 times [2022-11-02 20:50:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:42,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030141582] [2022-11-02 20:50:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:42,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:42,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030141582] [2022-11-02 20:50:42,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030141582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:42,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:42,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:42,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290751460] [2022-11-02 20:50:42,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:42,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:42,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:42,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:42,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:42,699 INFO L87 Difference]: Start difference. First operand 966 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:44,854 INFO L93 Difference]: Finished difference Result 3187 states and 4578 transitions. [2022-11-02 20:50:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-11-02 20:50:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:44,868 INFO L225 Difference]: With dead ends: 3187 [2022-11-02 20:50:44,868 INFO L226 Difference]: Without dead ends: 2232 [2022-11-02 20:50:44,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:44,874 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 1173 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:44,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2165 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:50:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2022-11-02 20:50:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1908. [2022-11-02 20:50:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1490 states have (on average 1.393959731543624) internal successors, (2077), 1496 states have internal predecessors, (2077), 305 states have call successors, (305), 113 states have call predecessors, (305), 112 states have return successors, (310), 302 states have call predecessors, (310), 302 states have call successors, (310) [2022-11-02 20:50:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2692 transitions. [2022-11-02 20:50:45,026 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2692 transitions. Word has length 53 [2022-11-02 20:50:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:45,029 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2692 transitions. [2022-11-02 20:50:45,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2692 transitions. [2022-11-02 20:50:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:50:45,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:45,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:45,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:45,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash -822389373, now seen corresponding path program 1 times [2022-11-02 20:50:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:45,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189722889] [2022-11-02 20:50:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189722889] [2022-11-02 20:50:45,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189722889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:45,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:45,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492952838] [2022-11-02 20:50:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:45,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:45,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:45,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:45,242 INFO L87 Difference]: Start difference. First operand 1908 states and 2692 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:46,693 INFO L93 Difference]: Finished difference Result 2230 states and 3223 transitions. [2022-11-02 20:50:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2022-11-02 20:50:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:46,710 INFO L225 Difference]: With dead ends: 2230 [2022-11-02 20:50:46,711 INFO L226 Difference]: Without dead ends: 2218 [2022-11-02 20:50:46,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:46,714 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 938 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:46,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1461 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:50:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2022-11-02 20:50:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1898. [2022-11-02 20:50:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1481 states have (on average 1.3936529372045916) internal successors, (2064), 1486 states have internal predecessors, (2064), 304 states have call successors, (304), 113 states have call predecessors, (304), 112 states have return successors, (310), 302 states have call predecessors, (310), 302 states have call successors, (310) [2022-11-02 20:50:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2678 transitions. [2022-11-02 20:50:46,880 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2678 transitions. Word has length 54 [2022-11-02 20:50:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:46,881 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 2678 transitions. [2022-11-02 20:50:46,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2678 transitions. [2022-11-02 20:50:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:50:46,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:46,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:46,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1986046453, now seen corresponding path program 1 times [2022-11-02 20:50:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:46,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297601467] [2022-11-02 20:50:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:50:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:50:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:47,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297601467] [2022-11-02 20:50:47,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297601467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:47,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:47,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306646402] [2022-11-02 20:50:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:47,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:47,053 INFO L87 Difference]: Start difference. First operand 1898 states and 2678 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:50:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:49,402 INFO L93 Difference]: Finished difference Result 6142 states and 8755 transitions. [2022-11-02 20:50:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:49,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-11-02 20:50:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:49,432 INFO L225 Difference]: With dead ends: 6142 [2022-11-02 20:50:49,432 INFO L226 Difference]: Without dead ends: 4255 [2022-11-02 20:50:49,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:49,445 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1124 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:49,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 2065 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:50:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2022-11-02 20:50:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3604. [2022-11-02 20:50:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2825 states have (on average 1.390796460176991) internal successors, (3929), 2834 states have internal predecessors, (3929), 555 states have call successors, (555), 224 states have call predecessors, (555), 223 states have return successors, (565), 553 states have call predecessors, (565), 553 states have call successors, (565) [2022-11-02 20:50:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5049 transitions. [2022-11-02 20:50:49,770 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5049 transitions. Word has length 66 [2022-11-02 20:50:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:49,771 INFO L495 AbstractCegarLoop]: Abstraction has 3604 states and 5049 transitions. [2022-11-02 20:50:49,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:50:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5049 transitions. [2022-11-02 20:50:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:50:49,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:49,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:49,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:50:49,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:49,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -181003579, now seen corresponding path program 1 times [2022-11-02 20:50:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420924674] [2022-11-02 20:50:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:50:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:50:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:50,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420924674] [2022-11-02 20:50:50,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420924674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:50,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:50,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352057700] [2022-11-02 20:50:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:50,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:50,016 INFO L87 Difference]: Start difference. First operand 3604 states and 5049 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:50:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:52,804 INFO L93 Difference]: Finished difference Result 10431 states and 14766 transitions. [2022-11-02 20:50:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-11-02 20:50:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:52,843 INFO L225 Difference]: With dead ends: 10431 [2022-11-02 20:50:52,844 INFO L226 Difference]: Without dead ends: 6848 [2022-11-02 20:50:52,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:52,858 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 962 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:52,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2856 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:50:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2022-11-02 20:50:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 5818. [2022-11-02 20:50:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4560 states have (on average 1.3888157894736841) internal successors, (6333), 4575 states have internal predecessors, (6333), 882 states have call successors, (882), 376 states have call predecessors, (882), 375 states have return successors, (896), 878 states have call predecessors, (896), 880 states have call successors, (896) [2022-11-02 20:50:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 8111 transitions. [2022-11-02 20:50:53,379 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 8111 transitions. Word has length 65 [2022-11-02 20:50:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:53,380 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 8111 transitions. [2022-11-02 20:50:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:50:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 8111 transitions. [2022-11-02 20:50:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:50:53,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:53,393 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:50:53,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1535676253, now seen corresponding path program 1 times [2022-11-02 20:50:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:53,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842232427] [2022-11-02 20:50:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:50:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:50:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:50:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:50:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:50:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:50:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:50:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-11-02 20:50:53,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:53,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842232427] [2022-11-02 20:50:53,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842232427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:53,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:53,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606944699] [2022-11-02 20:50:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:53,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:53,996 INFO L87 Difference]: Start difference. First operand 5818 states and 8111 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:50:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:57,949 INFO L93 Difference]: Finished difference Result 10230 states and 14590 transitions. [2022-11-02 20:50:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:50:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2022-11-02 20:50:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:57,999 INFO L225 Difference]: With dead ends: 10230 [2022-11-02 20:50:57,999 INFO L226 Difference]: Without dead ends: 10227 [2022-11-02 20:50:58,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:50:58,003 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 2079 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:58,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 3876 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 20:50:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2022-11-02 20:50:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 8696. [2022-11-02 20:50:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8696 states, 6817 states have (on average 1.3902009681678158) internal successors, (9477), 6839 states have internal predecessors, (9477), 1318 states have call successors, (1318), 561 states have call predecessors, (1318), 560 states have return successors, (1364), 1313 states have call predecessors, (1364), 1316 states have call successors, (1364) [2022-11-02 20:50:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 12159 transitions. [2022-11-02 20:50:58,765 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 12159 transitions. Word has length 122 [2022-11-02 20:50:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:58,765 INFO L495 AbstractCegarLoop]: Abstraction has 8696 states and 12159 transitions. [2022-11-02 20:50:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:50:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 12159 transitions. [2022-11-02 20:50:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 20:50:58,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:58,772 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:50:58,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1504761742, now seen corresponding path program 1 times [2022-11-02 20:50:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556124037] [2022-11-02 20:50:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:50:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:50:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:50:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:50:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:50:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:50:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:50:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:50:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:50:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:50:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-02 20:50:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:59,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556124037] [2022-11-02 20:50:59,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556124037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:59,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:59,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665816632] [2022-11-02 20:50:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:59,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:59,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:59,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:59,014 INFO L87 Difference]: Start difference. First operand 8696 states and 12159 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:51:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:01,634 INFO L93 Difference]: Finished difference Result 24686 states and 34978 transitions. [2022-11-02 20:51:01,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:51:01,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2022-11-02 20:51:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:01,712 INFO L225 Difference]: With dead ends: 24686 [2022-11-02 20:51:01,712 INFO L226 Difference]: Without dead ends: 16027 [2022-11-02 20:51:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:01,817 INFO L413 NwaCegarLoop]: 860 mSDtfsCounter, 1082 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:01,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2411 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:51:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16027 states. [2022-11-02 20:51:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16027 to 13615. [2022-11-02 20:51:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13615 states, 10743 states have (on average 1.385832635204319) internal successors, (14888), 10774 states have internal predecessors, (14888), 1996 states have call successors, (1996), 876 states have call predecessors, (1996), 875 states have return successors, (2054), 1988 states have call predecessors, (2054), 1994 states have call successors, (2054) [2022-11-02 20:51:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 18938 transitions. [2022-11-02 20:51:02,985 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 18938 transitions. Word has length 123 [2022-11-02 20:51:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:02,985 INFO L495 AbstractCegarLoop]: Abstraction has 13615 states and 18938 transitions. [2022-11-02 20:51:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:51:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 18938 transitions. [2022-11-02 20:51:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:51:02,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:02,992 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:02,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:51:02,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1949944417, now seen corresponding path program 1 times [2022-11-02 20:51:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:02,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083236494] [2022-11-02 20:51:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:51:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:51:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:51:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:51:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:51:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:51:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:51:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-11-02 20:51:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:03,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083236494] [2022-11-02 20:51:03,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083236494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:03,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:03,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963879456] [2022-11-02 20:51:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:03,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:03,834 INFO L87 Difference]: Start difference. First operand 13615 states and 18938 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:51:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:06,749 INFO L93 Difference]: Finished difference Result 20835 states and 29445 transitions. [2022-11-02 20:51:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:51:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2022-11-02 20:51:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:06,821 INFO L225 Difference]: With dead ends: 20835 [2022-11-02 20:51:06,822 INFO L226 Difference]: Without dead ends: 16267 [2022-11-02 20:51:06,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:51:06,843 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 272 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:06,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 4243 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:51:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16267 states. [2022-11-02 20:51:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16267 to 13754. [2022-11-02 20:51:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13754 states, 10862 states have (on average 1.380684956729884) internal successors, (14997), 10913 states have internal predecessors, (14997), 1996 states have call successors, (1996), 876 states have call predecessors, (1996), 895 states have return successors, (2094), 1988 states have call predecessors, (2094), 1994 states have call successors, (2094) [2022-11-02 20:51:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 19087 transitions. [2022-11-02 20:51:07,821 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 19087 transitions. Word has length 122 [2022-11-02 20:51:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:07,822 INFO L495 AbstractCegarLoop]: Abstraction has 13754 states and 19087 transitions. [2022-11-02 20:51:07,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:51:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 19087 transitions. [2022-11-02 20:51:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:51:07,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:07,835 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:07,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:51:07,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1749310071, now seen corresponding path program 1 times [2022-11-02 20:51:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236742182] [2022-11-02 20:51:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:51:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:51:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:51:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:51:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:51:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:51:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-02 20:51:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236742182] [2022-11-02 20:51:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236742182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:08,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548225545] [2022-11-02 20:51:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:08,198 INFO L87 Difference]: Start difference. First operand 13754 states and 19087 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-02 20:51:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:11,660 INFO L93 Difference]: Finished difference Result 38432 states and 54071 transitions. [2022-11-02 20:51:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:51:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 141 [2022-11-02 20:51:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:11,763 INFO L225 Difference]: With dead ends: 38432 [2022-11-02 20:51:11,764 INFO L226 Difference]: Without dead ends: 24715 [2022-11-02 20:51:11,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:11,805 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 1197 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:11,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2340 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:51:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24715 states. [2022-11-02 20:51:13,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24715 to 21044. [2022-11-02 20:51:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21044 states, 16733 states have (on average 1.3772784318412716) internal successors, (23046), 16802 states have internal predecessors, (23046), 2944 states have call successors, (2944), 1335 states have call predecessors, (2944), 1366 states have return successors, (3062), 2936 states have call predecessors, (3062), 2942 states have call successors, (3062) [2022-11-02 20:51:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 29052 transitions. [2022-11-02 20:51:13,382 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 29052 transitions. Word has length 141 [2022-11-02 20:51:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:13,382 INFO L495 AbstractCegarLoop]: Abstraction has 21044 states and 29052 transitions. [2022-11-02 20:51:13,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-02 20:51:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 29052 transitions. [2022-11-02 20:51:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:51:13,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:13,394 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:13,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:51:13,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1038448743, now seen corresponding path program 1 times [2022-11-02 20:51:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124005334] [2022-11-02 20:51:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:51:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:51:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:51:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:51:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:51:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 20:51:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-11-02 20:51:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:14,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124005334] [2022-11-02 20:51:14,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124005334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:14,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:14,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681867043] [2022-11-02 20:51:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:14,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:14,085 INFO L87 Difference]: Start difference. First operand 21044 states and 29052 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:51:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:17,176 INFO L93 Difference]: Finished difference Result 30746 states and 42907 transitions. [2022-11-02 20:51:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:51:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 140 [2022-11-02 20:51:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:17,249 INFO L225 Difference]: With dead ends: 30746 [2022-11-02 20:51:17,250 INFO L226 Difference]: Without dead ends: 16636 [2022-11-02 20:51:17,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:51:17,290 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 309 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:17,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3511 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:51:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2022-11-02 20:51:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 14099. [2022-11-02 20:51:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 11225 states have (on average 1.3730066815144766) internal successors, (15412), 11266 states have internal predecessors, (15412), 1966 states have call successors, (1966), 892 states have call predecessors, (1966), 907 states have return successors, (2012), 1960 states have call predecessors, (2012), 1964 states have call successors, (2012) [2022-11-02 20:51:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 19390 transitions. [2022-11-02 20:51:18,399 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 19390 transitions. Word has length 140 [2022-11-02 20:51:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:18,400 INFO L495 AbstractCegarLoop]: Abstraction has 14099 states and 19390 transitions. [2022-11-02 20:51:18,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:51:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 19390 transitions. [2022-11-02 20:51:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-02 20:51:18,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:18,416 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:51:18,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 935962192, now seen corresponding path program 1 times [2022-11-02 20:51:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:18,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219526131] [2022-11-02 20:51:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:18,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:51:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:51:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:51:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:51:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:51:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:51:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 20:51:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-11-02 20:51:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:18,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219526131] [2022-11-02 20:51:18,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219526131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:18,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456909958] [2022-11-02 20:51:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:18,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:18,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:18,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:19,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:51:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:19,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:51:19,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-11-02 20:51:19,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:51:19,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456909958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:19,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:51:19,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-02 20:51:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024889872] [2022-11-02 20:51:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:19,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:51:19,955 INFO L87 Difference]: Start difference. First operand 14099 states and 19390 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:51:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:23,078 INFO L93 Difference]: Finished difference Result 14099 states and 19390 transitions. [2022-11-02 20:51:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2022-11-02 20:51:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:23,080 INFO L225 Difference]: With dead ends: 14099 [2022-11-02 20:51:23,080 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:51:23,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:51:23,098 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1279 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:23,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1197 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:51:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:51:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:51:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:51:23,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2022-11-02 20:51:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:23,101 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:51:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:51:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:51:23,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:51:23,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:51:23,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:51:23,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d6df7b6-bde5-43d0-a381-310458192509/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:51:23,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:51:30,247 WARN L234 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 62 DAG size of output: 60 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:51:36,124 WARN L234 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:51:41,972 WARN L234 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:51:48,138 WARN L234 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:51:53,484 WARN L234 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:51:59,631 WARN L234 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:06,164 WARN L234 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:11,566 WARN L234 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:17,526 WARN L234 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:24,065 WARN L234 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:30,609 WARN L234 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:35,694 WARN L234 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 62 DAG size of output: 60 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:41,383 WARN L234 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:47,961 WARN L234 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:52:54,253 WARN L234 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:00,776 WARN L234 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:07,032 WARN L234 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:13,206 WARN L234 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:18,927 WARN L234 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:26,298 WARN L234 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:31,682 WARN L234 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:37,254 WARN L234 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:43,448 WARN L234 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:48,720 WARN L234 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:53:56,284 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:02,002 WARN L234 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:07,373 WARN L234 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:13,820 WARN L234 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:19,410 WARN L234 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:25,157 WARN L234 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 68 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:54:30,870 WARN L234 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)