./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8 --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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- 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-e04fb08 [2022-11-16 11:25:01,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:25:01,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:25:01,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:25:01,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:25:01,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:25:01,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:25:01,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:25:01,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:25:01,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:25:01,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:25:01,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:25:01,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:25:01,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:25:01,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:25:01,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:25:01,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:25:01,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:25:01,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:25:01,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:25:01,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:25:01,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:25:01,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:25:01,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:25:01,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:25:01,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:25:01,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:25:01,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:25:01,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:25:01,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:25:01,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:25:01,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:25:01,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:25:01,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:25:01,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:25:01,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:25:01,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:25:01,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:25:01,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:25:01,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:25:01,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:25:01,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:25:01,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:25:01,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:25:01,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:25:01,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:25:01,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:25:01,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:25:01,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:25:01,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:25:01,756 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:25:01,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:25:01,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:25:01,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:25:01,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:25:01,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:25:01,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:25:01,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:25:01,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:25:01,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:25:01,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:25:01,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:25:01,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:25:01,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:01,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:25:01,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:25:01,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:25:01,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:25:01,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:25:01,762 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:25:01,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:25:01,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:25:01,763 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_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/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_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2022-11-16 11:25:02,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:25:02,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:25:02,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:25:02,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:25:02,083 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:25:02,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-11-16 11:25:02,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/data/9749cf298/86791d4c00e64f44960c6b96a047a467/FLAG98c43eba8 [2022-11-16 11:25:03,200 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:25:03,201 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-11-16 11:25:03,267 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/data/9749cf298/86791d4c00e64f44960c6b96a047a467/FLAG98c43eba8 [2022-11-16 11:25:03,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/data/9749cf298/86791d4c00e64f44960c6b96a047a467 [2022-11-16 11:25:03,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:25:03,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:25:03,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:03,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:25:03,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:25:03,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:03" (1/1) ... [2022-11-16 11:25:03,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb25723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:03, skipping insertion in model container [2022-11-16 11:25:03,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:03" (1/1) ... [2022-11-16 11:25:03,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:25:03,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:25:05,118 WARN L229 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_ecc7ab70-dd03-4aad-9809-5503389206ae/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-11-16 11:25:05,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:05,601 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:25:05,814 WARN L229 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_ecc7ab70-dd03-4aad-9809-5503389206ae/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-11-16 11:25:06,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:06,193 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:25:06,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06 WrapperNode [2022-11-16 11:25:06,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:06,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:06,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:25:06,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:25:06,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,482 INFO L138 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2397 [2022-11-16 11:25:06,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:06,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:25:06,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:25:06,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:25:06,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,706 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:25:06,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:25:06,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:25:06,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:25:06,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (1/1) ... [2022-11-16 11:25:06,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:06,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:25:06,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:25:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-16 11:25:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-16 11:25:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 11:25:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2022-11-16 11:25:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2022-11-16 11:25:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-11-16 11:25:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-11-16 11:25:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 11:25:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 11:25:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 11:25:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 11:25:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:25:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2022-11-16 11:25:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2022-11-16 11:25:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2022-11-16 11:25:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2022-11-16 11:25:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-11-16 11:25:06,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-11-16 11:25:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 11:25:06,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 11:25:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-16 11:25:06,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-16 11:25:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 11:25:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 11:25:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2022-11-16 11:25:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2022-11-16 11:25:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-16 11:25:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-16 11:25:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-11-16 11:25:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-11-16 11:25:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-11-16 11:25:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-11-16 11:25:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-16 11:25:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-16 11:25:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 11:25:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 11:25:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:25:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 11:25:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 11:25:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 11:25:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 11:25:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-16 11:25:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-16 11:25:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:25:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:25:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2022-11-16 11:25:06,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2022-11-16 11:25:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:25:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2022-11-16 11:25:06,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2022-11-16 11:25:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-16 11:25:06,962 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-16 11:25:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-16 11:25:06,965 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-16 11:25:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:25:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:25:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:25:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-11-16 11:25:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-11-16 11:25:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2022-11-16 11:25:06,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2022-11-16 11:25:06,968 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-11-16 11:25:06,968 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-11-16 11:25:06,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:25:06,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-16 11:25:06,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-16 11:25:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-11-16 11:25:06,969 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-11-16 11:25:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:25:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:25:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-16 11:25:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-16 11:25:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-16 11:25:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-16 11:25:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2022-11-16 11:25:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2022-11-16 11:25:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:25:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-16 11:25:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-16 11:25:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 11:25:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-16 11:25:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-16 11:25:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-16 11:25:06,974 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-16 11:25:06,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:25:06,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:25:06,974 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2022-11-16 11:25:06,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2022-11-16 11:25:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-16 11:25:06,975 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-16 11:25:07,627 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:25:07,630 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:25:08,264 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 11:25:12,549 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:25:12,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:25:12,575 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:25:12,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:12 BoogieIcfgContainer [2022-11-16 11:25:12,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:25:12,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:25:12,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:25:12,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:25:12,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:25:03" (1/3) ... [2022-11-16 11:25:12,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bffa6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:12, skipping insertion in model container [2022-11-16 11:25:12,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:06" (2/3) ... [2022-11-16 11:25:12,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bffa6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:12, skipping insertion in model container [2022-11-16 11:25:12,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:12" (3/3) ... [2022-11-16 11:25:12,597 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-11-16 11:25:12,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:25:12,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:25:12,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:25:12,771 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;@7f8d60f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:25:12,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:25:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 733 states, 579 states have (on average 1.447322970639033) internal successors, (838), 593 states have internal predecessors, (838), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-11-16 11:25:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-16 11:25:12,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:12,803 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:25:12,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 526889012, now seen corresponding path program 1 times [2022-11-16 11:25:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:12,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533749192] [2022-11-16 11:25:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:25:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:13,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533749192] [2022-11-16 11:25:13,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533749192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:13,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:13,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:25:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227196196] [2022-11-16 11:25:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:13,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:13,786 INFO L87 Difference]: Start difference. First operand has 733 states, 579 states have (on average 1.447322970639033) internal successors, (838), 593 states have internal predecessors, (838), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-16 11:25:18,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:19,510 INFO L93 Difference]: Finished difference Result 2290 states and 3420 transitions. [2022-11-16 11:25:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:19,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-11-16 11:25:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:19,544 INFO L225 Difference]: With dead ends: 2290 [2022-11-16 11:25:19,545 INFO L226 Difference]: Without dead ends: 1546 [2022-11-16 11:25:19,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:19,560 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 1461 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:19,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1909 Invalid, 1429 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [288 Valid, 1140 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-11-16 11:25:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-11-16 11:25:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1374. [2022-11-16 11:25:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1094 states have (on average 1.4277879341864717) internal successors, (1562), 1110 states have internal predecessors, (1562), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-11-16 11:25:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1979 transitions. [2022-11-16 11:25:19,777 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1979 transitions. Word has length 78 [2022-11-16 11:25:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:19,778 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 1979 transitions. [2022-11-16 11:25:19,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-16 11:25:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1979 transitions. [2022-11-16 11:25:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-16 11:25:19,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:19,793 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:25:19,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:25:19,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 945213950, now seen corresponding path program 1 times [2022-11-16 11:25:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:19,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58358589] [2022-11-16 11:25:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:25:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:20,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58358589] [2022-11-16 11:25:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58358589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:20,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:20,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:25:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544050348] [2022-11-16 11:25:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:25:20,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:25:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:25:20,343 INFO L87 Difference]: Start difference. First operand 1374 states and 1979 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-16 11:25:25,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:26,505 INFO L93 Difference]: Finished difference Result 4407 states and 6433 transitions. [2022-11-16 11:25:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:25:26,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-11-16 11:25:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:26,527 INFO L225 Difference]: With dead ends: 4407 [2022-11-16 11:25:26,527 INFO L226 Difference]: Without dead ends: 3051 [2022-11-16 11:25:26,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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-16 11:25:26,535 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 1489 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 288 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:26,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 3271 Invalid, 2417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [288 Valid, 2128 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-11-16 11:25:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-11-16 11:25:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2787. [2022-11-16 11:25:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2221 states have (on average 1.429536244934714) internal successors, (3175), 2259 states have internal predecessors, (3175), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-11-16 11:25:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4050 transitions. [2022-11-16 11:25:26,707 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4050 transitions. Word has length 82 [2022-11-16 11:25:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:26,708 INFO L495 AbstractCegarLoop]: Abstraction has 2787 states and 4050 transitions. [2022-11-16 11:25:26,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-16 11:25:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4050 transitions. [2022-11-16 11:25:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-16 11:25:26,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:26,717 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-11-16 11:25:26,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:25:26,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -234460542, now seen corresponding path program 1 times [2022-11-16 11:25:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:26,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348745127] [2022-11-16 11:25:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 11:25:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:25:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:25:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:25:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-16 11:25:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:27,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348745127] [2022-11-16 11:25:27,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348745127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:27,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:27,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327860528] [2022-11-16 11:25:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:27,168 INFO L87 Difference]: Start difference. First operand 2787 states and 4050 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 11:25:33,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:35,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:35,466 INFO L93 Difference]: Finished difference Result 7381 states and 10777 transitions. [2022-11-16 11:25:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:25:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2022-11-16 11:25:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:35,500 INFO L225 Difference]: With dead ends: 7381 [2022-11-16 11:25:35,501 INFO L226 Difference]: Without dead ends: 4618 [2022-11-16 11:25:35,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:25:35,525 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 2407 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 892 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2477 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 892 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:35,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2477 Valid, 2018 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [892 Valid, 1656 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-11-16 11:25:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2022-11-16 11:25:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4129. [2022-11-16 11:25:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4129 states, 3289 states have (on average 1.4335664335664335) internal successors, (4715), 3343 states have internal predecessors, (4715), 605 states have call successors, (605), 213 states have call predecessors, (605), 234 states have return successors, (680), 610 states have call predecessors, (680), 604 states have call successors, (680) [2022-11-16 11:25:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 6000 transitions. [2022-11-16 11:25:35,830 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 6000 transitions. Word has length 140 [2022-11-16 11:25:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:35,832 INFO L495 AbstractCegarLoop]: Abstraction has 4129 states and 6000 transitions. [2022-11-16 11:25:35,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 11:25:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 6000 transitions. [2022-11-16 11:25:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-16 11:25:35,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:35,845 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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] [2022-11-16 11:25:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:25:35,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1546750682, now seen corresponding path program 1 times [2022-11-16 11:25:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:35,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153502080] [2022-11-16 11:25:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:25:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:25:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:25:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:25:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 11:25:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 11:25:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 11:25:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-16 11:25:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:36,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153502080] [2022-11-16 11:25:36,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153502080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:36,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:36,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:25:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527869746] [2022-11-16 11:25:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:36,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:25:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:25:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:36,356 INFO L87 Difference]: Start difference. First operand 4129 states and 6000 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 11:25:42,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:44,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:46,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:48,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:48,682 INFO L93 Difference]: Finished difference Result 10838 states and 15693 transitions. [2022-11-16 11:25:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:25:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 169 [2022-11-16 11:25:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:48,724 INFO L225 Difference]: With dead ends: 10838 [2022-11-16 11:25:48,725 INFO L226 Difference]: Without dead ends: 6733 [2022-11-16 11:25:48,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:25:48,741 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 1319 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 348 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:48,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2925 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1806 Invalid, 4 Unknown, 0 Unchecked, 11.8s Time] [2022-11-16 11:25:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2022-11-16 11:25:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6098. [2022-11-16 11:25:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6098 states, 4887 states have (on average 1.4221403724166155) internal successors, (6950), 4971 states have internal predecessors, (6950), 840 states have call successors, (840), 335 states have call predecessors, (840), 370 states have return successors, (961), 851 states have call predecessors, (961), 839 states have call successors, (961) [2022-11-16 11:25:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 8751 transitions. [2022-11-16 11:25:49,216 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 8751 transitions. Word has length 169 [2022-11-16 11:25:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:49,217 INFO L495 AbstractCegarLoop]: Abstraction has 6098 states and 8751 transitions. [2022-11-16 11:25:49,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 11:25:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 8751 transitions. [2022-11-16 11:25:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-16 11:25:49,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:49,235 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:25:49,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -167684152, now seen corresponding path program 1 times [2022-11-16 11:25:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986363307] [2022-11-16 11:25:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:25:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:25:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:25:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:25:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-11-16 11:25:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:49,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986363307] [2022-11-16 11:25:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986363307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:49,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994673223] [2022-11-16 11:25:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:49,688 INFO L87 Difference]: Start difference. First operand 6098 states and 8751 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 11:25:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:58,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:25:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:58,605 INFO L93 Difference]: Finished difference Result 15826 states and 22707 transitions. [2022-11-16 11:25:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:25:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2022-11-16 11:25:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:58,656 INFO L225 Difference]: With dead ends: 15826 [2022-11-16 11:25:58,656 INFO L226 Difference]: Without dead ends: 9763 [2022-11-16 11:25:58,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:25:58,677 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 1962 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 623 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:58,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2461 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 2194 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-11-16 11:25:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9763 states. [2022-11-16 11:25:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9763 to 8806. [2022-11-16 11:25:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8806 states, 7051 states have (on average 1.4122819458232876) internal successors, (9958), 7171 states have internal predecessors, (9958), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-11-16 11:25:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 12474 transitions. [2022-11-16 11:25:59,351 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 12474 transitions. Word has length 163 [2022-11-16 11:25:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:59,354 INFO L495 AbstractCegarLoop]: Abstraction has 8806 states and 12474 transitions. [2022-11-16 11:25:59,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 11:25:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 12474 transitions. [2022-11-16 11:25:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-16 11:25:59,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:59,371 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:59,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:25:59,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -755423903, now seen corresponding path program 1 times [2022-11-16 11:25:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456224369] [2022-11-16 11:25:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:25:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:25:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:25:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:25:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:25:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:25:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:25:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:25:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:25:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:25:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-11-16 11:25:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:59,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456224369] [2022-11-16 11:25:59,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456224369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:59,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:59,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966901332] [2022-11-16 11:25:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:59,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:59,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:59,809 INFO L87 Difference]: Start difference. First operand 8806 states and 12474 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 11:26:05,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:07,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:09,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:09,240 INFO L93 Difference]: Finished difference Result 14334 states and 20527 transitions. [2022-11-16 11:26:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:26:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2022-11-16 11:26:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:09,320 INFO L225 Difference]: With dead ends: 14334 [2022-11-16 11:26:09,320 INFO L226 Difference]: Without dead ends: 9770 [2022-11-16 11:26:09,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:26:09,339 INFO L413 NwaCegarLoop]: 623 mSDtfsCounter, 941 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 426 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:09,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2422 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1643 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2022-11-16 11:26:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9770 states. [2022-11-16 11:26:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9770 to 8826. [2022-11-16 11:26:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8826 states, 7071 states have (on average 1.4111158252015275) internal successors, (9978), 7191 states have internal predecessors, (9978), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-11-16 11:26:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8826 states to 8826 states and 12494 transitions. [2022-11-16 11:26:10,106 INFO L78 Accepts]: Start accepts. Automaton has 8826 states and 12494 transitions. Word has length 168 [2022-11-16 11:26:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:10,107 INFO L495 AbstractCegarLoop]: Abstraction has 8826 states and 12494 transitions. [2022-11-16 11:26:10,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 11:26:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8826 states and 12494 transitions. [2022-11-16 11:26:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-16 11:26:10,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:10,127 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:26:10,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:26:10,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash -104021726, now seen corresponding path program 1 times [2022-11-16 11:26:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:10,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120996511] [2022-11-16 11:26:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:26:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:26:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:26:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:26:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:26:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:26:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:26:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:26:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:26:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:26:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:26:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:26:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:26:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:26:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-16 11:26:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:11,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120996511] [2022-11-16 11:26:11,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120996511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:26:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936340200] [2022-11-16 11:26:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:11,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:26:11,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:26:11,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:26:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:26:12,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:26:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-16 11:26:12,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:26:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-11-16 11:26:14,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936340200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:26:14,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:26:14,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 18 [2022-11-16 11:26:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218135695] [2022-11-16 11:26:14,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:26:14,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:26:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:26:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:26:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:26:14,270 INFO L87 Difference]: Start difference. First operand 8826 states and 12494 transitions. Second operand has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2022-11-16 11:26:26,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:30,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:32,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:32,580 INFO L93 Difference]: Finished difference Result 24025 states and 34233 transitions. [2022-11-16 11:26:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:26:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) Word has length 170 [2022-11-16 11:26:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:32,646 INFO L225 Difference]: With dead ends: 24025 [2022-11-16 11:26:32,647 INFO L226 Difference]: Without dead ends: 15234 [2022-11-16 11:26:32,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=424, Invalid=1468, Unknown=0, NotChecked=0, Total=1892 [2022-11-16 11:26:32,674 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 6279 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 7644 mSolverCounterSat, 2180 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6413 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 9827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2180 IncrementalHoareTripleChecker+Valid, 7644 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:32,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6413 Valid, 5266 Invalid, 9827 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2180 Valid, 7644 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2022-11-16 11:26:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15234 states. [2022-11-16 11:26:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15234 to 13387. [2022-11-16 11:26:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13387 states, 10667 states have (on average 1.400674978906909) internal successors, (14941), 10833 states have internal predecessors, (14941), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-11-16 11:26:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13387 states to 13387 states and 18780 transitions. [2022-11-16 11:26:33,764 INFO L78 Accepts]: Start accepts. Automaton has 13387 states and 18780 transitions. Word has length 170 [2022-11-16 11:26:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:33,765 INFO L495 AbstractCegarLoop]: Abstraction has 13387 states and 18780 transitions. [2022-11-16 11:26:33,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2022-11-16 11:26:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13387 states and 18780 transitions. [2022-11-16 11:26:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-16 11:26:33,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:33,788 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:26:33,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:26:33,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:33,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash -500328017, now seen corresponding path program 1 times [2022-11-16 11:26:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:33,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234302963] [2022-11-16 11:26:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:26:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:26:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:26:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:26:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:26:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:26:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:26:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:26:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:26:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 11:26:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:26:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:26:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-16 11:26:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-16 11:26:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:34,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234302963] [2022-11-16 11:26:34,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234302963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:26:34,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:26:34,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:26:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538856041] [2022-11-16 11:26:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:26:34,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:26:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:26:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:26:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:26:34,419 INFO L87 Difference]: Start difference. First operand 13387 states and 18780 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:26:42,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:44,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:46,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:48,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:48,888 INFO L93 Difference]: Finished difference Result 33358 states and 46695 transitions. [2022-11-16 11:26:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:26:48,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 195 [2022-11-16 11:26:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:48,973 INFO L225 Difference]: With dead ends: 33358 [2022-11-16 11:26:48,974 INFO L226 Difference]: Without dead ends: 20006 [2022-11-16 11:26:49,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:26:49,014 INFO L413 NwaCegarLoop]: 1146 mSDtfsCounter, 1195 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 276 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:49,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 3797 Invalid, 3242 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [276 Valid, 2962 Invalid, 4 Unknown, 0 Unchecked, 13.3s Time] [2022-11-16 11:26:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20006 states. [2022-11-16 11:26:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20006 to 13411. [2022-11-16 11:26:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13411 states, 10691 states have (on average 1.3997755121129922) internal successors, (14965), 10857 states have internal predecessors, (14965), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-11-16 11:26:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13411 states to 13411 states and 18804 transitions. [2022-11-16 11:26:50,160 INFO L78 Accepts]: Start accepts. Automaton has 13411 states and 18804 transitions. Word has length 195 [2022-11-16 11:26:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:50,161 INFO L495 AbstractCegarLoop]: Abstraction has 13411 states and 18804 transitions. [2022-11-16 11:26:50,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:26:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13411 states and 18804 transitions. [2022-11-16 11:26:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-16 11:26:50,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:50,185 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:26:50,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:26:50,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1848943315, now seen corresponding path program 1 times [2022-11-16 11:26:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594952368] [2022-11-16 11:26:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:26:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:26:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:26:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:26:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:26:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:26:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:26:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:26:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:26:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:26:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:26:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:26:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 11:26:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-16 11:26:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-16 11:26:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:51,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594952368] [2022-11-16 11:26:51,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594952368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:26:51,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:26:51,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:26:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275074322] [2022-11-16 11:26:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:26:51,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:26:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:26:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:26:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:26:51,195 INFO L87 Difference]: Start difference. First operand 13411 states and 18804 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 11:26:57,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:26:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:57,644 INFO L93 Difference]: Finished difference Result 28275 states and 39730 transitions. [2022-11-16 11:26:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:26:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2022-11-16 11:26:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:57,706 INFO L225 Difference]: With dead ends: 28275 [2022-11-16 11:26:57,706 INFO L226 Difference]: Without dead ends: 14899 [2022-11-16 11:26:57,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:26:57,735 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 924 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 377 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:57,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 2680 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2184 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 11:26:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14899 states. [2022-11-16 11:26:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14899 to 13459. [2022-11-16 11:26:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13459 states, 10727 states have (on average 1.3984338584879277) internal successors, (15001), 10893 states have internal predecessors, (15001), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-11-16 11:26:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 18855 transitions. [2022-11-16 11:26:58,821 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 18855 transitions. Word has length 206 [2022-11-16 11:26:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:58,822 INFO L495 AbstractCegarLoop]: Abstraction has 13459 states and 18855 transitions. [2022-11-16 11:26:58,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 11:26:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 18855 transitions. [2022-11-16 11:26:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-16 11:26:58,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:58,844 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:26:58,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:26:58,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1216674502, now seen corresponding path program 1 times [2022-11-16 11:26:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:58,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842351974] [2022-11-16 11:26:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:26:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:26:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:26:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:26:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:26:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:26:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:26:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:26:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:26:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:26:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:26:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:26:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 11:26:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:26:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-16 11:26:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-16 11:26:59,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:59,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842351974] [2022-11-16 11:26:59,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842351974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:26:59,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25433419] [2022-11-16 11:26:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:59,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:59,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:26:59,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:26:59,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:27:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:00,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:27:00,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:27:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-16 11:27:00,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:27:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25433419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:27:00,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:27:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-11-16 11:27:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012956815] [2022-11-16 11:27:00,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:27:00,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:27:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:27:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:27:00,392 INFO L87 Difference]: Start difference. First operand 13459 states and 18855 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 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-16 11:27:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:27:02,041 INFO L93 Difference]: Finished difference Result 32970 states and 46176 transitions. [2022-11-16 11:27:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:27:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 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 213 [2022-11-16 11:27:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:27:02,111 INFO L225 Difference]: With dead ends: 32970 [2022-11-16 11:27:02,111 INFO L226 Difference]: Without dead ends: 19546 [2022-11-16 11:27:02,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:27:02,141 INFO L413 NwaCegarLoop]: 1932 mSDtfsCounter, 1250 mSDsluCounter, 4200 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 6132 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:27:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 6132 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:27:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19546 states. [2022-11-16 11:27:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19546 to 13471. [2022-11-16 11:27:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13471 states, 10739 states have (on average 1.397988639538132) internal successors, (15013), 10893 states have internal predecessors, (15013), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-11-16 11:27:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13471 states to 13471 states and 18867 transitions. [2022-11-16 11:27:03,242 INFO L78 Accepts]: Start accepts. Automaton has 13471 states and 18867 transitions. Word has length 213 [2022-11-16 11:27:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:27:03,242 INFO L495 AbstractCegarLoop]: Abstraction has 13471 states and 18867 transitions. [2022-11-16 11:27:03,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 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-16 11:27:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13471 states and 18867 transitions. [2022-11-16 11:27:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-11-16 11:27:03,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:27:03,266 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:27:03,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:27:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:27:03,482 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:27:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:27:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1524719023, now seen corresponding path program 1 times [2022-11-16 11:27:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:27:03,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202044738] [2022-11-16 11:27:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:27:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:27:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:27:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:27:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:27:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:27:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:27:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:27:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:27:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:27:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:27:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:27:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:27:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:27:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 11:27:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 11:27:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:27:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 11:27:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:27:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 11:27:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-16 11:27:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 11:27:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:27:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-16 11:27:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-11-16 11:27:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:27:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202044738] [2022-11-16 11:27:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202044738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:27:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699959583] [2022-11-16 11:27:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:04,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:27:04,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:27:04,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:27:04,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:27:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:05,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:27:05,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:27:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-16 11:27:05,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:27:05,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699959583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:27:05,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:27:05,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-11-16 11:27:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731069274] [2022-11-16 11:27:05,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:27:05,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:27:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:27:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:27:05,731 INFO L87 Difference]: Start difference. First operand 13471 states and 18867 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 11:27:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:27:07,361 INFO L93 Difference]: Finished difference Result 18273 states and 25371 transitions. [2022-11-16 11:27:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:27:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 251 [2022-11-16 11:27:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:27:07,419 INFO L225 Difference]: With dead ends: 18273 [2022-11-16 11:27:07,419 INFO L226 Difference]: Without dead ends: 18264 [2022-11-16 11:27:07,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:27:07,430 INFO L413 NwaCegarLoop]: 1726 mSDtfsCounter, 1616 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:27:07,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 2317 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:27:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18264 states. [2022-11-16 11:27:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18264 to 16757. [2022-11-16 11:27:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16757 states, 13311 states have (on average 1.3864472992262038) internal successors, (18455), 13499 states have internal predecessors, (18455), 2278 states have call successors, (2278), 1080 states have call predecessors, (2278), 1167 states have return successors, (2584), 2321 states have call predecessors, (2584), 2277 states have call successors, (2584) [2022-11-16 11:27:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16757 states to 16757 states and 23317 transitions. [2022-11-16 11:27:08,796 INFO L78 Accepts]: Start accepts. Automaton has 16757 states and 23317 transitions. Word has length 251 [2022-11-16 11:27:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:27:08,797 INFO L495 AbstractCegarLoop]: Abstraction has 16757 states and 23317 transitions. [2022-11-16 11:27:08,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 11:27:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 16757 states and 23317 transitions. [2022-11-16 11:27:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-11-16 11:27:08,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:27:08,819 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:27:08,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 11:27:09,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 11:27:09,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:27:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:27:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1188916635, now seen corresponding path program 1 times [2022-11-16 11:27:09,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:27:09,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690264559] [2022-11-16 11:27:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:27:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:27:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:27:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:27:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:27:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:27:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:27:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:27:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:27:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:27:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:27:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:27:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:27:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:27:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 11:27:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 11:27:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:27:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 11:27:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:27:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 11:27:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-16 11:27:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 11:27:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:27:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-16 11:27:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-11-16 11:27:09,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:27:09,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690264559] [2022-11-16 11:27:09,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690264559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:27:09,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:27:09,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:27:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904688743] [2022-11-16 11:27:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:27:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:27:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:27:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:27:09,736 INFO L87 Difference]: Start difference. First operand 16757 states and 23317 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-16 11:27:14,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:27:15,338 INFO L93 Difference]: Finished difference Result 25896 states and 36106 transitions. [2022-11-16 11:27:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:27:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 255 [2022-11-16 11:27:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:27:15,364 INFO L225 Difference]: With dead ends: 25896 [2022-11-16 11:27:15,364 INFO L226 Difference]: Without dead ends: 8006 [2022-11-16 11:27:15,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:27:15,399 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 1267 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 287 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:27:15,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1952 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1253 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-11-16 11:27:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8006 states. [2022-11-16 11:27:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8006 to 7319. [2022-11-16 11:27:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7319 states, 5793 states have (on average 1.374590022440877) internal successors, (7963), 5876 states have internal predecessors, (7963), 999 states have call successors, (999), 486 states have call predecessors, (999), 526 states have return successors, (1142), 1022 states have call predecessors, (1142), 998 states have call successors, (1142) [2022-11-16 11:27:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7319 states to 7319 states and 10104 transitions. [2022-11-16 11:27:16,167 INFO L78 Accepts]: Start accepts. Automaton has 7319 states and 10104 transitions. Word has length 255 [2022-11-16 11:27:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:27:16,168 INFO L495 AbstractCegarLoop]: Abstraction has 7319 states and 10104 transitions. [2022-11-16 11:27:16,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-16 11:27:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 7319 states and 10104 transitions. [2022-11-16 11:27:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-11-16 11:27:16,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:27:16,181 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:27:16,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:27:16,182 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:27:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:27:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -765756521, now seen corresponding path program 1 times [2022-11-16 11:27:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:27:16,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202516602] [2022-11-16 11:27:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:27:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:27:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:27:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:27:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:27:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:27:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:27:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:27:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:27:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:27:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:17,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:27:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:27:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:27:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:27:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 11:27:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 11:27:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:27:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 11:27:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:27:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 11:27:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-16 11:27:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 11:27:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:27:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-16 11:27:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-16 11:27:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-16 11:27:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:27:18,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202516602] [2022-11-16 11:27:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202516602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:27:18,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:27:18,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:27:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721059995] [2022-11-16 11:27:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:27:18,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:27:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:27:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:27:18,259 INFO L87 Difference]: Start difference. First operand 7319 states and 10104 transitions. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 11:27:26,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:28,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:30,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:32,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:34,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:27:36,144 INFO L93 Difference]: Finished difference Result 17428 states and 24525 transitions. [2022-11-16 11:27:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:27:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 268 [2022-11-16 11:27:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:27:36,181 INFO L225 Difference]: With dead ends: 17428 [2022-11-16 11:27:36,181 INFO L226 Difference]: Without dead ends: 10190 [2022-11-16 11:27:36,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:27:36,202 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 1726 mSDsluCounter, 6523 mSDsCounter, 0 mSdLazyCounter, 4973 mSolverCounterSat, 346 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 7451 SdHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4973 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:27:36,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 7451 Invalid, 5324 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [346 Valid, 4973 Invalid, 5 Unknown, 0 Unchecked, 16.6s Time] [2022-11-16 11:27:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10190 states. [2022-11-16 11:27:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10190 to 7389. [2022-11-16 11:27:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 5853 states have (on average 1.3707500427131385) internal successors, (8023), 5936 states have internal predecessors, (8023), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-11-16 11:27:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 10174 transitions. [2022-11-16 11:27:37,211 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 10174 transitions. Word has length 268 [2022-11-16 11:27:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:27:37,212 INFO L495 AbstractCegarLoop]: Abstraction has 7389 states and 10174 transitions. [2022-11-16 11:27:37,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 11:27:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 10174 transitions. [2022-11-16 11:27:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-16 11:27:37,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:27:37,229 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:27:37,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:27:37,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:27:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:27:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -473705967, now seen corresponding path program 1 times [2022-11-16 11:27:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:27:37,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179936252] [2022-11-16 11:27:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:27:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:27:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:27:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:27:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:27:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:27:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:27:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:27:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:27:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:27:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:27:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:27:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:27:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:27:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:27:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:27:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:27:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:27:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 11:27:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 11:27:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-16 11:27:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 11:27:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:27:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:27:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-16 11:27:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-11-16 11:27:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:27:39,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179936252] [2022-11-16 11:27:39,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179936252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:27:39,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513805856] [2022-11-16 11:27:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:39,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:27:39,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:27:39,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:27:39,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:27:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:40,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:27:40,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:27:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-11-16 11:27:40,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:27:40,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513805856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:27:40,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:27:40,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-11-16 11:27:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206429517] [2022-11-16 11:27:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:27:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:27:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:27:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:27:40,376 INFO L87 Difference]: Start difference. First operand 7389 states and 10174 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 11:27:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:27:41,126 INFO L93 Difference]: Finished difference Result 14747 states and 20308 transitions. [2022-11-16 11:27:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:27:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2022-11-16 11:27:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:27:41,142 INFO L225 Difference]: With dead ends: 14747 [2022-11-16 11:27:41,142 INFO L226 Difference]: Without dead ends: 7388 [2022-11-16 11:27:41,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:27:41,154 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 6 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:27:41,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4055 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:27:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7388 states. [2022-11-16 11:27:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7388 to 7388. [2022-11-16 11:27:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7388 states, 5852 states have (on average 1.3704716336295284) internal successors, (8020), 5935 states have internal predecessors, (8020), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-11-16 11:27:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7388 states to 7388 states and 10171 transitions. [2022-11-16 11:27:41,738 INFO L78 Accepts]: Start accepts. Automaton has 7388 states and 10171 transitions. Word has length 274 [2022-11-16 11:27:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:27:41,739 INFO L495 AbstractCegarLoop]: Abstraction has 7388 states and 10171 transitions. [2022-11-16 11:27:41,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 11:27:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7388 states and 10171 transitions. [2022-11-16 11:27:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-16 11:27:41,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:27:41,745 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:27:41,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 11:27:41,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:27:41,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:27:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:27:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1346116529, now seen corresponding path program 1 times [2022-11-16 11:27:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:27:41,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466342909] [2022-11-16 11:27:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:27:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:27:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:27:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:27:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:27:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:27:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:27:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:27:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:27:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:27:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:27:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:27:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:27:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:27:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:27:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:27:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:27:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:27:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:27:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 11:27:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 11:27:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-16 11:27:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 11:27:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:27:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:27:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:27:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-16 11:27:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-11-16 11:27:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:27:44,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466342909] [2022-11-16 11:27:44,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466342909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:27:44,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636792941] [2022-11-16 11:27:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:27:44,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:27:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:27:44,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:27:44,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:27:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:27:45,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 2288 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 11:27:45,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:27:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 87 proven. 14 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-11-16 11:27:46,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:27:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-11-16 11:27:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636792941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:27:46,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:27:46,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2022-11-16 11:27:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467951912] [2022-11-16 11:27:46,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:27:46,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:27:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:27:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:27:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:27:46,777 INFO L87 Difference]: Start difference. First operand 7388 states and 10171 transitions. Second operand has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) [2022-11-16 11:27:54,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:56,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:27:58,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:04,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:06,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:08,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:11,188 INFO L93 Difference]: Finished difference Result 22005 states and 31751 transitions. [2022-11-16 11:28:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:28:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) Word has length 274 [2022-11-16 11:28:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:11,228 INFO L225 Difference]: With dead ends: 22005 [2022-11-16 11:28:11,228 INFO L226 Difference]: Without dead ends: 14697 [2022-11-16 11:28:11,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 593 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:28:11,241 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 2547 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 8335 mSolverCounterSat, 924 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 13723 SdHoareTripleChecker+Invalid, 9265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 8335 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:11,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2715 Valid, 13723 Invalid, 9265 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [924 Valid, 8335 Invalid, 6 Unknown, 0 Unchecked, 22.7s Time] [2022-11-16 11:28:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14697 states. [2022-11-16 11:28:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14697 to 10750. [2022-11-16 11:28:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10750 states, 8714 states have (on average 1.3969474408997016) internal successors, (12173), 8811 states have internal predecessors, (12173), 1498 states have call successors, (1498), 486 states have call predecessors, (1498), 537 states have return successors, (1736), 1542 states have call predecessors, (1736), 1497 states have call successors, (1736) [2022-11-16 11:28:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10750 states to 10750 states and 15407 transitions. [2022-11-16 11:28:12,229 INFO L78 Accepts]: Start accepts. Automaton has 10750 states and 15407 transitions. Word has length 274 [2022-11-16 11:28:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:12,230 INFO L495 AbstractCegarLoop]: Abstraction has 10750 states and 15407 transitions. [2022-11-16 11:28:12,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) [2022-11-16 11:28:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 10750 states and 15407 transitions. [2022-11-16 11:28:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-16 11:28:12,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:12,239 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:12,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:12,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:28:12,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:28:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash -105054050, now seen corresponding path program 2 times [2022-11-16 11:28:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:12,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937185480] [2022-11-16 11:28:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:28:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:28:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:28:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:28:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:28:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:28:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 11:28:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:28:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:28:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:28:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:28:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:28:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:28:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:28:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:28:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 11:28:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:28:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:28:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 11:28:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:28:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 11:28:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 11:28:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-16 11:28:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-16 11:28:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:28:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:28:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-16 11:28:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:28:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-16 11:28:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-11-16 11:28:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:14,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937185480] [2022-11-16 11:28:14,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937185480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:14,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:14,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:28:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111845705] [2022-11-16 11:28:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:14,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:28:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:28:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:28:14,698 INFO L87 Difference]: Start difference. First operand 10750 states and 15407 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 11:28:21,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:23,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:25,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:29,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:31,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:33,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:34,379 INFO L93 Difference]: Finished difference Result 26390 states and 38569 transitions. [2022-11-16 11:28:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:28:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 281 [2022-11-16 11:28:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:34,434 INFO L225 Difference]: With dead ends: 26390 [2022-11-16 11:28:34,434 INFO L226 Difference]: Without dead ends: 15762 [2022-11-16 11:28:34,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:28:34,460 INFO L413 NwaCegarLoop]: 953 mSDtfsCounter, 1171 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 3505 mSolverCounterSat, 413 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 3505 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:34,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 5972 Invalid, 3924 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [413 Valid, 3505 Invalid, 6 Unknown, 0 Unchecked, 17.7s Time] [2022-11-16 11:28:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15762 states. [2022-11-16 11:28:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15762 to 10798. [2022-11-16 11:28:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10798 states, 8756 states have (on average 1.395043398812243) internal successors, (12215), 8847 states have internal predecessors, (12215), 1498 states have call successors, (1498), 486 states have call predecessors, (1498), 543 states have return successors, (1766), 1554 states have call predecessors, (1766), 1497 states have call successors, (1766) [2022-11-16 11:28:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 15479 transitions. [2022-11-16 11:28:35,687 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 15479 transitions. Word has length 281 [2022-11-16 11:28:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:35,687 INFO L495 AbstractCegarLoop]: Abstraction has 10798 states and 15479 transitions. [2022-11-16 11:28:35,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 11:28:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 15479 transitions. [2022-11-16 11:28:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-16 11:28:35,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:35,698 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:35,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:28:35,698 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:28:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1036937257, now seen corresponding path program 1 times [2022-11-16 11:28:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:35,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648077139] [2022-11-16 11:28:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:28:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:28:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:28:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:28:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:28:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:28:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:28:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:28:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:28:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:28:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:28:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:28:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:28:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:28:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:28:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:28:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:28:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:28:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:28:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 11:28:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 11:28:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 11:28:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-16 11:28:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:28:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:28:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:28:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:28:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-16 11:28:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-11-16 11:28:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:39,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648077139] [2022-11-16 11:28:39,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648077139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:39,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:39,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-16 11:28:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501619718] [2022-11-16 11:28:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:39,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:28:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:28:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:28:39,045 INFO L87 Difference]: Start difference. First operand 10798 states and 15479 transitions. Second operand has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-16 11:28:48,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:50,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:56,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:28:58,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:29:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:00,359 INFO L93 Difference]: Finished difference Result 34209 states and 50995 transitions. [2022-11-16 11:29:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:29:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 275 [2022-11-16 11:29:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:00,450 INFO L225 Difference]: With dead ends: 34209 [2022-11-16 11:29:00,451 INFO L226 Difference]: Without dead ends: 23533 [2022-11-16 11:29:00,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:29:00,482 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 2129 mSDsluCounter, 11973 mSDsCounter, 0 mSdLazyCounter, 7944 mSolverCounterSat, 553 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 13141 SdHoareTripleChecker+Invalid, 8501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 7944 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:00,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 13141 Invalid, 8501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [553 Valid, 7944 Invalid, 4 Unknown, 0 Unchecked, 17.9s Time] [2022-11-16 11:29:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23533 states. [2022-11-16 11:29:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23533 to 10864. [2022-11-16 11:29:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10864 states, 8816 states have (on average 1.391674228675136) internal successors, (12269), 8895 states have internal predecessors, (12269), 1498 states have call successors, (1498), 486 states have call predecessors, (1498), 549 states have return successors, (1784), 1572 states have call predecessors, (1784), 1497 states have call successors, (1784) [2022-11-16 11:29:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 15551 transitions. [2022-11-16 11:29:02,383 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 15551 transitions. Word has length 275 [2022-11-16 11:29:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:02,384 INFO L495 AbstractCegarLoop]: Abstraction has 10864 states and 15551 transitions. [2022-11-16 11:29:02,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-16 11:29:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 15551 transitions. [2022-11-16 11:29:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-16 11:29:02,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:02,395 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:02,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:29:02,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 255178568, now seen corresponding path program 1 times [2022-11-16 11:29:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356669082] [2022-11-16 11:29:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:29:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:29:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:29:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:29:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:29:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:29:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:29:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:29:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:29:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:29:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:29:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:29:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:29:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:29:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:29:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:29:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:29:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 11:29:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 11:29:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 11:29:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-16 11:29:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:29:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-16 11:29:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:29:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-11-16 11:29:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356669082] [2022-11-16 11:29:14,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356669082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011460384] [2022-11-16 11:29:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:14,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:14,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:14,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:14,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:29:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:16,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 2343 conjuncts, 173 conjunts are in the unsatisfiable core [2022-11-16 11:29:16,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:17,558 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 11:29:17,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 30 [2022-11-16 11:29:17,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 11:29:18,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:29:18,641 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:29:18,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2022-11-16 11:29:21,996 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-16 11:29:21,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 45 [2022-11-16 11:29:23,018 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-16 11:29:23,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2022-11-16 11:29:23,817 INFO L321 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2022-11-16 11:29:23,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 76 [2022-11-16 11:29:24,402 INFO L321 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2022-11-16 11:29:24,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 89 [2022-11-16 11:29:25,555 INFO L321 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2022-11-16 11:29:25,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 70 [2022-11-16 11:29:25,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 11:29:27,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-16 11:29:28,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 11:29:29,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:29:30,078 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:29:30,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-16 11:29:30,486 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-16 11:29:30,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2022-11-16 11:29:30,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 11:29:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 51 proven. 60 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-11-16 11:29:31,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:32,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3| Int) (v_ArrVal_3588 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3588) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|))) (or (not (= (mod (select .cse0 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3|)) 4294967296) 0)) (= (mod (select .cse0 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)))) is different from false [2022-11-16 11:29:32,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3| Int) (v_ArrVal_3588 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3588) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.base|))) (or (= (mod (select .cse0 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0) (not (= 0 (mod (select .cse0 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3|)) 4294967296)))))) is different from false [2022-11-16 11:29:33,245 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-16 11:29:33,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 269 [2022-11-16 11:29:33,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:29:33,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 248 [2022-11-16 11:29:34,266 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3| Int) (v_ArrVal_3588 (Array Int Int)) (|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| v_ArrVal_3588) |c_ldv_skb_alloc_~skb~3#1.base|))) (or (= (mod (select .cse0 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0) (< |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| |c_#StackHeapBarrier|) (not (= (mod (select .cse0 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3|)) 4294967296) 0))))) (forall ((|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3| Int) (v_ArrVal_3588 (Array Int Int)) (|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (let ((.cse1 (select (store |c_#memory_int| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| v_ArrVal_3588) |c_ldv_skb_alloc_~skb~3#1.base|))) (or (= (mod (select .cse1 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0) (not (= (mod (select .cse1 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3|)) 4294967296) 0)) (= (select |c_old(#valid)| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2|) 0))))) (and (= (select |c_old(#valid)| |c_~#set_impl~0.base|) 0) (< |c_~#set_impl~0.base| |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:29:35,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:35,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 280 [2022-11-16 11:29:35,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:35,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 272 [2022-11-16 11:29:35,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:35,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 264 [2022-11-16 11:29:35,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:35,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 248 [2022-11-16 11:29:36,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011460384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:36,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:29:36,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 87 [2022-11-16 11:29:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042041135] [2022-11-16 11:29:36,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:29:36,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-16 11:29:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-16 11:29:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=9107, Unknown=52, NotChecked=582, Total=10100 [2022-11-16 11:29:36,406 INFO L87 Difference]: Start difference. First operand 10864 states and 15551 transitions. Second operand has 87 states, 85 states have (on average 3.7529411764705882) internal successors, (319), 72 states have internal predecessors, (319), 22 states have call successors, (57), 14 states have call predecessors, (57), 19 states have return successors, (56), 24 states have call predecessors, (56), 22 states have call successors, (56) [2022-11-16 11:30:58,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:00,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:02,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:04,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:06,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:08,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:10,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:12,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:14,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:16,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:18,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:20,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:22,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:24,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:26,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:28,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:30,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:32,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:34,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:36,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:38,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:40,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:42,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:44,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:46,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:48,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:50,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:52,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:54,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:56,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:31:58,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:00,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:02,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:04,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:06,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:08,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:10,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:12,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:14,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:18,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:20,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:22,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:24,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:26,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:32:34,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:34:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:20,331 INFO L93 Difference]: Finished difference Result 29163 states and 42475 transitions. [2022-11-16 11:34:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-16 11:34:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 3.7529411764705882) internal successors, (319), 72 states have internal predecessors, (319), 22 states have call successors, (57), 14 states have call predecessors, (57), 19 states have return successors, (56), 24 states have call predecessors, (56), 22 states have call successors, (56) Word has length 283 [2022-11-16 11:34:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:20,381 INFO L225 Difference]: With dead ends: 29163 [2022-11-16 11:34:20,381 INFO L226 Difference]: Without dead ends: 21807 [2022-11-16 11:34:20,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 172 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7733 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=1471, Invalid=27557, Unknown=54, NotChecked=1020, Total=30102 [2022-11-16 11:34:20,399 INFO L413 NwaCegarLoop]: 2639 mSDtfsCounter, 12239 mSDsluCounter, 115497 mSDsCounter, 0 mSdLazyCounter, 118803 mSolverCounterSat, 4005 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 247.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12454 SdHoareTripleChecker+Valid, 118136 SdHoareTripleChecker+Invalid, 130688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.3s SdHoareTripleChecker+Time, 4005 IncrementalHoareTripleChecker+Valid, 118803 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 7834 IncrementalHoareTripleChecker+Unchecked, 263.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:20,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12454 Valid, 118136 Invalid, 130688 Unknown, 0 Unchecked, 1.3s Time], IncrementalHoareTripleChecker [4005 Valid, 118803 Invalid, 46 Unknown, 7834 Unchecked, 263.7s Time] [2022-11-16 11:34:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21807 states. [2022-11-16 11:34:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21807 to 14449. [2022-11-16 11:34:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14449 states, 11670 states have (on average 1.3914310197086546) internal successors, (16238), 11861 states have internal predecessors, (16238), 1976 states have call successors, (1976), 706 states have call predecessors, (1976), 802 states have return successors, (2368), 1993 states have call predecessors, (2368), 1975 states have call successors, (2368) [2022-11-16 11:34:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 20582 transitions. [2022-11-16 11:34:22,556 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 20582 transitions. Word has length 283 [2022-11-16 11:34:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:22,557 INFO L495 AbstractCegarLoop]: Abstraction has 14449 states and 20582 transitions. [2022-11-16 11:34:22,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 85 states have (on average 3.7529411764705882) internal successors, (319), 72 states have internal predecessors, (319), 22 states have call successors, (57), 14 states have call predecessors, (57), 19 states have return successors, (56), 24 states have call predecessors, (56), 22 states have call successors, (56) [2022-11-16 11:34:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 20582 transitions. [2022-11-16 11:34:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-11-16 11:34:22,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:22,577 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:22,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:22,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:34:22,791 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2041153065, now seen corresponding path program 1 times [2022-11-16 11:34:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925066469] [2022-11-16 11:34:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:34:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:34:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:34:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:34:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:34:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 11:34:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:34:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:34:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:34:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:34:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:34:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:34:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:34:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 11:34:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:34:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:34:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 11:34:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:34:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 11:34:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 11:34:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-16 11:34:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:34:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:34:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-16 11:34:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-16 11:34:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 61 proven. 48 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-11-16 11:34:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925066469] [2022-11-16 11:34:33,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925066469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878868953] [2022-11-16 11:34:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:33,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:33,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc7ab70-dd03-4aad-9809-5503389206ae/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:34:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 2388 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-16 11:34:34,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:35,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 11:34:35,514 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:34:35,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:34:36,720 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 11:34:36,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 30 [2022-11-16 11:34:36,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 11:34:37,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 11:34:37,895 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:34:37,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 28 [2022-11-16 11:34:41,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:41,838 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:34:41,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 33 [2022-11-16 11:34:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:43,653 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:34:43,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-11-16 11:34:44,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:44,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:44,118 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 11:34:44,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 42 [2022-11-16 11:34:44,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:44,524 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 11:34:44,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 42 [2022-11-16 11:34:45,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:45,139 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 11:34:45,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 42 [2022-11-16 11:34:45,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 11:34:46,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:34:46,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2022-11-16 11:34:48,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 11:34:48,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 11:34:48,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:34:49,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:34:49,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-16 11:34:50,426 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:34:50,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 11:34:50,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 11:34:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 114 proven. 78 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-16 11:34:51,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:01,987 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-16 11:35:01,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 127 [2022-11-16 11:35:01,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:35:01,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-16 11:35:03,894 WARN L833 $PredicateComparison]: unable to prove that (or (and (not (= (+ |c_old(~last_index~0)| 1) 0)) (or (and (forall ((|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_4| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int) (v_ArrVal_4183 (Array Int Int)) (v_ArrVal_4184 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#set_impl~0.base| v_ArrVal_4183) |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4| v_ArrVal_4184) |c_ldv_skb_alloc_~skb~3#1.base|))) (or (not (= (mod (select .cse0 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_4|)) 4294967296) 0)) (= (mod (select .cse0 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0) (< |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_4| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int) (v_ArrVal_4183 (Array Int Int)) (v_ArrVal_4184 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#set_impl~0.base| v_ArrVal_4183) |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4| v_ArrVal_4184) |c_ldv_skb_alloc_~skb~3#1.base|))) (or (= (select |c_old(#valid)| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_4|) 0) (not (= (mod (select .cse1 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_4|)) 4294967296) 0)) (= (mod (select .cse1 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0))))) (and (= (select |c_old(#valid)| |c_~#set_impl~0.base|) 0) (< |c_~#set_impl~0.base| |c_#StackHeapBarrier|)))) (= (+ c_~last_index~0 1) 0)) is different from false [2022-11-16 11:35:05,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:05,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 460 treesize of output 455 [2022-11-16 11:35:05,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:05,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 423 [2022-11-16 11:35:05,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:05,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 412 treesize of output 407 [2022-11-16 11:35:05,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:05,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 399 [2022-11-16 11:35:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878868953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:06,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:06,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49] total 93 [2022-11-16 11:35:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443198086] [2022-11-16 11:35:06,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:06,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-11-16 11:35:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-11-16 11:35:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=11101, Unknown=68, NotChecked=216, Total=12210 [2022-11-16 11:35:06,039 INFO L87 Difference]: Start difference. First operand 14449 states and 20582 transitions. Second operand has 93 states, 91 states have (on average 3.6373626373626373) internal successors, (331), 78 states have internal predecessors, (331), 25 states have call successors, (59), 16 states have call predecessors, (59), 22 states have return successors, (58), 27 states have call predecessors, (58), 25 states have call successors, (58) [2022-11-16 11:36:21,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:23,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:25,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:27,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:29,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:31,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:33,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:35,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:39,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:41,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:43,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:45,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:47,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:49,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:51,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:53,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:55,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:57,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:36:59,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:01,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:03,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:05,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:07,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:09,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:11,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:13,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:15,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:17,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:19,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:21,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:23,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:25,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:27,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:29,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:34,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:36,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:38,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:40,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:42,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:44,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:46,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:48,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:50,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:52,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:54,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:56,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:37:58,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:00,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:02,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:04,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:06,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:08,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:10,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:12,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:14,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:38:16,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []