./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/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_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/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_332c063a-d867-40cd-aa8e-4a00e9981529/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 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc --- 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:39:17,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:39:17,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:39:17,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:39:17,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:39:17,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:39:17,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:39:17,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:39:17,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:39:17,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:39:17,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:39:17,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:39:17,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:39:17,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:39:17,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:39:17,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:39:17,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:39:17,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:39:17,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:39:17,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:39:17,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:39:17,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:39:17,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:39:17,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:39:17,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:39:17,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:39:17,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:39:17,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:39:17,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:39:17,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:39:17,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:39:17,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:39:17,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:39:17,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:39:17,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:39:17,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:39:17,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:39:17,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:39:17,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:39:17,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:39:17,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:39:17,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:39:17,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:39:17,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:39:17,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:39:17,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:39:17,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:39:17,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:39:17,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:39:17,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:39:17,686 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:39:17,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:39:17,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:39:17,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:39:17,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:39:17,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:39:17,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:39:17,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:39:17,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:39:17,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:39:17,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:39:17,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:39:17,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:39:17,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:39:17,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:39:17,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:39:17,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:39:17,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:39:17,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:39:17,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:39:17,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:39:17,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:39:17,692 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_332c063a-d867-40cd-aa8e-4a00e9981529/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_332c063a-d867-40cd-aa8e-4a00e9981529/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 -> 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc [2022-11-02 20:39:17,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:39:18,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:39:18,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:39:18,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:39:18,033 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:39:18,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-11-02 20:39:18,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/data/b0b6f1c09/3e809f77fc344ed684d1ff96041c1ec5/FLAGd9b8a46bf [2022-11-02 20:39:18,994 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:39:18,995 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-11-02 20:39:19,039 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/data/b0b6f1c09/3e809f77fc344ed684d1ff96041c1ec5/FLAGd9b8a46bf [2022-11-02 20:39:19,093 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/data/b0b6f1c09/3e809f77fc344ed684d1ff96041c1ec5 [2022-11-02 20:39:19,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:39:19,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:39:19,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:39:19,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:39:19,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:39:19,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:39:19" (1/1) ... [2022-11-02 20:39:19,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5397467c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:19, skipping insertion in model container [2022-11-02 20:39:19,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:39:19" (1/1) ... [2022-11-02 20:39:19,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:39:19,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:39:20,431 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_332c063a-d867-40cd-aa8e-4a00e9981529/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-11-02 20:39:21,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:39:21,198 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:39:21,398 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_332c063a-d867-40cd-aa8e-4a00e9981529/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-11-02 20:39:21,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:39:21,836 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:39:21,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21 WrapperNode [2022-11-02 20:39:21,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:39:21,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:39:21,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:39:21,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:39:21,852 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:39:21" (1/1) ... [2022-11-02 20:39:21,977 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:39:21" (1/1) ... [2022-11-02 20:39:22,185 INFO L138 Inliner]: procedures = 220, calls = 1799, calls flagged for inlining = 81, calls inlined = 72, statements flattened = 3206 [2022-11-02 20:39:22,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:39:22,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:39:22,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:39:22,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:39:22,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:39:22,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:39:22,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:39:22,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:39:22,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (1/1) ... [2022-11-02 20:39:22,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:39:22,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:39:22,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:39:22,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:39:22,728 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_u32 [2022-11-02 20:39:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_u32 [2022-11-02 20:39:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_xmit [2022-11-02 20:39:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_xmit [2022-11-02 20:39:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:39:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:39:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:39:22,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:39:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2022-11-02 20:39:22,731 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2022-11-02 20:39:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_start_tx [2022-11-02 20:39:22,731 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_start_tx [2022-11-02 20:39:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:39:22,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:39:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-11-02 20:39:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-11-02 20:39:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_bits [2022-11-02 20:39:22,734 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_bits [2022-11-02 20:39:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-02 20:39:22,734 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-02 20:39:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-02 20:39:22,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-02 20:39:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure dump_stack [2022-11-02 20:39:22,735 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_stack [2022-11-02 20:39:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:39:22,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:39:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_4 [2022-11-02 20:39:22,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_4 [2022-11-02 20:39:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-02 20:39:22,736 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-02 20:39:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-11-02 20:39:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-11-02 20:39:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:39:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:39:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:39:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:39:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:39:22,738 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:39:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_fill_info [2022-11-02 20:39:22,739 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_fill_info [2022-11-02 20:39:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:39:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 20:39:22,739 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 20:39:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc [2022-11-02 20:39:22,740 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc [2022-11-02 20:39:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_update_aggregation_stats [2022-11-02 20:39:22,741 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_update_aggregation_stats [2022-11-02 20:39:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:39:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-02 20:39:22,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-02 20:39:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:39:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_frm [2022-11-02 20:39:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_frm [2022-11-02 20:39:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:39:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 20:39:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 20:39:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_dequeue [2022-11-02 20:39:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_dequeue [2022-11-02 20:39:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:39:22,746 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:39:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-02 20:39:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-02 20:39:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-02 20:39:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-02 20:39:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc_len [2022-11-02 20:39:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc_len [2022-11-02 20:39:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:39:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:39:22,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:39:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_queue_len [2022-11-02 20:39:22,748 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_queue_len [2022-11-02 20:39:22,750 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:39:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:39:22,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:39:22,750 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-02 20:39:22,751 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-02 20:39:22,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:39:22,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_21 [2022-11-02 20:39:22,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_21 [2022-11-02 20:39:22,751 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-02 20:39:22,752 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-02 20:39:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:39:22,752 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:39:22,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-02 20:39:22,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-02 20:39:22,753 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-02 20:39:22,753 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-02 20:39:22,753 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_get_size [2022-11-02 20:39:22,754 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_get_size [2022-11-02 20:39:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_netlink_parms [2022-11-02 20:39:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_netlink_parms [2022-11-02 20:39:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-11-02 20:39:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-11-02 20:39:22,756 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:39:22,756 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:39:22,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:39:22,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:39:22,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:39:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:39:22,758 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-11-02 20:39:22,759 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-11-02 20:39:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-02 20:39:22,759 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-02 20:39:22,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-02 20:39:22,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-02 20:39:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:39:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-02 20:39:22,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-02 20:39:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_changelink [2022-11-02 20:39:22,761 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_changelink [2022-11-02 20:39:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:39:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-02 20:39:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-02 20:39:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-02 20:39:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:39:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:39:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-11-02 20:39:22,763 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-11-02 20:39:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_open [2022-11-02 20:39:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_open [2022-11-02 20:39:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_done [2022-11-02 20:39:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_done [2022-11-02 20:39:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-02 20:39:22,769 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-02 20:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_is_locked [2022-11-02 20:39:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_is_locked [2022-11-02 20:39:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-11-02 20:39:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-11-02 20:39:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_can_send_aggregate [2022-11-02 20:39:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_can_send_aggregate [2022-11-02 20:39:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:39:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:39:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:39:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:39:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-02 20:39:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-02 20:39:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-02 20:39:22,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-02 20:39:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-11-02 20:39:22,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-11-02 20:39:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-02 20:39:22,781 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-02 20:39:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_newlink [2022-11-02 20:39:22,781 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_newlink [2022-11-02 20:39:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-11-02 20:39:22,781 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-11-02 20:39:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:39:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-11-02 20:39:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-11-02 20:39:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_close [2022-11-02 20:39:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_close [2022-11-02 20:39:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-11-02 20:39:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-11-02 20:39:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_abort_tx [2022-11-02 20:39:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_abort_tx [2022-11-02 20:39:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-11-02 20:39:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-11-02 20:39:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:39:22,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:39:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-02 20:39:22,784 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-02 20:39:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-11-02 20:39:22,784 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-11-02 20:39:23,634 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:39:23,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:39:24,420 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:39:28,290 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:39:28,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:39:28,308 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:39:28,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:39:28 BoogieIcfgContainer [2022-11-02 20:39:28,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:39:28,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:39:28,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:39:28,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:39:28,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:39:19" (1/3) ... [2022-11-02 20:39:28,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ea5976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:39:28, skipping insertion in model container [2022-11-02 20:39:28,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:39:21" (2/3) ... [2022-11-02 20:39:28,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ea5976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:39:28, skipping insertion in model container [2022-11-02 20:39:28,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:39:28" (3/3) ... [2022-11-02 20:39:28,325 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-11-02 20:39:28,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:39:28,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:39:28,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:39:28,493 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;@38d1139e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:39:28,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:39:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 1077 states, 748 states have (on average 1.3302139037433156) internal successors, (995), 767 states have internal predecessors, (995), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) [2022-11-02 20:39:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:39:28,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:39:28,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:39:28,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:39:28,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1207697296, now seen corresponding path program 1 times [2022-11-02 20:39:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:28,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249950773] [2022-11-02 20:39:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:39:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:39:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:29,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249950773] [2022-11-02 20:39:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249950773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:29,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:29,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:39:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145742647] [2022-11-02 20:39:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:29,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:39:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:29,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:39:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:39:29,870 INFO L87 Difference]: Start difference. First operand has 1077 states, 748 states have (on average 1.3302139037433156) internal successors, (995), 767 states have internal predecessors, (995), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:39:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:39:37,267 INFO L93 Difference]: Finished difference Result 3524 states and 5199 transitions. [2022-11-02 20:39:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:39:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-02 20:39:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:39:37,319 INFO L225 Difference]: With dead ends: 3524 [2022-11-02 20:39:37,319 INFO L226 Difference]: Without dead ends: 2417 [2022-11-02 20:39:37,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:39:37,341 INFO L413 NwaCegarLoop]: 1813 mSDtfsCounter, 2047 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 6425 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:39:37,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 6425 Invalid, 3363 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [738 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-02 20:39:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-11-02 20:39:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2213. [2022-11-02 20:39:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1544 states have (on average 1.3180051813471503) internal successors, (2035), 1577 states have internal predecessors, (2035), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-11-02 20:39:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3140 transitions. [2022-11-02 20:39:37,796 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3140 transitions. Word has length 39 [2022-11-02 20:39:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:39:37,797 INFO L495 AbstractCegarLoop]: Abstraction has 2213 states and 3140 transitions. [2022-11-02 20:39:37,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:39:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3140 transitions. [2022-11-02 20:39:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-02 20:39:37,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:39:37,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-02 20:39:37,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:39:37,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:39:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1372830722, now seen corresponding path program 1 times [2022-11-02 20:39:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:37,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432148516] [2022-11-02 20:39:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:39:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:39:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:39:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:39:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:39:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:39:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:39:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:39:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:39:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:40,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432148516] [2022-11-02 20:39:40,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432148516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:40,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:40,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:39:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890416167] [2022-11-02 20:39:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:39:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:39:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:39:40,618 INFO L87 Difference]: Start difference. First operand 2213 states and 3140 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:39:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:39:52,007 INFO L93 Difference]: Finished difference Result 4788 states and 7042 transitions. [2022-11-02 20:39:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:39:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2022-11-02 20:39:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:39:52,042 INFO L225 Difference]: With dead ends: 4788 [2022-11-02 20:39:52,042 INFO L226 Difference]: Without dead ends: 2585 [2022-11-02 20:39:52,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:39:52,059 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 481 mSDsluCounter, 8439 mSDsCounter, 0 mSdLazyCounter, 5269 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 9896 SdHoareTripleChecker+Invalid, 5620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 5269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:39:52,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 9896 Invalid, 5620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [351 Valid, 5269 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-02 20:39:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2022-11-02 20:39:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2241. [2022-11-02 20:39:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1566 states have (on average 1.3148148148148149) internal successors, (2059), 1600 states have internal predecessors, (2059), 518 states have call successors, (518), 141 states have call predecessors, (518), 156 states have return successors, (612), 528 states have call predecessors, (612), 517 states have call successors, (612) [2022-11-02 20:39:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3189 transitions. [2022-11-02 20:39:52,279 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3189 transitions. Word has length 126 [2022-11-02 20:39:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:39:52,282 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3189 transitions. [2022-11-02 20:39:52,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:39:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3189 transitions. [2022-11-02 20:39:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 20:39:52,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:39:52,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-02 20:39:52,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:39:52,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:39:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 828082038, now seen corresponding path program 1 times [2022-11-02 20:39:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:52,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911156155] [2022-11-02 20:39:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:39:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:39:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:39:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:39:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:39:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:39:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:39:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:39:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:39:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:53,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911156155] [2022-11-02 20:39:53,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911156155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:39:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150146470] [2022-11-02 20:39:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:39:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:39:53,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:39:53,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:39:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:54,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:39:54,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:39:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:39:54,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:39:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:39:55,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150146470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:39:55,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:39:55,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 9 [2022-11-02 20:39:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359731810] [2022-11-02 20:39:55,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:39:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:39:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:39:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:39:55,177 INFO L87 Difference]: Start difference. First operand 2241 states and 3189 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 6 states have internal predecessors, (98), 4 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-02 20:40:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:02,616 INFO L93 Difference]: Finished difference Result 4892 states and 7224 transitions. [2022-11-02 20:40:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:40:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 6 states have internal predecessors, (98), 4 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 127 [2022-11-02 20:40:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:02,641 INFO L225 Difference]: With dead ends: 4892 [2022-11-02 20:40:02,641 INFO L226 Difference]: Without dead ends: 2661 [2022-11-02 20:40:02,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:40:02,657 INFO L413 NwaCegarLoop]: 1506 mSDtfsCounter, 511 mSDsluCounter, 3305 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 4811 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:02,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 4811 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-02 20:40:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2022-11-02 20:40:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2313. [2022-11-02 20:40:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1630 states have (on average 1.3061349693251534) internal successors, (2129), 1657 states have internal predecessors, (2129), 526 states have call successors, (526), 141 states have call predecessors, (526), 156 states have return successors, (639), 543 states have call predecessors, (639), 525 states have call successors, (639) [2022-11-02 20:40:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3294 transitions. [2022-11-02 20:40:02,867 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3294 transitions. Word has length 127 [2022-11-02 20:40:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:02,868 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3294 transitions. [2022-11-02 20:40:02,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 6 states have internal predecessors, (98), 4 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-02 20:40:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3294 transitions. [2022-11-02 20:40:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:40:02,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:02,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_332c063a-d867-40cd-aa8e-4a00e9981529/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:03,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1635970812, now seen corresponding path program 1 times [2022-11-02 20:40:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:03,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057586305] [2022-11-02 20:40:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:40:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:40:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:40:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:40:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:40:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:40:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:40:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:05,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057586305] [2022-11-02 20:40:05,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057586305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:05,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:05,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:40:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401734275] [2022-11-02 20:40:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:05,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:40:05,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:05,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:40:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:40:05,253 INFO L87 Difference]: Start difference. First operand 2313 states and 3294 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:40:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:13,394 INFO L93 Difference]: Finished difference Result 4986 states and 7307 transitions. [2022-11-02 20:40:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:40:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2022-11-02 20:40:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:13,420 INFO L225 Difference]: With dead ends: 4986 [2022-11-02 20:40:13,421 INFO L226 Difference]: Without dead ends: 2683 [2022-11-02 20:40:13,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:40:13,438 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 833 mSDsluCounter, 7168 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 8678 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:13,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 8678 Invalid, 4874 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [645 Valid, 4229 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-02 20:40:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2022-11-02 20:40:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2331. [2022-11-02 20:40:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2331 states, 1646 states have (on average 1.3043742405832321) internal successors, (2147), 1673 states have internal predecessors, (2147), 526 states have call successors, (526), 141 states have call predecessors, (526), 158 states have return successors, (648), 545 states have call predecessors, (648), 525 states have call successors, (648) [2022-11-02 20:40:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 3321 transitions. [2022-11-02 20:40:13,645 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 3321 transitions. Word has length 136 [2022-11-02 20:40:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:13,646 INFO L495 AbstractCegarLoop]: Abstraction has 2331 states and 3321 transitions. [2022-11-02 20:40:13,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:40:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3321 transitions. [2022-11-02 20:40:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-02 20:40:13,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:13,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:40:13,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1432107075, now seen corresponding path program 1 times [2022-11-02 20:40:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300300005] [2022-11-02 20:40:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:40:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:40:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:40:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:40:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:40:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:40:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:40:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:40:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300300005] [2022-11-02 20:40:14,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300300005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:14,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:14,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792342968] [2022-11-02 20:40:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:40:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:40:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:40:14,612 INFO L87 Difference]: Start difference. First operand 2331 states and 3321 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:40:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:20,281 INFO L93 Difference]: Finished difference Result 5022 states and 7353 transitions. [2022-11-02 20:40:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 147 [2022-11-02 20:40:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:20,306 INFO L225 Difference]: With dead ends: 5022 [2022-11-02 20:40:20,306 INFO L226 Difference]: Without dead ends: 2701 [2022-11-02 20:40:20,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:20,322 INFO L413 NwaCegarLoop]: 1505 mSDtfsCounter, 761 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:20,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 3776 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 20:40:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2022-11-02 20:40:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2343. [2022-11-02 20:40:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1656 states have (on average 1.303743961352657) internal successors, (2159), 1683 states have internal predecessors, (2159), 528 states have call successors, (528), 141 states have call predecessors, (528), 158 states have return successors, (655), 547 states have call predecessors, (655), 527 states have call successors, (655) [2022-11-02 20:40:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3342 transitions. [2022-11-02 20:40:20,540 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3342 transitions. Word has length 147 [2022-11-02 20:40:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:20,542 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 3342 transitions. [2022-11-02 20:40:20,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:40:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3342 transitions. [2022-11-02 20:40:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 20:40:20,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:20,555 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:20,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:20,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1266616076, now seen corresponding path program 1 times [2022-11-02 20:40:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:20,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713495803] [2022-11-02 20:40:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:40:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:40:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:40:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:40:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:40:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:40:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:40:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:40:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:40:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:40:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:40:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:21,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713495803] [2022-11-02 20:40:21,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713495803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:21,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:21,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:40:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675445837] [2022-11-02 20:40:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:21,203 INFO L87 Difference]: Start difference. First operand 2343 states and 3342 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:40:23,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:29,424 INFO L93 Difference]: Finished difference Result 6739 states and 9712 transitions. [2022-11-02 20:40:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:40:29,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-11-02 20:40:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:29,462 INFO L225 Difference]: With dead ends: 6739 [2022-11-02 20:40:29,463 INFO L226 Difference]: Without dead ends: 4406 [2022-11-02 20:40:29,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:40:29,479 INFO L413 NwaCegarLoop]: 1606 mSDtfsCounter, 2229 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:29,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 3960 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-11-02 20:40:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2022-11-02 20:40:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3842. [2022-11-02 20:40:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3842 states, 2776 states have (on average 1.3126801152737753) internal successors, (3644), 2813 states have internal predecessors, (3644), 799 states have call successors, (799), 235 states have call predecessors, (799), 266 states have return successors, (1005), 836 states have call predecessors, (1005), 798 states have call successors, (1005) [2022-11-02 20:40:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5448 transitions. [2022-11-02 20:40:30,005 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5448 transitions. Word has length 162 [2022-11-02 20:40:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:30,006 INFO L495 AbstractCegarLoop]: Abstraction has 3842 states and 5448 transitions. [2022-11-02 20:40:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:40:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5448 transitions. [2022-11-02 20:40:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-02 20:40:30,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:30,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:40:30,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1586714354, now seen corresponding path program 1 times [2022-11-02 20:40:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:30,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293969253] [2022-11-02 20:40:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:40:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:40:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:40:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:40:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:40:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:40:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:40:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:40:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:40:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:40:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:40:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:40:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:31,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293969253] [2022-11-02 20:40:31,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293969253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:31,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:31,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:40:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467080487] [2022-11-02 20:40:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:31,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:40:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:40:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:31,557 INFO L87 Difference]: Start difference. First operand 3842 states and 5448 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-02 20:40:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:44,257 INFO L93 Difference]: Finished difference Result 13160 states and 19341 transitions. [2022-11-02 20:40:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:40:44,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 179 [2022-11-02 20:40:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:44,335 INFO L225 Difference]: With dead ends: 13160 [2022-11-02 20:40:44,335 INFO L226 Difference]: Without dead ends: 9328 [2022-11-02 20:40:44,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:40:44,363 INFO L413 NwaCegarLoop]: 2089 mSDtfsCounter, 3893 mSDsluCounter, 5553 mSDsCounter, 0 mSdLazyCounter, 5182 mSolverCounterSat, 2676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 7642 SdHoareTripleChecker+Invalid, 7858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2676 IncrementalHoareTripleChecker+Valid, 5182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:44,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 7642 Invalid, 7858 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2676 Valid, 5182 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-11-02 20:40:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9328 states. [2022-11-02 20:40:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9328 to 7916. [2022-11-02 20:40:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7916 states, 5721 states have (on average 1.311658800908932) internal successors, (7504), 5817 states have internal predecessors, (7504), 1646 states have call successors, (1646), 461 states have call predecessors, (1646), 548 states have return successors, (2273), 1733 states have call predecessors, (2273), 1645 states have call successors, (2273) [2022-11-02 20:40:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 11423 transitions. [2022-11-02 20:40:45,204 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 11423 transitions. Word has length 179 [2022-11-02 20:40:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:45,205 INFO L495 AbstractCegarLoop]: Abstraction has 7916 states and 11423 transitions. [2022-11-02 20:40:45,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 5 states have internal predecessors, (120), 4 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-02 20:40:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 11423 transitions. [2022-11-02 20:40:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-02 20:40:45,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:45,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:40:45,229 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 794368852, now seen corresponding path program 1 times [2022-11-02 20:40:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:45,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103204847] [2022-11-02 20:40:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:40:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:40:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:40:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:40:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:40:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:40:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:40:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:40:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:40:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:40:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:40:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:40:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:46,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103204847] [2022-11-02 20:40:46,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103204847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:46,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:46,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:40:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582171612] [2022-11-02 20:40:46,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:46,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:40:46,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:46,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:40:46,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:46,468 INFO L87 Difference]: Start difference. First operand 7916 states and 11423 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:40:51,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:41:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:01,886 INFO L93 Difference]: Finished difference Result 16962 states and 24823 transitions. [2022-11-02 20:41:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 180 [2022-11-02 20:41:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:01,953 INFO L225 Difference]: With dead ends: 16962 [2022-11-02 20:41:01,954 INFO L226 Difference]: Without dead ends: 9056 [2022-11-02 20:41:01,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:01,998 INFO L413 NwaCegarLoop]: 1503 mSDtfsCounter, 494 mSDsluCounter, 5014 mSDsCounter, 0 mSdLazyCounter, 4727 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 6517 SdHoareTripleChecker+Invalid, 5056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:01,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 6517 Invalid, 5056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4727 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-11-02 20:41:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9056 states. [2022-11-02 20:41:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9056 to 8020. [2022-11-02 20:41:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8020 states, 5809 states have (on average 1.3124462041659495) internal successors, (7624), 5897 states have internal predecessors, (7624), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 556 states have return successors, (2313), 1757 states have call predecessors, (2313), 1653 states have call successors, (2313) [2022-11-02 20:41:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 11591 transitions. [2022-11-02 20:41:02,774 INFO L78 Accepts]: Start accepts. Automaton has 8020 states and 11591 transitions. Word has length 180 [2022-11-02 20:41:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:02,775 INFO L495 AbstractCegarLoop]: Abstraction has 8020 states and 11591 transitions. [2022-11-02 20:41:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:41:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 8020 states and 11591 transitions. [2022-11-02 20:41:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-02 20:41:02,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:02,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:41:02,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:41:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1728406840, now seen corresponding path program 1 times [2022-11-02 20:41:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:02,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322351868] [2022-11-02 20:41:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:41:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:41:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:41:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:41:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:41:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:41:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:41:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:41:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:41:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:41:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:41:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:41:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:04,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322351868] [2022-11-02 20:41:04,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322351868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:04,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:41:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011796768] [2022-11-02 20:41:04,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:04,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:41:04,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:04,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:41:04,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:04,856 INFO L87 Difference]: Start difference. First operand 8020 states and 11591 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 8 states have internal predecessors, (112), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:41:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:41:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:23,829 INFO L93 Difference]: Finished difference Result 16810 states and 24662 transitions. [2022-11-02 20:41:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 20:41:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 8 states have internal predecessors, (112), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2022-11-02 20:41:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:23,886 INFO L225 Difference]: With dead ends: 16810 [2022-11-02 20:41:23,886 INFO L226 Difference]: Without dead ends: 8800 [2022-11-02 20:41:23,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:41:23,927 INFO L413 NwaCegarLoop]: 2039 mSDtfsCounter, 3120 mSDsluCounter, 12179 mSDsCounter, 0 mSdLazyCounter, 10422 mSolverCounterSat, 1933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 14218 SdHoareTripleChecker+Invalid, 12355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1933 IncrementalHoareTripleChecker+Valid, 10422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:23,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 14218 Invalid, 12355 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1933 Valid, 10422 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2022-11-02 20:41:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8800 states. [2022-11-02 20:41:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8800 to 8060. [2022-11-02 20:41:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8060 states, 5837 states have (on average 1.3109474044886071) internal successors, (7652), 5929 states have internal predecessors, (7652), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 568 states have return successors, (2403), 1765 states have call predecessors, (2403), 1653 states have call successors, (2403) [2022-11-02 20:41:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 11709 transitions. [2022-11-02 20:41:24,777 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 11709 transitions. Word has length 166 [2022-11-02 20:41:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,778 INFO L495 AbstractCegarLoop]: Abstraction has 8060 states and 11709 transitions. [2022-11-02 20:41:24,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 8 states have internal predecessors, (112), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:41:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 11709 transitions. [2022-11-02 20:41:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-02 20:41:24,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,804 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:24,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:41:24,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:41:24,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1651668117, now seen corresponding path program 1 times [2022-11-02 20:41:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084152669] [2022-11-02 20:41:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:41:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:41:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:41:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:41:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:41:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:41:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:41:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:41:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:41:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:41:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:41:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:41:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:41:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:27,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084152669] [2022-11-02 20:41:27,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084152669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:27,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:27,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:41:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901241534] [2022-11-02 20:41:27,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:27,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:41:27,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:41:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:27,018 INFO L87 Difference]: Start difference. First operand 8060 states and 11709 transitions. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 20:41:31,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:41:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:47,574 INFO L93 Difference]: Finished difference Result 16798 states and 25055 transitions. [2022-11-02 20:41:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:41:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) Word has length 173 [2022-11-02 20:41:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:47,621 INFO L225 Difference]: With dead ends: 16798 [2022-11-02 20:41:47,621 INFO L226 Difference]: Without dead ends: 8748 [2022-11-02 20:41:47,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:41:47,662 INFO L413 NwaCegarLoop]: 2061 mSDtfsCounter, 3108 mSDsluCounter, 15168 mSDsCounter, 0 mSdLazyCounter, 12566 mSolverCounterSat, 1949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 17229 SdHoareTripleChecker+Invalid, 14515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1949 IncrementalHoareTripleChecker+Valid, 12566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:47,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3328 Valid, 17229 Invalid, 14515 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1949 Valid, 12566 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2022-11-02 20:41:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2022-11-02 20:41:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 8034. [2022-11-02 20:41:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8034 states, 5817 states have (on average 1.3099535843218153) internal successors, (7620), 5909 states have internal predecessors, (7620), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 562 states have return successors, (2355), 1759 states have call predecessors, (2355), 1653 states have call successors, (2355) [2022-11-02 20:41:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8034 states to 8034 states and 11629 transitions. [2022-11-02 20:41:48,385 INFO L78 Accepts]: Start accepts. Automaton has 8034 states and 11629 transitions. Word has length 173 [2022-11-02 20:41:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:48,386 INFO L495 AbstractCegarLoop]: Abstraction has 8034 states and 11629 transitions. [2022-11-02 20:41:48,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 20:41:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8034 states and 11629 transitions. [2022-11-02 20:41:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-02 20:41:48,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:48,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 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] [2022-11-02 20:41:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:41:48,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:41:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1474545579, now seen corresponding path program 1 times [2022-11-02 20:41:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:48,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829176771] [2022-11-02 20:41:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:41:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:41:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:41:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:41:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:41:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:41:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:41:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:41:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:41:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:41:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:41:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:41:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:41:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:41:50,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829176771] [2022-11-02 20:41:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829176771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:50,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:50,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:41:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812648842] [2022-11-02 20:41:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:50,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:50,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:50,259 INFO L87 Difference]: Start difference. First operand 8034 states and 11629 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:42:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:04,070 INFO L93 Difference]: Finished difference Result 17864 states and 26477 transitions. [2022-11-02 20:42:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:42:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 179 [2022-11-02 20:42:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:04,124 INFO L225 Difference]: With dead ends: 17864 [2022-11-02 20:42:04,124 INFO L226 Difference]: Without dead ends: 9840 [2022-11-02 20:42:04,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:42:04,157 INFO L413 NwaCegarLoop]: 2226 mSDtfsCounter, 2869 mSDsluCounter, 7054 mSDsCounter, 0 mSdLazyCounter, 6726 mSolverCounterSat, 1640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 9280 SdHoareTripleChecker+Invalid, 8366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1640 IncrementalHoareTripleChecker+Valid, 6726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:04,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3152 Valid, 9280 Invalid, 8366 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1640 Valid, 6726 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-11-02 20:42:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9840 states. [2022-11-02 20:42:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9840 to 8050. [2022-11-02 20:42:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8050 states, 5833 states have (on average 1.3091033773358478) internal successors, (7636), 5925 states have internal predecessors, (7636), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 562 states have return successors, (2355), 1759 states have call predecessors, (2355), 1653 states have call successors, (2355) [2022-11-02 20:42:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 11645 transitions. [2022-11-02 20:42:04,935 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 11645 transitions. Word has length 179 [2022-11-02 20:42:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:04,936 INFO L495 AbstractCegarLoop]: Abstraction has 8050 states and 11645 transitions. [2022-11-02 20:42:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:42:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 11645 transitions. [2022-11-02 20:42:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-02 20:42:04,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:04,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-11-02 20:42:04,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:42:04,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:42:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1101089018, now seen corresponding path program 1 times [2022-11-02 20:42:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:04,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611506580] [2022-11-02 20:42:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:42:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:42:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:42:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:42:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:42:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:42:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:42:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:42:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:42:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:42:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:42:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:42:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:06,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611506580] [2022-11-02 20:42:06,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611506580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:06,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:06,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:42:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284073115] [2022-11-02 20:42:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:06,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:42:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:42:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:42:06,444 INFO L87 Difference]: Start difference. First operand 8050 states and 11645 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:42:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:18,963 INFO L93 Difference]: Finished difference Result 18648 states and 27805 transitions. [2022-11-02 20:42:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:42:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 174 [2022-11-02 20:42:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:19,024 INFO L225 Difference]: With dead ends: 18648 [2022-11-02 20:42:19,024 INFO L226 Difference]: Without dead ends: 10608 [2022-11-02 20:42:19,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:42:19,059 INFO L413 NwaCegarLoop]: 2367 mSDtfsCounter, 4520 mSDsluCounter, 6405 mSDsCounter, 0 mSdLazyCounter, 6215 mSolverCounterSat, 3518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 8772 SdHoareTripleChecker+Invalid, 9733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3518 IncrementalHoareTripleChecker+Valid, 6215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:19,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4839 Valid, 8772 Invalid, 9733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3518 Valid, 6215 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-11-02 20:42:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2022-11-02 20:42:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 8146. [2022-11-02 20:42:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8146 states, 5913 states have (on average 1.3076272619651614) internal successors, (7732), 5989 states have internal predecessors, (7732), 1670 states have call successors, (1670), 461 states have call predecessors, (1670), 562 states have return successors, (2387), 1791 states have call predecessors, (2387), 1669 states have call successors, (2387) [2022-11-02 20:42:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 11789 transitions. [2022-11-02 20:42:19,812 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 11789 transitions. Word has length 174 [2022-11-02 20:42:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:19,813 INFO L495 AbstractCegarLoop]: Abstraction has 8146 states and 11789 transitions. [2022-11-02 20:42:19,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:42:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 11789 transitions. [2022-11-02 20:42:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-02 20:42:19,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:19,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:42:19,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:42:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1126684939, now seen corresponding path program 1 times [2022-11-02 20:42:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:19,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40097341] [2022-11-02 20:42:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:42:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:42:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:42:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:42:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:42:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:42:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:42:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:42:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:42:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:42:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:42:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:42:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:42:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40097341] [2022-11-02 20:42:21,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40097341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:21,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:21,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:42:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024480667] [2022-11-02 20:42:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:21,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:42:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:42:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:42:21,341 INFO L87 Difference]: Start difference. First operand 8146 states and 11789 transitions. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 7 states have internal predecessors, (121), 4 states have call successors, (21), 7 states have call predecessors, (21), 4 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20)