./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.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_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/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_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/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_53434859-d765-44a3-b6bf-63752cf74f8a/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 79172d5077d4821f59ec3ee2d8a7cf5ca2cb3c5c1b82d4680e26c94b2b62bba2 --- 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:44:44,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:44:44,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:44:44,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:44:44,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:44:44,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:44:44,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:44:44,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:44:44,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:44:44,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:44:44,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:44:44,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:44:44,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:44:44,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:44:44,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:44:44,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:44:44,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:44:44,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:44:44,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:44:44,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:44:44,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:44:44,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:44:44,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:44:44,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:44:44,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:44:44,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:44:44,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:44:44,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:44:44,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:44:44,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:44:44,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:44:44,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:44:44,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:44:44,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:44:44,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:44:44,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:44:44,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:44:44,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:44:44,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:44:44,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:44:44,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:44:44,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:44:44,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:44:44,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:44:44,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:44:44,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:44:44,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:44:44,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:44:44,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:44:44,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:44:44,720 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:44:44,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:44:44,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:44:44,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:44:44,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:44:44,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:44:44,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:44:44,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:44:44,723 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:44:44,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:44:44,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:44:44,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:44:44,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:44:44,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:44,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:44:44,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:44:44,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:44:44,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:44:44,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:44:44,726 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:44:44,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:44:44,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:44:44,726 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_53434859-d765-44a3-b6bf-63752cf74f8a/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_53434859-d765-44a3-b6bf-63752cf74f8a/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 -> 79172d5077d4821f59ec3ee2d8a7cf5ca2cb3c5c1b82d4680e26c94b2b62bba2 [2022-11-02 20:44:44,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:44:45,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:44:45,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:44:45,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:44:45,031 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:44:45,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:44:45,121 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/data/f01117bfe/090560524df74b9a9ad6c6d25b58eab3/FLAG65a4b35ca [2022-11-02 20:44:45,959 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:44:45,960 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:44:46,006 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/data/f01117bfe/090560524df74b9a9ad6c6d25b58eab3/FLAG65a4b35ca [2022-11-02 20:44:46,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/data/f01117bfe/090560524df74b9a9ad6c6d25b58eab3 [2022-11-02 20:44:46,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:44:46,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:44:46,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:46,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:44:46,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:44:46,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:46" (1/1) ... [2022-11-02 20:44:46,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270e937f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:46, skipping insertion in model container [2022-11-02 20:44:46,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:44:46" (1/1) ... [2022-11-02 20:44:46,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:44:46,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:44:48,237 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_53434859-d765-44a3-b6bf-63752cf74f8a/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[239738,239751] [2022-11-02 20:44:48,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:48,315 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:44:48,734 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_53434859-d765-44a3-b6bf-63752cf74f8a/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[239738,239751] [2022-11-02 20:44:48,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:44:48,844 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:44:48,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48 WrapperNode [2022-11-02 20:44:48,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:44:48,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:48,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:44:48,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:44:48,856 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:44:48" (1/1) ... [2022-11-02 20:44:48,956 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:44:48" (1/1) ... [2022-11-02 20:44:49,259 INFO L138 Inliner]: procedures = 260, calls = 1808, calls flagged for inlining = 104, calls inlined = 100, statements flattened = 4518 [2022-11-02 20:44:49,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:44:49,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:44:49,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:44:49,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:44:49,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,747 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:44:49,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:44:49,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:44:49,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:44:49,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (1/1) ... [2022-11-02 20:44:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:44:49,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:49,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:49,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53434859-d765-44a3-b6bf-63752cf74f8a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:44:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-02 20:44:49,995 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-02 20:44:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:44:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:44:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:44:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:44:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:44:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:44:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_delete [2022-11-02 20:44:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_delete [2022-11-02 20:44:50,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_11 [2022-11-02 20:44:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_11 [2022-11-02 20:44:50,001 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_wait [2022-11-02 20:44:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_wait [2022-11-02 20:44:50,001 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2022-11-02 20:44:50,002 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2022-11-02 20:44:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 20:44:50,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 20:44:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-11-02 20:44:50,002 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-11-02 20:44:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:44:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:44:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 20:44:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 20:44:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-11-02 20:44:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-11-02 20:44:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2022-11-02 20:44:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2022-11-02 20:44:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 20:44:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 20:44:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:44:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:44:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:44:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:44:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_49 [2022-11-02 20:44:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_49 [2022-11-02 20:44:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:44:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:44:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_detect_change [2022-11-02 20:44:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_detect_change [2022-11-02 20:44:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-02 20:44:50,025 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-02 20:44:50,025 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_cancel [2022-11-02 20:44:50,025 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_cancel [2022-11-02 20:44:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:44:50,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:44:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_init [2022-11-02 20:44:50,026 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_init [2022-11-02 20:44:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2022-11-02 20:44:50,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2022-11-02 20:44:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_26 [2022-11-02 20:44:50,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_26 [2022-11-02 20:44:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:44:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_28 [2022-11-02 20:44:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_28 [2022-11-02 20:44:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 20:44:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 20:44:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-11-02 20:44:50,042 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-11-02 20:44:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:44:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_12 [2022-11-02 20:44:50,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_12 [2022-11-02 20:44:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-02 20:44:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-02 20:44:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2022-11-02 20:44:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2022-11-02 20:44:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_disconnect [2022-11-02 20:44:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_disconnect [2022-11-02 20:44:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-11-02 20:44:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-11-02 20:44:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_3 [2022-11-02 20:44:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_3 [2022-11-02 20:44:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:44:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:44:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-02 20:44:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-02 20:44:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:44:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:44:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2022-11-02 20:44:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2022-11-02 20:44:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 20:44:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 20:44:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-02 20:44:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-02 20:44:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure add_offloaded_reg [2022-11-02 20:44:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure add_offloaded_reg [2022-11-02 20:44:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-11-02 20:44:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-11-02 20:44:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2022-11-02 20:44:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2022-11-02 20:44:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure roundup_to_multiple_of_64 [2022-11-02 20:44:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure roundup_to_multiple_of_64 [2022-11-02 20:44:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-11-02 20:44:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-11-02 20:44:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-02 20:44:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-02 20:44:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:44:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2022-11-02 20:44:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2022-11-02 20:44:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:44:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2022-11-02 20:44:50,048 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2022-11-02 20:44:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-11-02 20:44:50,048 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-11-02 20:44:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:44:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_6 [2022-11-02 20:44:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_6 [2022-11-02 20:44:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 20:44:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 20:44:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:44:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:44:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:44:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:44:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2022-11-02 20:44:50,050 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2022-11-02 20:44:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 20:44:50,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 20:44:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:44:50,050 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:44:50,050 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2022-11-02 20:44:50,051 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2022-11-02 20:44:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:44:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_response_error [2022-11-02 20:44:50,051 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_response_error [2022-11-02 20:44:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2022-11-02 20:44:50,051 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2022-11-02 20:44:50,051 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_free_host [2022-11-02 20:44:50,052 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_free_host [2022-11-02 20:44:50,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:44:50,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:44:50,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_31 [2022-11-02 20:44:50,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_31 [2022-11-02 20:44:50,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:44:50,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:44:50,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:44:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_6 [2022-11-02 20:44:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_6 [2022-11-02 20:44:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_queue_poll_work [2022-11-02 20:44:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_queue_poll_work [2022-11-02 20:44:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-02 20:44:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-02 20:44:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-11-02 20:44:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-11-02 20:44:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2022-11-02 20:44:50,054 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2022-11-02 20:44:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:44:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure sg_copy_to_buffer [2022-11-02 20:44:50,054 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_copy_to_buffer [2022-11-02 20:44:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_6 [2022-11-02 20:44:50,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_6 [2022-11-02 20:44:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put_8 [2022-11-02 20:44:50,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put_8 [2022-11-02 20:44:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:44:50,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:44:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:44:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure __download_offload_pseudocode [2022-11-02 20:44:50,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __download_offload_pseudocode [2022-11-02 20:44:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:44:50,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:44:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2022-11-02 20:44:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2022-11-02 20:44:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_InterfaceNumber [2022-11-02 20:44:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_InterfaceNumber [2022-11-02 20:44:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 20:44:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 20:44:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-02 20:44:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-02 20:44:50,058 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-02 20:44:50,059 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-02 20:44:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2022-11-02 20:44:50,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2022-11-02 20:44:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_3 [2022-11-02 20:44:50,059 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_3 [2022-11-02 20:44:50,060 INFO L130 BoogieDeclarations]: Found specification of procedure new_system_port_status [2022-11-02 20:44:50,060 INFO L138 BoogieDeclarations]: Found implementation of procedure new_system_port_status [2022-11-02 20:44:50,060 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_request_done [2022-11-02 20:44:50,060 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_request_done [2022-11-02 20:44:50,060 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-11-02 20:44:50,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-11-02 20:44:50,061 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-02 20:44:50,061 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-02 20:44:50,061 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2022-11-02 20:44:50,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2022-11-02 20:44:50,061 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-11-02 20:44:50,062 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-11-02 20:44:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-02 20:44:50,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-02 20:44:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_46 [2022-11-02 20:44:50,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_46 [2022-11-02 20:44:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 20:44:50,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 20:44:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:44:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-11-02 20:44:50,063 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-11-02 20:44:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_priv [2022-11-02 20:44:50,064 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_priv [2022-11-02 20:44:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-11-02 20:44:50,064 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-11-02 20:44:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_deadwork_thread [2022-11-02 20:44:50,064 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_deadwork_thread [2022-11-02 20:44:50,064 INFO L130 BoogieDeclarations]: Found specification of procedure check_vub300_port_status [2022-11-02 20:44:50,065 INFO L138 BoogieDeclarations]: Found implementation of procedure check_vub300_port_status [2022-11-02 20:44:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-02 20:44:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:44:50,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:44:50,845 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:44:50,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:44:52,601 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:44:57,601 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:44:57,628 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:44:57,628 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:44:57,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:57 BoogieIcfgContainer [2022-11-02 20:44:57,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:44:57,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:44:57,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:44:57,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:44:57,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:44:46" (1/3) ... [2022-11-02 20:44:57,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:57, skipping insertion in model container [2022-11-02 20:44:57,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:44:48" (2/3) ... [2022-11-02 20:44:57,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:44:57, skipping insertion in model container [2022-11-02 20:44:57,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:44:57" (3/3) ... [2022-11-02 20:44:57,644 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-5fdb450-1-144_1a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:44:57,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:44:57,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:44:57,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:44:57,770 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;@5f6225c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:44:57,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:44:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 1586 states, 1107 states have (on average 1.3965672990063234) internal successors, (1546), 1173 states have internal predecessors, (1546), 384 states have call successors, (384), 94 states have call predecessors, (384), 93 states have return successors, (375), 349 states have call predecessors, (375), 375 states have call successors, (375) [2022-11-02 20:44:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:44:57,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:57,802 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:57,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1754157023, now seen corresponding path program 1 times [2022-11-02 20:44:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:57,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622679270] [2022-11-02 20:44:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:44:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:44:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:44:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 20:44:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:58,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622679270] [2022-11-02 20:44:58,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622679270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:58,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:58,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:44:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183826665] [2022-11-02 20:44:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:58,804 INFO L87 Difference]: Start difference. First operand has 1586 states, 1107 states have (on average 1.3965672990063234) internal successors, (1546), 1173 states have internal predecessors, (1546), 384 states have call successors, (384), 94 states have call predecessors, (384), 93 states have return successors, (375), 349 states have call predecessors, (375), 375 states have call successors, (375) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:04,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:06,193 INFO L93 Difference]: Finished difference Result 3330 states and 4958 transitions. [2022-11-02 20:45:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:45:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-11-02 20:45:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:06,232 INFO L225 Difference]: With dead ends: 3330 [2022-11-02 20:45:06,237 INFO L226 Difference]: Without dead ends: 1732 [2022-11-02 20:45:06,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:06,256 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 1689 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 1526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1526 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:06,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 2934 Invalid, 2490 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1526 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-02 20:45:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-11-02 20:45:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1570. [2022-11-02 20:45:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1102 states have (on average 1.3874773139745917) internal successors, (1529), 1157 states have internal predecessors, (1529), 375 states have call successors, (375), 93 states have call predecessors, (375), 92 states have return successors, (371), 345 states have call predecessors, (371), 371 states have call successors, (371) [2022-11-02 20:45:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2275 transitions. [2022-11-02 20:45:06,460 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2275 transitions. Word has length 114 [2022-11-02 20:45:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:06,461 INFO L495 AbstractCegarLoop]: Abstraction has 1570 states and 2275 transitions. [2022-11-02 20:45:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2275 transitions. [2022-11-02 20:45:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:45:06,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:06,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:45:06,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 340574761, now seen corresponding path program 1 times [2022-11-02 20:45:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:06,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67492189] [2022-11-02 20:45:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:45:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:45:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 20:45:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:07,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67492189] [2022-11-02 20:45:07,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67492189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:07,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:07,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091219317] [2022-11-02 20:45:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:07,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:07,120 INFO L87 Difference]: Start difference. First operand 1570 states and 2275 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:15,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:17,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:19,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:24,277 INFO L93 Difference]: Finished difference Result 4978 states and 7479 transitions. [2022-11-02 20:45:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:45:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-11-02 20:45:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:24,303 INFO L225 Difference]: With dead ends: 4978 [2022-11-02 20:45:24,303 INFO L226 Difference]: Without dead ends: 3431 [2022-11-02 20:45:24,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:24,314 INFO L413 NwaCegarLoop]: 2629 mSDtfsCounter, 4041 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 3364 mSolverCounterSat, 2185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 5959 SdHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2185 IncrementalHoareTripleChecker+Valid, 3364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:24,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 5959 Invalid, 5549 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2185 Valid, 3364 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2022-11-02 20:45:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2022-11-02 20:45:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3138. [2022-11-02 20:45:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 2203 states have (on average 1.3858374943259193) internal successors, (3053), 2313 states have internal predecessors, (3053), 742 states have call successors, (742), 184 states have call predecessors, (742), 192 states have return successors, (790), 694 states have call predecessors, (790), 738 states have call successors, (790) [2022-11-02 20:45:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4585 transitions. [2022-11-02 20:45:24,537 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4585 transitions. Word has length 114 [2022-11-02 20:45:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:24,539 INFO L495 AbstractCegarLoop]: Abstraction has 3138 states and 4585 transitions. [2022-11-02 20:45:24,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4585 transitions. [2022-11-02 20:45:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:45:24,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:24,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:24,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:45:24,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1967333887, now seen corresponding path program 1 times [2022-11-02 20:45:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:24,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345181221] [2022-11-02 20:45:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:45:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:45:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 20:45:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:25,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345181221] [2022-11-02 20:45:25,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345181221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565091558] [2022-11-02 20:45:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:25,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:25,096 INFO L87 Difference]: Start difference. First operand 3138 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:35,191 INFO L93 Difference]: Finished difference Result 9582 states and 14467 transitions. [2022-11-02 20:45:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:45:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-11-02 20:45:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:35,241 INFO L225 Difference]: With dead ends: 9582 [2022-11-02 20:45:35,241 INFO L226 Difference]: Without dead ends: 6467 [2022-11-02 20:45:35,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:35,263 INFO L413 NwaCegarLoop]: 2334 mSDtfsCounter, 4963 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 3185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 4643 SdHoareTripleChecker+Invalid, 5415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3185 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:35,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 4643 Invalid, 5415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3185 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-11-02 20:45:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6467 states. [2022-11-02 20:45:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6467 to 5881. [2022-11-02 20:45:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5881 states, 4130 states have (on average 1.3917675544794188) internal successors, (5748), 4345 states have internal predecessors, (5748), 1383 states have call successors, (1383), 350 states have call predecessors, (1383), 367 states have return successors, (1481), 1291 states have call predecessors, (1481), 1379 states have call successors, (1481) [2022-11-02 20:45:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5881 states to 5881 states and 8612 transitions. [2022-11-02 20:45:35,607 INFO L78 Accepts]: Start accepts. Automaton has 5881 states and 8612 transitions. Word has length 115 [2022-11-02 20:45:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:35,607 INFO L495 AbstractCegarLoop]: Abstraction has 5881 states and 8612 transitions. [2022-11-02 20:45:35,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5881 states and 8612 transitions. [2022-11-02 20:45:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:45:35,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:35,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:35,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:45:35,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash 857264108, now seen corresponding path program 1 times [2022-11-02 20:45:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:35,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48548852] [2022-11-02 20:45:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:45:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:45:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 20:45:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:35,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48548852] [2022-11-02 20:45:35,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48548852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:35,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:35,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386608908] [2022-11-02 20:45:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:36,003 INFO L87 Difference]: Start difference. First operand 5881 states and 8612 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:43,156 INFO L93 Difference]: Finished difference Result 6462 states and 9660 transitions. [2022-11-02 20:45:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-11-02 20:45:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:43,207 INFO L225 Difference]: With dead ends: 6462 [2022-11-02 20:45:43,208 INFO L226 Difference]: Without dead ends: 6459 [2022-11-02 20:45:43,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:43,214 INFO L413 NwaCegarLoop]: 2034 mSDtfsCounter, 3618 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 1846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3837 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1846 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:43,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3837 Valid, 2849 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1846 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-02 20:45:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2022-11-02 20:45:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 5880. [2022-11-02 20:45:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5880 states, 4130 states have (on average 1.3915254237288135) internal successors, (5747), 4344 states have internal predecessors, (5747), 1382 states have call successors, (1382), 350 states have call predecessors, (1382), 367 states have return successors, (1481), 1291 states have call predecessors, (1481), 1379 states have call successors, (1481) [2022-11-02 20:45:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 8610 transitions. [2022-11-02 20:45:43,621 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 8610 transitions. Word has length 116 [2022-11-02 20:45:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:43,622 INFO L495 AbstractCegarLoop]: Abstraction has 5880 states and 8610 transitions. [2022-11-02 20:45:43,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 8610 transitions. [2022-11-02 20:45:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:45:43,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:43,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:45:43,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash 804844194, now seen corresponding path program 1 times [2022-11-02 20:45:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:43,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327530563] [2022-11-02 20:45:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:45:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:45:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 20:45:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:44,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327530563] [2022-11-02 20:45:44,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327530563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:44,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:44,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734347456] [2022-11-02 20:45:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:44,027 INFO L87 Difference]: Start difference. First operand 5880 states and 8610 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:50,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:51,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:55,519 INFO L93 Difference]: Finished difference Result 6461 states and 9658 transitions. [2022-11-02 20:45:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 117 [2022-11-02 20:45:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:55,562 INFO L225 Difference]: With dead ends: 6461 [2022-11-02 20:45:55,562 INFO L226 Difference]: Without dead ends: 6429 [2022-11-02 20:45:55,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:55,570 INFO L413 NwaCegarLoop]: 2036 mSDtfsCounter, 3105 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3323 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1368 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:55,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3323 Valid, 3519 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1368 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-11-02 20:45:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2022-11-02 20:45:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 5850. [2022-11-02 20:45:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5850 states, 4114 states have (on average 1.3920758385999028) internal successors, (5727), 4327 states have internal predecessors, (5727), 1369 states have call successors, (1369), 349 states have call predecessors, (1369), 366 states have return successors, (1469), 1279 states have call predecessors, (1469), 1367 states have call successors, (1469) [2022-11-02 20:45:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 8565 transitions. [2022-11-02 20:45:55,931 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 8565 transitions. Word has length 117 [2022-11-02 20:45:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:55,933 INFO L495 AbstractCegarLoop]: Abstraction has 5850 states and 8565 transitions. [2022-11-02 20:45:55,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:45:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 8565 transitions. [2022-11-02 20:45:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:45:55,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:55,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:45:55,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:45:55,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 604265189, now seen corresponding path program 1 times [2022-11-02 20:45:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:55,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751391561] [2022-11-02 20:45:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:45:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:45:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:45:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:45:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:45:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:45:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:45:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:45:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-02 20:45:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751391561] [2022-11-02 20:45:56,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751391561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:56,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:56,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:45:56,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442154565] [2022-11-02 20:45:56,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:56,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:56,376 INFO L87 Difference]: Start difference. First operand 5850 states and 8565 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:46:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:16,803 INFO L93 Difference]: Finished difference Result 20074 states and 30434 transitions. [2022-11-02 20:46:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:46:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2022-11-02 20:46:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:16,885 INFO L225 Difference]: With dead ends: 20074 [2022-11-02 20:46:16,885 INFO L226 Difference]: Without dead ends: 14247 [2022-11-02 20:46:16,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:46:16,918 INFO L413 NwaCegarLoop]: 2273 mSDtfsCounter, 6450 mSDsluCounter, 4549 mSDsCounter, 0 mSdLazyCounter, 6333 mSolverCounterSat, 5051 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6778 SdHoareTripleChecker+Valid, 6822 SdHoareTripleChecker+Invalid, 11384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5051 IncrementalHoareTripleChecker+Valid, 6333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:16,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6778 Valid, 6822 Invalid, 11384 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5051 Valid, 6333 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2022-11-02 20:46:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14247 states. [2022-11-02 20:46:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14247 to 12562. [2022-11-02 20:46:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 8738 states have (on average 1.384641794460975) internal successors, (12099), 9249 states have internal predecessors, (12099), 2943 states have call successors, (2943), 677 states have call predecessors, (2943), 880 states have return successors, (3810), 2917 states have call predecessors, (3810), 2941 states have call successors, (3810) [2022-11-02 20:46:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 18852 transitions. [2022-11-02 20:46:17,867 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 18852 transitions. Word has length 169 [2022-11-02 20:46:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:17,868 INFO L495 AbstractCegarLoop]: Abstraction has 12562 states and 18852 transitions. [2022-11-02 20:46:17,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:46:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 18852 transitions. [2022-11-02 20:46:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-02 20:46:17,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:17,904 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:17,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:46:17,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -563103977, now seen corresponding path program 1 times [2022-11-02 20:46:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128991183] [2022-11-02 20:46:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:46:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:46:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:46:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:46:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:46:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:46:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:46:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:46:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:46:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:46:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:46:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-11-02 20:46:18,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:18,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128991183] [2022-11-02 20:46:18,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128991183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:18,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:18,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:46:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117298373] [2022-11-02 20:46:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:46:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:46:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:18,554 INFO L87 Difference]: Start difference. First operand 12562 states and 18852 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:46:28,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:36,447 INFO L93 Difference]: Finished difference Result 29123 states and 44848 transitions. [2022-11-02 20:46:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:46:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 208 [2022-11-02 20:46:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:36,536 INFO L225 Difference]: With dead ends: 29123 [2022-11-02 20:46:36,536 INFO L226 Difference]: Without dead ends: 16584 [2022-11-02 20:46:36,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:46:36,596 INFO L413 NwaCegarLoop]: 2352 mSDtfsCounter, 5698 mSDsluCounter, 5204 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 4383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5963 SdHoareTripleChecker+Valid, 7556 SdHoareTripleChecker+Invalid, 9576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4383 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:36,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5963 Valid, 7556 Invalid, 9576 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4383 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-11-02 20:46:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16584 states. [2022-11-02 20:46:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16584 to 12576. [2022-11-02 20:46:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12576 states, 8752 states have (on average 1.384026508226691) internal successors, (12113), 9263 states have internal predecessors, (12113), 2943 states have call successors, (2943), 677 states have call predecessors, (2943), 880 states have return successors, (3810), 2917 states have call predecessors, (3810), 2941 states have call successors, (3810) [2022-11-02 20:46:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12576 states to 12576 states and 18866 transitions. [2022-11-02 20:46:37,660 INFO L78 Accepts]: Start accepts. Automaton has 12576 states and 18866 transitions. Word has length 208 [2022-11-02 20:46:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:37,661 INFO L495 AbstractCegarLoop]: Abstraction has 12576 states and 18866 transitions. [2022-11-02 20:46:37,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:46:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 12576 states and 18866 transitions. [2022-11-02 20:46:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-02 20:46:37,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:37,684 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:37,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:46:37,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -37150978, now seen corresponding path program 1 times [2022-11-02 20:46:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667134765] [2022-11-02 20:46:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:46:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:46:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:46:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:46:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:46:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:46:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:46:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 20:46:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 20:46:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 20:46:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 20:46:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:46:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-11-02 20:46:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667134765] [2022-11-02 20:46:38,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667134765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:38,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:38,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054795822] [2022-11-02 20:46:38,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:38,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:38,269 INFO L87 Difference]: Start difference. First operand 12576 states and 18866 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:46:50,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:51,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:47:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:06,147 INFO L93 Difference]: Finished difference Result 40481 states and 61702 transitions. [2022-11-02 20:47:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:47:06,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 225 [2022-11-02 20:47:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:06,386 INFO L225 Difference]: With dead ends: 40481 [2022-11-02 20:47:06,387 INFO L226 Difference]: Without dead ends: 27928 [2022-11-02 20:47:06,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:06,436 INFO L413 NwaCegarLoop]: 3461 mSDtfsCounter, 5433 mSDsluCounter, 5680 mSDsCounter, 0 mSdLazyCounter, 7141 mSolverCounterSat, 5185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5793 SdHoareTripleChecker+Valid, 9141 SdHoareTripleChecker+Invalid, 12326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5185 IncrementalHoareTripleChecker+Valid, 7141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:06,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5793 Valid, 9141 Invalid, 12326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5185 Valid, 7141 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2022-11-02 20:47:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27928 states. [2022-11-02 20:47:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27928 to 24675. [2022-11-02 20:47:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24675 states, 17196 states have (on average 1.3851477087694812) internal successors, (23819), 18197 states have internal predecessors, (23819), 5743 states have call successors, (5743), 1328 states have call predecessors, (5743), 1735 states have return successors, (7471), 5693 states have call predecessors, (7471), 5741 states have call successors, (7471) [2022-11-02 20:47:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24675 states to 24675 states and 37033 transitions. [2022-11-02 20:47:08,369 INFO L78 Accepts]: Start accepts. Automaton has 24675 states and 37033 transitions. Word has length 225 [2022-11-02 20:47:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:08,370 INFO L495 AbstractCegarLoop]: Abstraction has 24675 states and 37033 transitions. [2022-11-02 20:47:08,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:47:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24675 states and 37033 transitions. [2022-11-02 20:47:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-11-02 20:47:08,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:08,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:08,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:08,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash -67567646, now seen corresponding path program 1 times [2022-11-02 20:47:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:08,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342378287] [2022-11-02 20:47:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:47:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:47:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:47:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:47:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:47:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:47:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 20:47:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 20:47:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:47:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:47:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-02 20:47:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 20:47:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:47:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-02 20:47:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:47:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 20:47:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-02 20:47:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-11-02 20:47:09,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:09,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342378287] [2022-11-02 20:47:09,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342378287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:09,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:09,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375054951] [2022-11-02 20:47:09,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:09,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:09,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:09,397 INFO L87 Difference]: Start difference. First operand 24675 states and 37033 transitions. Second operand has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-02 20:47:23,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:47:24,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:47:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:35,638 INFO L93 Difference]: Finished difference Result 42234 states and 63906 transitions. [2022-11-02 20:47:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:47:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 251 [2022-11-02 20:47:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:35,740 INFO L225 Difference]: With dead ends: 42234 [2022-11-02 20:47:35,740 INFO L226 Difference]: Without dead ends: 17371 [2022-11-02 20:47:35,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:35,826 INFO L413 NwaCegarLoop]: 1993 mSDtfsCounter, 2405 mSDsluCounter, 6520 mSDsCounter, 0 mSdLazyCounter, 8647 mSolverCounterSat, 2201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2551 SdHoareTripleChecker+Valid, 8513 SdHoareTripleChecker+Invalid, 10848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2201 IncrementalHoareTripleChecker+Valid, 8647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:35,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2551 Valid, 8513 Invalid, 10848 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2201 Valid, 8647 Invalid, 0 Unknown, 0 Unchecked, 24.2s Time] [2022-11-02 20:47:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17371 states. [2022-11-02 20:47:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17371 to 15289. [2022-11-02 20:47:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15289 states, 10641 states have (on average 1.3824828493562635) internal successors, (14711), 11263 states have internal predecessors, (14711), 3559 states have call successors, (3559), 834 states have call predecessors, (3559), 1088 states have return successors, (4632), 3525 states have call predecessors, (4632), 3557 states have call successors, (4632) [2022-11-02 20:47:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15289 states to 15289 states and 22902 transitions. [2022-11-02 20:47:37,147 INFO L78 Accepts]: Start accepts. Automaton has 15289 states and 22902 transitions. Word has length 251 [2022-11-02 20:47:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:37,148 INFO L495 AbstractCegarLoop]: Abstraction has 15289 states and 22902 transitions. [2022-11-02 20:47:37,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (24), 8 states have call predecessors, (24), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-02 20:47:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 15289 states and 22902 transitions. [2022-11-02 20:47:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-02 20:47:37,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,200 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:47:37,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash 214519940, now seen corresponding path program 1 times [2022-11-02 20:47:37,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067768116] [2022-11-02 20:47:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:47:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:47:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:47:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:47:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:47:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:47:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:47:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:47:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:47:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:47:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:47:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:47:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:47:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 20:47:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:47:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:47:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:47:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:47:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:47:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:47:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:47:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-02 20:47:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067768116] [2022-11-02 20:47:38,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067768116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:38,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:38,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475422111] [2022-11-02 20:47:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:38,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:38,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:38,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:38,763 INFO L87 Difference]: Start difference. First operand 15289 states and 22902 transitions. Second operand has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-11-02 20:47:51,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:48:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:03,462 INFO L93 Difference]: Finished difference Result 32633 states and 49455 transitions. [2022-11-02 20:48:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 281 [2022-11-02 20:48:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:03,568 INFO L225 Difference]: With dead ends: 32633 [2022-11-02 20:48:03,568 INFO L226 Difference]: Without dead ends: 17377 [2022-11-02 20:48:03,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:48:03,765 INFO L413 NwaCegarLoop]: 1865 mSDtfsCounter, 3967 mSDsluCounter, 3858 mSDsCounter, 0 mSdLazyCounter, 6014 mSolverCounterSat, 2459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 8473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2459 IncrementalHoareTripleChecker+Valid, 6014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:03,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 5723 Invalid, 8473 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2459 Valid, 6014 Invalid, 0 Unknown, 0 Unchecked, 22.3s Time] [2022-11-02 20:48:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17377 states. [2022-11-02 20:48:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17377 to 15269. [2022-11-02 20:48:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15269 states, 10631 states have (on average 1.3819019847615464) internal successors, (14691), 11253 states have internal predecessors, (14691), 3549 states have call successors, (3549), 834 states have call predecessors, (3549), 1088 states have return successors, (4602), 3515 states have call predecessors, (4602), 3547 states have call successors, (4602) [2022-11-02 20:48:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15269 states to 15269 states and 22842 transitions. [2022-11-02 20:48:05,309 INFO L78 Accepts]: Start accepts. Automaton has 15269 states and 22842 transitions. Word has length 281 [2022-11-02 20:48:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,309 INFO L495 AbstractCegarLoop]: Abstraction has 15269 states and 22842 transitions. [2022-11-02 20:48:05,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-11-02 20:48:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15269 states and 22842 transitions. [2022-11-02 20:48:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-02 20:48:05,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:48:05,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1511917438, now seen corresponding path program 1 times [2022-11-02 20:48:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:05,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093892909] [2022-11-02 20:48:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:48:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:48:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:48:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:48:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:48:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:48:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:48:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:48:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:48:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:48:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:48:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:48:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:48:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:48:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:48:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 20:48:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:48:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:48:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:48:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:48:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:48:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:48:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:48:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-02 20:48:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093892909] [2022-11-02 20:48:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093892909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:06,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:06,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522746820] [2022-11-02 20:48:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:06,595 INFO L87 Difference]: Start difference. First operand 15269 states and 22842 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 10 states have call predecessors, (35), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)