./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:53:34,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:53:34,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:53:34,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:53:34,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:53:34,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:53:34,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:53:34,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:53:34,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:53:34,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:53:34,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:53:34,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:53:34,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:53:34,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:53:34,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:53:34,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:53:34,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:53:34,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:53:34,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:53:34,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:53:34,823 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:53:34,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:53:34,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:53:34,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:53:34,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:53:34,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:53:34,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:53:34,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:53:34,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:53:34,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:53:34,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:53:34,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:53:34,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:53:34,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:53:34,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:53:34,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:53:34,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:53:34,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:53:34,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:53:34,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:53:34,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:53:34,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:53:34,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:53:34,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:53:34,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:53:34,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:53:34,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:53:34,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:53:34,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:53:34,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:53:34,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:53:34,873 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:53:34,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:53:34,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:53:34,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:53:34,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:53:34,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:53:34,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:53:34,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:53:34,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:53:34,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:53:34,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:53:34,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:53:34,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:53:34,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:53:34,876 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:53:34,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:53:34,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:53:34,877 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2022-07-21 09:53:35,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:53:35,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:53:35,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:53:35,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:53:35,167 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:53:35,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-21 09:53:35,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66e1eafb/ccd9278f992c4364a3dac686dde792b0/FLAGb5b335279 [2022-07-21 09:53:35,783 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:53:35,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-21 09:53:35,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66e1eafb/ccd9278f992c4364a3dac686dde792b0/FLAGb5b335279 [2022-07-21 09:53:35,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66e1eafb/ccd9278f992c4364a3dac686dde792b0 [2022-07-21 09:53:36,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:53:36,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:53:36,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:53:36,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:53:36,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:53:36,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:53:36" (1/1) ... [2022-07-21 09:53:36,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c0a0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:36, skipping insertion in model container [2022-07-21 09:53:36,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:53:36" (1/1) ... [2022-07-21 09:53:36,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:53:36,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:53:37,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-21 09:53:37,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:53:37,520 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:53:37,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-21 09:53:37,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:53:37,891 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:53:37,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37 WrapperNode [2022-07-21 09:53:37,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:53:37,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:53:37,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:53:37,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:53:37,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:37,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,102 INFO L137 Inliner]: procedures = 309, calls = 2432, calls flagged for inlining = 139, calls inlined = 90, statements flattened = 3953 [2022-07-21 09:53:38,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:53:38,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:53:38,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:53:38,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:53:38,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:53:38,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:53:38,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:53:38,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:53:38,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (1/1) ... [2022-07-21 09:53:38,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:53:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:38,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 09:53:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 09:53:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-21 09:53:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-21 09:53:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-21 09:53:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-21 09:53:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_ctl_ioctl [2022-07-21 09:53:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_ctl_ioctl [2022-07-21 09:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_release [2022-07-21 09:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_release [2022-07-21 09:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2022-07-21 09:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2022-07-21 09:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_disc_info [2022-07-21 09:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_disc_info [2022-07-21 09:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_bio_alloc [2022-07-21 09:53:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_bio_alloc [2022-07-21 09:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:53:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_setup_dev [2022-07-21 09:53:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_setup_dev [2022-07-21 09:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-21 09:53:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-21 09:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure bdget [2022-07-21 09:53:38,378 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget [2022-07-21 09:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_set_speed [2022-07-21 09:53:38,378 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_set_speed [2022-07-21 09:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure bdevname [2022-07-21 09:53:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure bdevname [2022-07-21 09:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 09:53:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 09:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_shrink_pktlist [2022-07-21 09:53:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_shrink_pktlist [2022-07-21 09:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 09:53:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 09:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-21 09:53:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-21 09:53:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 09:53:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 09:53:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 09:53:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 09:53:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-21 09:53:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-21 09:53:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure new_encode_dev [2022-07-21 09:53:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure new_encode_dev [2022-07-21 09:53:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 09:53:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 09:53:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_select [2022-07-21 09:53:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_select [2022-07-21 09:53:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_remove [2022-07-21 09:53:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_remove [2022-07-21 09:53:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-21 09:53:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-21 09:53:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_debugfs_cleanup [2022-07-21 09:53:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_debugfs_cleanup [2022-07-21 09:53:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:53:38,383 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 09:53:38,383 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 09:53:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure bio_init [2022-07-21 09:53:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_init [2022-07-21 09:53:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure set_blocksize [2022-07-21 09:53:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure set_blocksize [2022-07-21 09:53:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_dump_sense [2022-07-21 09:53:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_dump_sense [2022-07-21 09:53:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_create_kmalloc_pool [2022-07-21 09:53:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_create_kmalloc_pool [2022-07-21 09:53:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-21 09:53:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-21 09:53:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:53:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2022-07-21 09:53:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2022-07-21 09:53:38,386 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_lock_door [2022-07-21 09:53:38,386 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_lock_door [2022-07-21 09:53:38,386 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_get [2022-07-21 09:53:38,386 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_get [2022-07-21 09:53:38,386 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_remove_dev [2022-07-21 09:53:38,386 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_remove_dev [2022-07-21 09:53:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2022-07-21 09:53:38,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2022-07-21 09:53:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:53:38,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:53:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:53:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure bio_put [2022-07-21 09:53:38,387 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_put [2022-07-21 09:53:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:53:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 09:53:38,388 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 09:53:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-21 09:53:38,388 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-21 09:53:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2022-07-21 09:53:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2022-07-21 09:53:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_dir [2022-07-21 09:53:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_dir [2022-07-21 09:53:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 09:53:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 09:53:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 09:53:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 09:53:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-21 09:53:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-21 09:53:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 09:53:38,391 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 09:53:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 09:53:38,391 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 09:53:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_sysfs_cleanup [2022-07-21 09:53:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_sysfs_cleanup [2022-07-21 09:53:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_init [2022-07-21 09:53:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_init [2022-07-21 09:53:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_find_dev_from_minor [2022-07-21 09:53:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_find_dev_from_minor [2022-07-21 09:53:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 09:53:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 09:53:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 09:53:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 09:53:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 09:53:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 09:53:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 09:53:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure init_write_congestion_marks [2022-07-21 09:53:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure init_write_congestion_marks [2022-07-21 09:53:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-21 09:53:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-21 09:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_track_info [2022-07-21 09:53:38,396 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_track_info [2022-07-21 09:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:53:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2022-07-21 09:53:38,398 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2022-07-21 09:53:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 09:53:38,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 09:53:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure new_decode_dev [2022-07-21 09:53:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure new_decode_dev [2022-07-21 09:53:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 09:53:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 09:53:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_create [2022-07-21 09:53:38,403 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_create [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:53:38,403 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-21 09:53:38,403 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-21 09:53:38,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-21 09:53:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_put [2022-07-21 09:53:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_put [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-21 09:53:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure queue_max_segments [2022-07-21 09:53:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_max_segments [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2022-07-21 09:53:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2022-07-21 09:53:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure init_cdrom_command [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure init_cdrom_command [2022-07-21 09:53:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-21 09:53:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_sense [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_sense [2022-07-21 09:53:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-21 09:53:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_generic_packet [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_generic_packet [2022-07-21 09:53:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 09:53:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 09:53:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2022-07-21 09:53:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_flush_cache [2022-07-21 09:53:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_flush_cache [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:53:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:53:38,406 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 09:53:38,407 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 09:53:38,982 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:53:38,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:53:39,100 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,195 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-21 09:53:39,195 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-21 09:53:39,966 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,970 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,970 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,972 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,974 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,975 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:39,978 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##282: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##281: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##214: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##324: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume !false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##152: assume false; [2022-07-21 09:53:43,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume !false; [2022-07-21 09:53:43,154 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:53:43,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:53:43,168 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 09:53:43,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:53:43 BoogieIcfgContainer [2022-07-21 09:53:43,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:53:43,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:53:43,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:53:43,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:53:43,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:53:36" (1/3) ... [2022-07-21 09:53:43,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e002c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:53:43, skipping insertion in model container [2022-07-21 09:53:43,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:37" (2/3) ... [2022-07-21 09:53:43,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e002c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:53:43, skipping insertion in model container [2022-07-21 09:53:43,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:53:43" (3/3) ... [2022-07-21 09:53:43,185 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-21 09:53:43,194 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:53:43,194 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:53:43,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:53:43,244 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7589248e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67645edb [2022-07-21 09:53:43,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:53:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2022-07-21 09:53:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 09:53:43,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:43,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:43,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1322109639, now seen corresponding path program 1 times [2022-07-21 09:53:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306855858] [2022-07-21 09:53:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:53:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306855858] [2022-07-21 09:53:43,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306855858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:43,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:43,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:53:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159395204] [2022-07-21 09:53:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:43,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:53:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:53:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:53:43,684 INFO L87 Difference]: Start difference. First operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 09:53:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:45,916 INFO L93 Difference]: Finished difference Result 3723 states and 5356 transitions. [2022-07-21 09:53:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-21 09:53:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:45,978 INFO L225 Difference]: With dead ends: 3723 [2022-07-21 09:53:45,980 INFO L226 Difference]: Without dead ends: 2511 [2022-07-21 09:53:45,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-07-21 09:53:45,997 INFO L413 NwaCegarLoop]: 1879 mSDtfsCounter, 2130 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:45,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 3915 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 09:53:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-07-21 09:53:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2314. [2022-07-21 09:53:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.3114457831325301) internal successors, (2177), 1693 states have internal predecessors, (2177), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:53:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3172 transitions. [2022-07-21 09:53:46,156 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3172 transitions. Word has length 23 [2022-07-21 09:53:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:46,156 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3172 transitions. [2022-07-21 09:53:46,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 09:53:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3172 transitions. [2022-07-21 09:53:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 09:53:46,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:46,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:53:46,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:53:46,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1781808508, now seen corresponding path program 1 times [2022-07-21 09:53:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:46,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330347201] [2022-07-21 09:53:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:53:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 09:53:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:53:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:53:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:53:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:53:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:53:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:53:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:53:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:53:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 09:53:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:53:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 09:53:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:53:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 09:53:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:53:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330347201] [2022-07-21 09:53:46,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330347201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:46,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:46,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:53:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069726228] [2022-07-21 09:53:46,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:46,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:53:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:53:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:53:46,496 INFO L87 Difference]: Start difference. First operand 2314 states and 3172 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:53:50,308 WARN L534 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-07-21 09:53:52,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:53:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:53,972 INFO L93 Difference]: Finished difference Result 4811 states and 6660 transitions. [2022-07-21 09:53:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:53:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2022-07-21 09:53:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:53,985 INFO L225 Difference]: With dead ends: 4811 [2022-07-21 09:53:53,985 INFO L226 Difference]: Without dead ends: 2546 [2022-07-21 09:53:53,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:53:53,993 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 929 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 651 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 4787 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:53,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 4787 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 3268 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-21 09:53:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-21 09:53:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2314. [2022-07-21 09:53:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.310843373493976) internal successors, (2176), 1693 states have internal predecessors, (2176), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:53:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3171 transitions. [2022-07-21 09:53:54,058 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3171 transitions. Word has length 138 [2022-07-21 09:53:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:54,058 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3171 transitions. [2022-07-21 09:53:54,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:53:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3171 transitions. [2022-07-21 09:53:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 09:53:54,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:54,062 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:53:54,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:53:54,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -852391828, now seen corresponding path program 1 times [2022-07-21 09:53:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:54,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034356057] [2022-07-21 09:53:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:53:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:53:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:53:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:53:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:53:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:53:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:53:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:53:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 09:53:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:53:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:53:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:53:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 09:53:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 09:53:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:54,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034356057] [2022-07-21 09:53:54,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034356057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:54,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:54,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:53:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826575661] [2022-07-21 09:53:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:54,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:53:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:53:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:53:54,391 INFO L87 Difference]: Start difference. First operand 2314 states and 3171 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 09:53:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:56,712 INFO L93 Difference]: Finished difference Result 4913 states and 6821 transitions. [2022-07-21 09:53:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:53:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2022-07-21 09:53:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:56,725 INFO L225 Difference]: With dead ends: 4913 [2022-07-21 09:53:56,725 INFO L226 Difference]: Without dead ends: 2650 [2022-07-21 09:53:56,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:53:56,734 INFO L413 NwaCegarLoop]: 1537 mSDtfsCounter, 1367 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 1047 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1047 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:56,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 3455 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1047 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 09:53:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-07-21 09:53:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2324. [2022-07-21 09:53:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.311377245508982) internal successors, (2190), 1703 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:53:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3185 transitions. [2022-07-21 09:53:56,799 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3185 transitions. Word has length 145 [2022-07-21 09:53:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:56,800 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3185 transitions. [2022-07-21 09:53:56,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 09:53:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3185 transitions. [2022-07-21 09:53:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-21 09:53:56,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:56,803 INFO L195 NwaCegarLoop]: trace histogram [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-07-21 09:53:56,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:53:56,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 439921461, now seen corresponding path program 1 times [2022-07-21 09:53:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:56,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513367489] [2022-07-21 09:53:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:53:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:53:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:53:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:53:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:53:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:53:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:53:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:53:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:53:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 09:53:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 09:53:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:53:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:53:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:53:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 09:53:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513367489] [2022-07-21 09:53:57,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513367489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:57,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:57,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:53:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946161498] [2022-07-21 09:53:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:53:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:53:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:53:57,087 INFO L87 Difference]: Start difference. First operand 2324 states and 3185 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 09:54:00,853 WARN L534 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-07-21 09:54:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:02,475 INFO L93 Difference]: Finished difference Result 4833 states and 6690 transitions. [2022-07-21 09:54:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:54:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2022-07-21 09:54:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:02,490 INFO L225 Difference]: With dead ends: 4833 [2022-07-21 09:54:02,491 INFO L226 Difference]: Without dead ends: 2556 [2022-07-21 09:54:02,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:54:02,503 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 1244 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 3658 mSolverCounterSat, 959 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 959 IncrementalHoareTripleChecker+Valid, 3658 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:02,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 5006 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [959 Valid, 3658 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 09:54:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-21 09:54:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-21 09:54:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3107784431137726) internal successors, (2189), 1702 states have internal predecessors, (2189), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:54:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3184 transitions. [2022-07-21 09:54:02,584 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3184 transitions. Word has length 142 [2022-07-21 09:54:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:02,584 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3184 transitions. [2022-07-21 09:54:02,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 09:54:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3184 transitions. [2022-07-21 09:54:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 09:54:02,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:02,590 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:54:02,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:54:02,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1210414124, now seen corresponding path program 1 times [2022-07-21 09:54:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:02,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963535709] [2022-07-21 09:54:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:54:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:54:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:54:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:54:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:54:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:54:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:54:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 09:54:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 09:54:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:54:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 09:54:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:54:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 09:54:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 09:54:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 09:54:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963535709] [2022-07-21 09:54:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963535709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:02,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:54:02,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:54:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214466148] [2022-07-21 09:54:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:54:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:54:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:54:02,884 INFO L87 Difference]: Start difference. First operand 2324 states and 3184 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 09:54:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:06,895 INFO L93 Difference]: Finished difference Result 4867 states and 6734 transitions. [2022-07-21 09:54:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:54:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 172 [2022-07-21 09:54:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:06,907 INFO L225 Difference]: With dead ends: 4867 [2022-07-21 09:54:06,908 INFO L226 Difference]: Without dead ends: 2556 [2022-07-21 09:54:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:54:06,914 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 933 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 5152 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 6276 SdHoareTripleChecker+Invalid, 5811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 5152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 6276 Invalid, 5811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 5152 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-21 09:54:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-21 09:54:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-21 09:54:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3101796407185629) internal successors, (2188), 1702 states have internal predecessors, (2188), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:54:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3183 transitions. [2022-07-21 09:54:06,983 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3183 transitions. Word has length 172 [2022-07-21 09:54:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:06,983 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3183 transitions. [2022-07-21 09:54:06,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 09:54:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3183 transitions. [2022-07-21 09:54:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 09:54:06,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:06,986 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:54:06,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:54:06,987 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -848117149, now seen corresponding path program 1 times [2022-07-21 09:54:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:06,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554961548] [2022-07-21 09:54:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 09:54:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:54:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:54:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:54:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:54:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 09:54:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 09:54:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 09:54:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:54:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 09:54:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 09:54:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:54:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 09:54:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:54:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 09:54:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 09:54:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:07,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554961548] [2022-07-21 09:54:07,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554961548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:07,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:54:07,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:54:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603991321] [2022-07-21 09:54:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:07,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:54:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:07,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:54:07,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:54:07,229 INFO L87 Difference]: Start difference. First operand 2324 states and 3183 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 09:54:11,724 WARN L534 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-07-21 09:54:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:14,114 INFO L93 Difference]: Finished difference Result 7831 states and 11495 transitions. [2022-07-21 09:54:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:54:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 174 [2022-07-21 09:54:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:14,152 INFO L225 Difference]: With dead ends: 7831 [2022-07-21 09:54:14,152 INFO L226 Difference]: Without dead ends: 5550 [2022-07-21 09:54:14,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:54:14,159 INFO L413 NwaCegarLoop]: 2990 mSDtfsCounter, 2730 mSDsluCounter, 7058 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 977 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3110 SdHoareTripleChecker+Valid, 10048 SdHoareTripleChecker+Invalid, 5903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 977 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:14,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3110 Valid, 10048 Invalid, 5903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [977 Valid, 4925 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 09:54:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2022-07-21 09:54:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 2326. [2022-07-21 09:54:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 1672 states have (on average 1.3098086124401913) internal successors, (2190), 1704 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-21 09:54:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3185 transitions. [2022-07-21 09:54:14,248 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3185 transitions. Word has length 174 [2022-07-21 09:54:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:14,248 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3185 transitions. [2022-07-21 09:54:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 09:54:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3185 transitions. [2022-07-21 09:54:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-21 09:54:14,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:14,251 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 09:54:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:54:14,252 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1490806641, now seen corresponding path program 1 times [2022-07-21 09:54:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:14,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076989907] [2022-07-21 09:54:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:54:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:54:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 09:54:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:54:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:54:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:54:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 09:54:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:54:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 09:54:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 09:54:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 09:54:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:54:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 09:54:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:54:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 09:54:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-21 09:54:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 09:54:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076989907] [2022-07-21 09:54:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076989907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94368484] [2022-07-21 09:54:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:54:14,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:54:14,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:54:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 09:54:15,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:54:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 09:54:15,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:54:15,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94368484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:15,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:54:15,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-21 09:54:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727597397] [2022-07-21 09:54:15,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:15,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:54:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:15,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:54:15,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:54:15,383 INFO L87 Difference]: Start difference. First operand 2326 states and 3185 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-21 09:54:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:15,541 INFO L93 Difference]: Finished difference Result 4637 states and 6351 transitions. [2022-07-21 09:54:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:54:15,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 179 [2022-07-21 09:54:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:15,550 INFO L225 Difference]: With dead ends: 4637 [2022-07-21 09:54:15,550 INFO L226 Difference]: Without dead ends: 2304 [2022-07-21 09:54:15,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:54:15,557 INFO L413 NwaCegarLoop]: 1620 mSDtfsCounter, 15 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:15,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9692 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:54:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-07-21 09:54:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2022-07-21 09:54:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1659 states have (on average 1.3092224231464737) internal successors, (2172), 1690 states have internal predecessors, (2172), 491 states have call successors, (491), 154 states have call predecessors, (491), 153 states have return successors, (492), 483 states have call predecessors, (492), 489 states have call successors, (492) [2022-07-21 09:54:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3155 transitions. [2022-07-21 09:54:15,622 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3155 transitions. Word has length 179 [2022-07-21 09:54:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:15,623 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3155 transitions. [2022-07-21 09:54:15,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-21 09:54:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3155 transitions. [2022-07-21 09:54:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-21 09:54:15,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:15,626 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-21 09:54:15,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:54:15,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:15,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash 255731860, now seen corresponding path program 1 times [2022-07-21 09:54:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:15,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749356890] [2022-07-21 09:54:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 09:54:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:54:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:54:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:54:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:54:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:54:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:54:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 09:54:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:54:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:54:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 09:54:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 09:54:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:54:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:54:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:54:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:54:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:54:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 09:54:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:16,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749356890] [2022-07-21 09:54:16,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749356890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:16,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:54:16,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:54:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322214292] [2022-07-21 09:54:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:16,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:54:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:54:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:54:16,066 INFO L87 Difference]: Start difference. First operand 2304 states and 3155 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 09:54:19,341 WARN L534 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-07-21 09:54:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:19,957 INFO L93 Difference]: Finished difference Result 4861 states and 6721 transitions. [2022-07-21 09:54:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:54:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 198 [2022-07-21 09:54:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:19,988 INFO L225 Difference]: With dead ends: 4861 [2022-07-21 09:54:19,988 INFO L226 Difference]: Without dead ends: 2588 [2022-07-21 09:54:19,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:54:19,996 INFO L413 NwaCegarLoop]: 1514 mSDtfsCounter, 2499 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 1358 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1358 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 2660 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1358 Valid, 934 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-21 09:54:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2022-07-21 09:54:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2339. [2022-07-21 09:54:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1682 states have (on average 1.302615933412604) internal successors, (2191), 1713 states have internal predecessors, (2191), 496 states have call successors, (496), 161 states have call predecessors, (496), 160 states have return successors, (497), 488 states have call predecessors, (497), 494 states have call successors, (497) [2022-07-21 09:54:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3184 transitions. [2022-07-21 09:54:20,090 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3184 transitions. Word has length 198 [2022-07-21 09:54:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:20,091 INFO L495 AbstractCegarLoop]: Abstraction has 2339 states and 3184 transitions. [2022-07-21 09:54:20,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 09:54:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3184 transitions. [2022-07-21 09:54:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-21 09:54:20,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:20,094 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-21 09:54:20,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:54:20,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1595536580, now seen corresponding path program 1 times [2022-07-21 09:54:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:20,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750033095] [2022-07-21 09:54:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 09:54:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:54:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:54:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:54:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:54:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:54:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:54:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:54:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:54:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:54:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 09:54:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 09:54:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:54:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:54:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:54:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:54:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 09:54:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:20,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750033095] [2022-07-21 09:54:20,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750033095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:20,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521204035] [2022-07-21 09:54:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:20,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:54:20,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:54:20,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:54:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 09:54:21,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:54:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 09:54:21,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:54:21,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521204035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:21,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:54:21,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-21 09:54:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86778165] [2022-07-21 09:54:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:21,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:54:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:21,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:54:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:54:21,224 INFO L87 Difference]: Start difference. First operand 2339 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 09:54:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:21,353 INFO L93 Difference]: Finished difference Result 4625 states and 6318 transitions. [2022-07-21 09:54:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:54:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2022-07-21 09:54:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:21,361 INFO L225 Difference]: With dead ends: 4625 [2022-07-21 09:54:21,361 INFO L226 Difference]: Without dead ends: 2349 [2022-07-21 09:54:21,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:54:21,367 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 15 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7977 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:21,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7977 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:54:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-21 09:54:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2347. [2022-07-21 09:54:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1689 states have (on average 1.3013617525162817) internal successors, (2198), 1721 states have internal predecessors, (2198), 496 states have call successors, (496), 161 states have call predecessors, (496), 161 states have return successors, (499), 488 states have call predecessors, (499), 494 states have call successors, (499) [2022-07-21 09:54:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3193 transitions. [2022-07-21 09:54:21,455 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3193 transitions. Word has length 193 [2022-07-21 09:54:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:21,456 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3193 transitions. [2022-07-21 09:54:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 09:54:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3193 transitions. [2022-07-21 09:54:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-21 09:54:21,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:21,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-21 09:54:21,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:54:21,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 09:54:21,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -388855203, now seen corresponding path program 1 times [2022-07-21 09:54:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:21,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893865620] [2022-07-21 09:54:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 09:54:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:54:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:54:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:54:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 09:54:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 09:54:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 09:54:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:54:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 09:54:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 09:54:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:54:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 09:54:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:54:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 09:54:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 09:54:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:54:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 09:54:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 09:54:21,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893865620] [2022-07-21 09:54:21,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893865620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291412242] [2022-07-21 09:54:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:54:21,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:54:22,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 09:54:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:22,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 3231 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 09:54:22,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:54:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 09:54:22,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:54:22,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291412242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:54:22,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:54:22,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 19 [2022-07-21 09:54:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379021406] [2022-07-21 09:54:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:54:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:54:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:54:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:54:22,984 INFO L87 Difference]: Start difference. First operand 2347 states and 3193 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 09:54:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:23,317 INFO L93 Difference]: Finished difference Result 4685 states and 6403 transitions. [2022-07-21 09:54:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:54:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) Word has length 196 [2022-07-21 09:54:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:23,326 INFO L225 Difference]: With dead ends: 4685 [2022-07-21 09:54:23,327 INFO L226 Difference]: Without dead ends: 2373 [2022-07-21 09:54:23,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:54:23,332 INFO L413 NwaCegarLoop]: 1609 mSDtfsCounter, 65 mSDsluCounter, 14414 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 16023 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:23,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 16023 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:54:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-07-21 09:54:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2349. [2022-07-21 09:54:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1690 states have (on average 1.3011834319526627) internal successors, (2199), 1723 states have internal predecessors, (2199), 496 states have call successors, (496), 161 states have call predecessors, (496), 162 states have return successors, (500), 488 states have call predecessors, (500), 494 states have call successors, (500) [2022-07-21 09:54:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3195 transitions. [2022-07-21 09:54:23,405 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3195 transitions. Word has length 196 [2022-07-21 09:54:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:23,405 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3195 transitions. [2022-07-21 09:54:23,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 09:54:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3195 transitions. [2022-07-21 09:54:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-21 09:54:23,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:23,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:54:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 09:54:23,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:23,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 173882668, now seen corresponding path program 1 times [2022-07-21 09:54:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:23,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906230424] [2022-07-21 09:54:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:54:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:54:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:54:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:54:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:54:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:54:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:54:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 09:54:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:54:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:54:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 09:54:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:54:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 09:54:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:54:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 09:54:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:54:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:54:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:54:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 09:54:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 09:54:23,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:23,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906230424] [2022-07-21 09:54:23,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906230424] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:23,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434348770] [2022-07-21 09:54:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:23,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:54:23,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:54:23,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 09:54:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:24,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-21 09:54:24,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:54:24,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:54:24,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:24,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:54:24,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:24,640 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:54:24,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:54:24,851 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:54:24,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:54:25,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:54:25,692 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:54:25,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:54:25,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:25,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:25,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:54:26,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:54:26,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:54:26,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:26,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:54:26,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:54:27,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:54:27,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:54:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 09:54:27,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:54:28,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434348770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:28,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:54:28,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 32 [2022-07-21 09:54:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645826900] [2022-07-21 09:54:28,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:54:28,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 09:54:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 09:54:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1248, Unknown=6, NotChecked=0, Total=1406 [2022-07-21 09:54:28,243 INFO L87 Difference]: Start difference. First operand 2349 states and 3195 transitions. Second operand has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-21 09:54:35,625 WARN L534 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-07-21 09:54:37,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:39,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:41,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:43,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:46,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:48,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:50,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:52,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:54,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:57,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 09:54:59,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:01,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:03,276 WARN L534 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-07-21 09:55:05,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:55:08,579 INFO L93 Difference]: Finished difference Result 4936 states and 6774 transitions. [2022-07-21 09:55:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 09:55:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) Word has length 203 [2022-07-21 09:55:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:55:08,587 INFO L225 Difference]: With dead ends: 4936 [2022-07-21 09:55:08,587 INFO L226 Difference]: Without dead ends: 2590 [2022-07-21 09:55:08,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=2430, Unknown=6, NotChecked=0, Total=2756 [2022-07-21 09:55:08,593 INFO L413 NwaCegarLoop]: 1508 mSDtfsCounter, 952 mSDsluCounter, 11744 mSDsCounter, 0 mSdLazyCounter, 11020 mSolverCounterSat, 672 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 13252 SdHoareTripleChecker+Invalid, 18285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 11020 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 6578 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:55:08,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 13252 Invalid, 18285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [672 Valid, 11020 Invalid, 15 Unknown, 6578 Unchecked, 39.5s Time] [2022-07-21 09:55:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-21 09:55:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2358. [2022-07-21 09:55:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1697 states have (on average 1.299351797289334) internal successors, (2205), 1729 states have internal predecessors, (2205), 497 states have call successors, (497), 163 states have call predecessors, (497), 163 states have return successors, (500), 489 states have call predecessors, (500), 495 states have call successors, (500) [2022-07-21 09:55:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3202 transitions. [2022-07-21 09:55:08,747 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3202 transitions. Word has length 203 [2022-07-21 09:55:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:55:08,748 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3202 transitions. [2022-07-21 09:55:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-21 09:55:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3202 transitions. [2022-07-21 09:55:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-21 09:55:08,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:55:08,752 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:55:08,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:55:08,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:55:08,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:55:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:55:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 781303217, now seen corresponding path program 2 times [2022-07-21 09:55:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:55:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879528152] [2022-07-21 09:55:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:55:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:55:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:55:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:55:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:55:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:55:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:55:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:55:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:55:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:55:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:55:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:55:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:55:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:55:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 09:55:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:55:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:55:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 09:55:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 09:55:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 09:55:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 09:55:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 09:55:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 09:55:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-21 09:55:09,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:55:09,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879528152] [2022-07-21 09:55:09,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879528152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:55:09,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815402525] [2022-07-21 09:55:09,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:55:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:55:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:55:09,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:55:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 09:55:10,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:55:10,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:55:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-21 09:55:10,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:55:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:10,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:10,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:10,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:10,862 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:10,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:11,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:11,325 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:11,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:11,552 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 09:55:11,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 09:55:11,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:12,587 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 09:55:12,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 09:55:12,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-21 09:55:12,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-21 09:55:12,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-21 09:55:13,713 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 09:55:13,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 26 [2022-07-21 09:55:14,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:14,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:14,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:14,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:14,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:55:14,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:55:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 09:55:14,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:55:16,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815402525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:55:16,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:55:16,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 38 [2022-07-21 09:55:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355591705] [2022-07-21 09:55:16,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:55:16,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 09:55:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:55:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 09:55:16,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1680, Unknown=9, NotChecked=0, Total=1892 [2022-07-21 09:55:16,006 INFO L87 Difference]: Start difference. First operand 2358 states and 3202 transitions. Second operand has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-21 09:55:28,917 WARN L534 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-07-21 09:55:32,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:34,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:36,355 WARN L534 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-07-21 09:55:38,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:55:40,759 WARN L534 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-07-21 09:55:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:55:48,313 INFO L93 Difference]: Finished difference Result 7358 states and 10175 transitions. [2022-07-21 09:55:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-21 09:55:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) Word has length 210 [2022-07-21 09:55:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:55:48,337 INFO L225 Difference]: With dead ends: 7358 [2022-07-21 09:55:48,337 INFO L226 Difference]: Without dead ends: 5066 [2022-07-21 09:55:48,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=459, Invalid=4362, Unknown=9, NotChecked=0, Total=4830 [2022-07-21 09:55:48,346 INFO L413 NwaCegarLoop]: 2923 mSDtfsCounter, 2589 mSDsluCounter, 29182 mSDsCounter, 0 mSdLazyCounter, 20577 mSolverCounterSat, 1486 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2831 SdHoareTripleChecker+Valid, 32105 SdHoareTripleChecker+Invalid, 42094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1486 IncrementalHoareTripleChecker+Valid, 20577 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 20027 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:55:48,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2831 Valid, 32105 Invalid, 42094 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1486 Valid, 20577 Invalid, 4 Unknown, 20027 Unchecked, 30.6s Time] [2022-07-21 09:55:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-07-21 09:55:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4604. [2022-07-21 09:55:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 3316 states have (on average 1.3027744270205066) internal successors, (4320), 3383 states have internal predecessors, (4320), 967 states have call successors, (967), 314 states have call predecessors, (967), 320 states have return successors, (999), 954 states have call predecessors, (999), 965 states have call successors, (999) [2022-07-21 09:55:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6286 transitions. [2022-07-21 09:55:48,565 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6286 transitions. Word has length 210 [2022-07-21 09:55:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:55:48,565 INFO L495 AbstractCegarLoop]: Abstraction has 4604 states and 6286 transitions. [2022-07-21 09:55:48,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-21 09:55:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6286 transitions. [2022-07-21 09:55:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-21 09:55:48,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:55:48,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:55:48,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 09:55:48,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 09:55:48,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:55:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:55:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1144769715, now seen corresponding path program 1 times [2022-07-21 09:55:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:55:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849927953] [2022-07-21 09:55:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:55:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:55:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:55:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:55:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:55:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:55:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:55:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:50,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:55:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:55:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:55:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:55:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:55:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:55:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:55:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:55:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 09:55:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:55:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:55:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 09:55:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 09:55:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 09:55:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 09:55:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 09:55:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 09:55:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 09:55:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:55:51,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849927953] [2022-07-21 09:55:51,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849927953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:55:51,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724942495] [2022-07-21 09:55:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:55:51,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:55:51,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:55:51,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:55:51,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 09:55:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:51,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-21 09:55:51,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:55:51,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:51,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:51,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:51,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:51,925 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:51,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:52,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:52,264 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:52,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:52,362 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:52,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:52,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:53,226 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:55:53,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:55:53,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:53,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:53,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:55:53,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:55:54,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:54,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:54,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:54,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:54,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:55:54,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:55:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 09:55:54,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:55:55,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| Int) (v_ArrVal_838 Int) (v_ArrVal_839 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_838))) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|)) (not (= (select .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27|) 0)) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_841) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_839) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|)) 18446744073709551616) 0) (not (= (select (store .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|) 0))))) is different from false [2022-07-21 09:55:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724942495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:55:55,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:55:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2022-07-21 09:55:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188148694] [2022-07-21 09:55:55,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:55:55,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 09:55:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:55:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 09:55:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1927, Unknown=1, NotChecked=90, Total=2256 [2022-07-21 09:55:55,068 INFO L87 Difference]: Start difference. First operand 4604 states and 6286 transitions. Second operand has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-21 09:56:08,724 WARN L534 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-07-21 09:56:10,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:56:12,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:56:15,893 WARN L534 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-07-21 09:56:17,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:56:20,019 WARN L534 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-07-21 09:56:22,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:56:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:26,975 INFO L93 Difference]: Finished difference Result 8430 states and 11667 transitions. [2022-07-21 09:56:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-21 09:56:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) Word has length 210 [2022-07-21 09:56:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:26,990 INFO L225 Difference]: With dead ends: 8430 [2022-07-21 09:56:26,991 INFO L226 Difference]: Without dead ends: 6131 [2022-07-21 09:56:26,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=973, Invalid=7772, Unknown=1, NotChecked=184, Total=8930 [2022-07-21 09:56:26,998 INFO L413 NwaCegarLoop]: 1468 mSDtfsCounter, 4866 mSDsluCounter, 10067 mSDsCounter, 0 mSdLazyCounter, 19281 mSolverCounterSat, 3106 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4944 SdHoareTripleChecker+Valid, 11535 SdHoareTripleChecker+Invalid, 26006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3106 IncrementalHoareTripleChecker+Valid, 19281 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 3613 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:26,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4944 Valid, 11535 Invalid, 26006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3106 Valid, 19281 Invalid, 6 Unknown, 3613 Unchecked, 29.9s Time] [2022-07-21 09:56:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2022-07-21 09:56:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5348. [2022-07-21 09:56:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 3863 states have (on average 1.309086202433342) internal successors, (5057), 3945 states have internal predecessors, (5057), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-21 09:56:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7283 transitions. [2022-07-21 09:56:27,227 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7283 transitions. Word has length 210 [2022-07-21 09:56:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:27,227 INFO L495 AbstractCegarLoop]: Abstraction has 5348 states and 7283 transitions. [2022-07-21 09:56:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-21 09:56:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7283 transitions. [2022-07-21 09:56:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-21 09:56:27,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:27,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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-07-21 09:56:27,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 09:56:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:27,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1868991143, now seen corresponding path program 1 times [2022-07-21 09:56:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027746358] [2022-07-21 09:56:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:56:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:56:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:56:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:56:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:56:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:56:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:56:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:56:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:56:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:56:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:56:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 09:56:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 09:56:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 09:56:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 09:56:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 09:56:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 09:56:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 09:56:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 09:56:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:56:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027746358] [2022-07-21 09:56:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027746358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939645932] [2022-07-21 09:56:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:27,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:56:27,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 09:56:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:28,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:56:28,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:56:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-21 09:56:28,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:56:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 09:56:28,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939645932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:56:28,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:56:28,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-21 09:56:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336687142] [2022-07-21 09:56:28,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:56:28,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:56:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:56:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:56:28,468 INFO L87 Difference]: Start difference. First operand 5348 states and 7283 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-21 09:56:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:56:33,557 INFO L93 Difference]: Finished difference Result 11457 states and 15862 transitions. [2022-07-21 09:56:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:56:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2022-07-21 09:56:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:56:33,575 INFO L225 Difference]: With dead ends: 11457 [2022-07-21 09:56:33,575 INFO L226 Difference]: Without dead ends: 6702 [2022-07-21 09:56:33,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:56:33,584 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 1265 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 6334 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 7092 SdHoareTripleChecker+Invalid, 7207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 6334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:56:33,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 7092 Invalid, 7207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 6334 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-21 09:56:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-07-21 09:56:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 5409. [2022-07-21 09:56:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 3924 states have (on average 1.3093781855249744) internal successors, (5138), 4006 states have internal predecessors, (5138), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-21 09:56:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7364 transitions. [2022-07-21 09:56:33,857 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7364 transitions. Word has length 211 [2022-07-21 09:56:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:56:33,857 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7364 transitions. [2022-07-21 09:56:33,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-21 09:56:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7364 transitions. [2022-07-21 09:56:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 09:56:33,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:56:33,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:56:33,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 09:56:34,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:34,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:56:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:56:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash -946143103, now seen corresponding path program 1 times [2022-07-21 09:56:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:56:34,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403645736] [2022-07-21 09:56:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:56:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:56:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:56:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:56:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:56:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:56:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:56:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:56:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:56:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:56:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:56:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:56:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:56:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 09:56:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 09:56:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-21 09:56:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 09:56:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:56:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 09:56:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 09:56:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 09:56:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 09:56:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-21 09:56:35,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:56:35,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403645736] [2022-07-21 09:56:35,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403645736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:35,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685137979] [2022-07-21 09:56:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:56:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:56:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:56:35,944 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:56:36,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 09:56:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:56:36,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-21 09:56:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:56:36,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:36,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:56:36,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:36,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-21 09:56:36,862 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:56:36,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:37,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:37,310 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:56:37,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:37,469 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:56:37,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:37,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:38,788 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:56:38,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:56:39,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:39,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2022-07-21 09:56:39,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:56:39,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:56:40,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:56:40,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:40,558 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:56:40,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 35 [2022-07-21 09:56:40,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:40,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:56:40,582 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:56:40,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-21 09:56:41,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:56:41,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:56:41,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-07-21 09:56:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 09:56:41,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:56:41,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1081 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|) 0)) (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|)) (= (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1082) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1081) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-21 09:56:41,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1078 Int) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1078) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|) 0)) (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|)) (= (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1082) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1081) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-21 09:56:41,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685137979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:56:41,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:56:41,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2022-07-21 09:56:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579198961] [2022-07-21 09:56:41,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:56:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 09:56:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:56:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 09:56:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2687, Unknown=2, NotChecked=214, Total=3192 [2022-07-21 09:56:41,770 INFO L87 Difference]: Start difference. First operand 5409 states and 7364 transitions. Second operand has 51 states, 49 states have (on average 5.469387755102041) internal successors, (268), 40 states have internal predecessors, (268), 19 states have call successors, (58), 12 states have call predecessors, (58), 17 states have return successors, (52), 23 states have call predecessors, (52), 17 states have call successors, (52) [2022-07-21 09:56:46,574 WARN L534 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-07-21 09:56:48,676 WARN L534 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-07-21 09:56:54,878 WARN L534 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-07-21 09:56:58,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:00,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:02,493 WARN L534 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-07-21 09:57:04,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:06,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:57:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:10,704 INFO L93 Difference]: Finished difference Result 8316 states and 11332 transitions. [2022-07-21 09:57:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 09:57:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 5.469387755102041) internal successors, (268), 40 states have internal predecessors, (268), 19 states have call successors, (58), 12 states have call predecessors, (58), 17 states have return successors, (52), 23 states have call predecessors, (52), 17 states have call successors, (52) Word has length 214 [2022-07-21 09:57:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:10,724 INFO L225 Difference]: With dead ends: 8316 [2022-07-21 09:57:10,725 INFO L226 Difference]: Without dead ends: 5723 [2022-07-21 09:57:10,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=618, Invalid=6194, Unknown=2, NotChecked=326, Total=7140 [2022-07-21 09:57:10,736 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 1147 mSDsluCounter, 6091 mSDsCounter, 0 mSdLazyCounter, 8224 mSolverCounterSat, 646 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 7662 SdHoareTripleChecker+Invalid, 12967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 8224 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 4089 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:10,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 7662 Invalid, 12967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 8224 Invalid, 8 Unknown, 4089 Unchecked, 27.3s Time] [2022-07-21 09:57:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2022-07-21 09:57:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5527. [2022-07-21 09:57:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5527 states, 4020 states have (on average 1.311691542288557) internal successors, (5273), 4103 states have internal predecessors, (5273), 1106 states have call successors, (1106), 392 states have call predecessors, (1106), 400 states have return successors, (1145), 1080 states have call predecessors, (1145), 1104 states have call successors, (1145) [2022-07-21 09:57:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 7524 transitions. [2022-07-21 09:57:10,992 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 7524 transitions. Word has length 214 [2022-07-21 09:57:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:10,993 INFO L495 AbstractCegarLoop]: Abstraction has 5527 states and 7524 transitions. [2022-07-21 09:57:10,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 5.469387755102041) internal successors, (268), 40 states have internal predecessors, (268), 19 states have call successors, (58), 12 states have call predecessors, (58), 17 states have return successors, (52), 23 states have call predecessors, (52), 17 states have call successors, (52) [2022-07-21 09:57:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 7524 transitions. [2022-07-21 09:57:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-21 09:57:11,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:11,001 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:11,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 09:57:11,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 09:57:11,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -573587753, now seen corresponding path program 1 times [2022-07-21 09:57:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:11,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118544564] [2022-07-21 09:57:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:57:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:57:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:57:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:57:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:57:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 09:57:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:57:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:57:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:57:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 09:57:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:57:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:57:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 09:57:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 09:57:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 09:57:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 09:57:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 09:57:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:13,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118544564] [2022-07-21 09:57:13,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118544564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:13,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153550033] [2022-07-21 09:57:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:13,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:13,380 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:57:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 09:57:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 3324 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-21 09:57:14,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:14,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:14,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:57:14,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:14,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:57:14,185 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:57:14,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:14,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:14,698 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:57:14,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:14,787 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:57:14,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:15,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:16,072 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:57:16,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-07-21 09:57:16,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2022-07-21 09:57:16,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:57:16,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:57:17,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:57:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:17,743 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:57:17,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 28 [2022-07-21 09:57:17,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:17,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:57:17,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:57:17,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-21 09:57:18,686 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:57:18,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 14 [2022-07-21 09:57:18,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-21 09:57:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 09:57:18,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:19,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| Int) (v_ArrVal_1211 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| Int) (v_ArrVal_1209 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|)) (not (= (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1211) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1209) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-21 09:57:19,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| Int) (v_ArrVal_1211 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| Int) (v_ArrVal_1209 (Array Int Int)) (v_ArrVal_1207 Int)) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1207) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1211) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1209) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-21 09:57:19,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153550033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:19,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:57:19,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2022-07-21 09:57:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982139329] [2022-07-21 09:57:19,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:19,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 09:57:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 09:57:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2948, Unknown=2, NotChecked=222, Total=3422 [2022-07-21 09:57:19,667 INFO L87 Difference]: Start difference. First operand 5527 states and 7524 transitions. Second operand has 51 states, 50 states have (on average 5.56) internal successors, (278), 39 states have internal predecessors, (278), 15 states have call successors, (58), 12 states have call predecessors, (58), 15 states have return successors, (52), 21 states have call predecessors, (52), 14 states have call successors, (52) [2022-07-21 09:57:29,829 WARN L534 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-07-21 09:57:50,644 WARN L534 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-07-21 09:57:52,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []