./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.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 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 00:27:44,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:27:44,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:27:44,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:27:44,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:27:44,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:27:44,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:27:44,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:27:44,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:27:44,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:27:44,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:27:44,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:27:44,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:27:44,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:27:44,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:27:44,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:27:44,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:27:44,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:27:44,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:27:44,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:27:44,799 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:27:44,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:27:44,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:27:44,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:27:44,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:27:44,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:27:44,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:27:44,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:27:44,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:27:44,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:27:44,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:27:44,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:27:44,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:27:44,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:27:44,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:27:44,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:27:44,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:27:44,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:27:44,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:27:44,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:27:44,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:27:44,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:27:44,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:27:44,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:27:44,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:27:44,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:27:44,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:27:44,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:27:44,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:27:44,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:27:44,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:27:44,869 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:27:44,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:27:44,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:27:44,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:27:44,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:27:44,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:27:44,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:27:44,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:27:44,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:27:44,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:27:44,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:27:44,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:27:44,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:27:44,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:27:44,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:27:44,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:27:44,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:27:44,876 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 -> 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa [2022-07-23 00:27:45,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:27:45,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:27:45,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:27:45,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:27:45,113 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:27:45,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-23 00:27:45,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fd30a7/605b14a7ea32493597fc4d1be81b7f26/FLAG996f4042c [2022-07-23 00:27:45,754 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:27:45,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-23 00:27:45,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fd30a7/605b14a7ea32493597fc4d1be81b7f26/FLAG996f4042c [2022-07-23 00:27:46,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81fd30a7/605b14a7ea32493597fc4d1be81b7f26 [2022-07-23 00:27:46,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:27:46,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:27:46,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:27:46,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:27:46,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:27:46,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:27:46" (1/1) ... [2022-07-23 00:27:46,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292c4c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:46, skipping insertion in model container [2022-07-23 00:27:46,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:27:46" (1/1) ... [2022-07-23 00:27:46,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:27:46,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:27:46,808 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-23 00:27:46,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:27:46,847 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:27:47,008 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-23 00:27:47,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:27:47,040 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:27:47,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47 WrapperNode [2022-07-23 00:27:47,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:27:47,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:27:47,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:27:47,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:27:47,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,134 INFO L137 Inliner]: procedures = 114, calls = 417, calls flagged for inlining = 49, calls inlined = 46, statements flattened = 1211 [2022-07-23 00:27:47,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:27:47,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:27:47,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:27:47,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:27:47,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:27:47,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:27:47,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:27:47,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:27:47,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (1/1) ... [2022-07-23 00:27:47,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:27:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:27:47,284 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-23 00:27:47,336 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-23 00:27:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure raw_open [2022-07-23 00:27:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_open [2022-07-23 00:27:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-23 00:27:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-23 00:27:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:27:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:27:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:27:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 00:27:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 00:27:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_read_iter [2022-07-23 00:27:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_read_iter [2022-07-23 00:27:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:27:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:27:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-23 00:27:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-23 00:27:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure bind_get [2022-07-23 00:27:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_get [2022-07-23 00:27:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:27:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-23 00:27:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-23 00:27:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-23 00:27:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-23 00:27:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:27:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:27:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 00:27:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 00:27:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure bind_set [2022-07-23 00:27:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_set [2022-07-23 00:27:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-23 00:27:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-23 00:27:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 00:27:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 00:27:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:27:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:27:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-23 00:27:47,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-23 00:27:47,382 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 00:27:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:27:47,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 00:27:47,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 00:27:47,383 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-23 00:27:47,383 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-23 00:27:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:27:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:27:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_fsync [2022-07-23 00:27:47,384 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_fsync [2022-07-23 00:27:47,384 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2022-07-23 00:27:47,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2022-07-23 00:27:47,385 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-23 00:27:47,385 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-23 00:27:47,385 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-23 00:27:47,385 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-23 00:27:47,386 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-23 00:27:47,386 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-23 00:27:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_write_iter [2022-07-23 00:27:47,387 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_write_iter [2022-07-23 00:27:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:27:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:27:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:27:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-23 00:27:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-23 00:27:47,627 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:27:47,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:27:47,805 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:27:48,347 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:27:48,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:27:48,356 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:27:48,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:27:48 BoogieIcfgContainer [2022-07-23 00:27:48,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:27:48,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:27:48,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:27:48,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:27:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:27:46" (1/3) ... [2022-07-23 00:27:48,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2c39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:27:48, skipping insertion in model container [2022-07-23 00:27:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:27:47" (2/3) ... [2022-07-23 00:27:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2c39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:27:48, skipping insertion in model container [2022-07-23 00:27:48,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:27:48" (3/3) ... [2022-07-23 00:27:48,365 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-23 00:27:48,376 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:27:48,376 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:27:48,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:27:48,432 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@33be70d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e47ddd3 [2022-07-23 00:27:48,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:27:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-23 00:27:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-23 00:27:48,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:48,452 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:27:48,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -837597320, now seen corresponding path program 1 times [2022-07-23 00:27:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:48,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713040196] [2022-07-23 00:27:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 00:27:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 00:27:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 00:27:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-23 00:27:49,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713040196] [2022-07-23 00:27:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713040196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:49,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:49,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:27:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757540763] [2022-07-23 00:27:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:49,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:27:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:49,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:27:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:27:49,281 INFO L87 Difference]: Start difference. First operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 00:27:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:50,292 INFO L93 Difference]: Finished difference Result 1122 states and 1580 transitions. [2022-07-23 00:27:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:27:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2022-07-23 00:27:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:50,313 INFO L225 Difference]: With dead ends: 1122 [2022-07-23 00:27:50,316 INFO L226 Difference]: Without dead ends: 726 [2022-07-23 00:27:50,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:27:50,323 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 879 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:50,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1535 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 00:27:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-23 00:27:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 661. [2022-07-23 00:27:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3394683026584866) internal successors, (655), 493 states have internal predecessors, (655), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-23 00:27:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 897 transitions. [2022-07-23 00:27:50,392 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 897 transitions. Word has length 178 [2022-07-23 00:27:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:50,393 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 897 transitions. [2022-07-23 00:27:50,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 00:27:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 897 transitions. [2022-07-23 00:27:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-23 00:27:50,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:50,397 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:27:50,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:27:50,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash 210178479, now seen corresponding path program 1 times [2022-07-23 00:27:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:50,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027958082] [2022-07-23 00:27:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-23 00:27:50,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:50,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027958082] [2022-07-23 00:27:50,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027958082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:50,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:50,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:27:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257377325] [2022-07-23 00:27:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:50,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:27:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:27:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:27:50,884 INFO L87 Difference]: Start difference. First operand 661 states and 897 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-23 00:27:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:51,531 INFO L93 Difference]: Finished difference Result 1368 states and 1876 transitions. [2022-07-23 00:27:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:27:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 177 [2022-07-23 00:27:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:51,535 INFO L225 Difference]: With dead ends: 1368 [2022-07-23 00:27:51,535 INFO L226 Difference]: Without dead ends: 757 [2022-07-23 00:27:51,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:27:51,538 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 724 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:51,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1291 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 00:27:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-23 00:27:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 661. [2022-07-23 00:27:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3374233128834356) internal successors, (654), 493 states have internal predecessors, (654), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-23 00:27:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 896 transitions. [2022-07-23 00:27:51,609 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 896 transitions. Word has length 177 [2022-07-23 00:27:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:51,610 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 896 transitions. [2022-07-23 00:27:51,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-23 00:27:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 896 transitions. [2022-07-23 00:27:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-23 00:27:51,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:51,613 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:27:51,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:27:51,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1478765263, now seen corresponding path program 1 times [2022-07-23 00:27:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184828699] [2022-07-23 00:27:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-23 00:27:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184828699] [2022-07-23 00:27:51,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184828699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:51,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:51,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:27:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510123387] [2022-07-23 00:27:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:27:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:27:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:27:51,861 INFO L87 Difference]: Start difference. First operand 661 states and 896 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:27:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:52,838 INFO L93 Difference]: Finished difference Result 2068 states and 2847 transitions. [2022-07-23 00:27:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:27:52,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 177 [2022-07-23 00:27:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:52,866 INFO L225 Difference]: With dead ends: 2068 [2022-07-23 00:27:52,866 INFO L226 Difference]: Without dead ends: 1441 [2022-07-23 00:27:52,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:27:52,877 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 1029 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:52,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1472 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 00:27:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-07-23 00:27:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1253. [2022-07-23 00:27:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 936 states have (on average 1.3461538461538463) internal successors, (1260), 945 states have internal predecessors, (1260), 221 states have call successors, (221), 94 states have call predecessors, (221), 95 states have return successors, (227), 219 states have call predecessors, (227), 219 states have call successors, (227) [2022-07-23 00:27:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1708 transitions. [2022-07-23 00:27:52,938 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1708 transitions. Word has length 177 [2022-07-23 00:27:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:52,939 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1708 transitions. [2022-07-23 00:27:52,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:27:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1708 transitions. [2022-07-23 00:27:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-23 00:27:52,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:52,942 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:27:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:27:52,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1465783967, now seen corresponding path program 1 times [2022-07-23 00:27:52,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681605083] [2022-07-23 00:27:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 00:27:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:27:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 00:27:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-23 00:27:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681605083] [2022-07-23 00:27:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681605083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:53,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:53,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:27:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157517931] [2022-07-23 00:27:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:27:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:27:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:27:53,145 INFO L87 Difference]: Start difference. First operand 1253 states and 1708 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 00:27:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:53,850 INFO L93 Difference]: Finished difference Result 3258 states and 4422 transitions. [2022-07-23 00:27:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:27:53,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 200 [2022-07-23 00:27:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:53,860 INFO L225 Difference]: With dead ends: 3258 [2022-07-23 00:27:53,860 INFO L226 Difference]: Without dead ends: 2055 [2022-07-23 00:27:53,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:27:53,863 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 664 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:53,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 00:27:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-07-23 00:27:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1833. [2022-07-23 00:27:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1376 states have (on average 1.340843023255814) internal successors, (1845), 1388 states have internal predecessors, (1845), 310 states have call successors, (310), 145 states have call predecessors, (310), 146 states have return successors, (316), 307 states have call predecessors, (316), 308 states have call successors, (316) [2022-07-23 00:27:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2471 transitions. [2022-07-23 00:27:53,930 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2471 transitions. Word has length 200 [2022-07-23 00:27:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:53,931 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2471 transitions. [2022-07-23 00:27:53,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 00:27:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2471 transitions. [2022-07-23 00:27:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-23 00:27:53,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:53,935 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-23 00:27:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:27:53,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1995507625, now seen corresponding path program 1 times [2022-07-23 00:27:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:53,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903018838] [2022-07-23 00:27:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 00:27:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 00:27:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:27:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 00:27:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:27:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-23 00:27:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-23 00:27:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903018838] [2022-07-23 00:27:54,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903018838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:54,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:54,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:27:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692801960] [2022-07-23 00:27:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:54,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:27:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:27:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:27:54,205 INFO L87 Difference]: Start difference. First operand 1833 states and 2471 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 00:27:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:54,867 INFO L93 Difference]: Finished difference Result 3196 states and 4288 transitions. [2022-07-23 00:27:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:27:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 267 [2022-07-23 00:27:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:54,876 INFO L225 Difference]: With dead ends: 3196 [2022-07-23 00:27:54,876 INFO L226 Difference]: Without dead ends: 1411 [2022-07-23 00:27:54,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:27:54,881 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 325 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:54,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1445 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 00:27:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-23 00:27:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1215. [2022-07-23 00:27:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 898 states have (on average 1.3140311804008908) internal successors, (1180), 907 states have internal predecessors, (1180), 211 states have call successors, (211), 105 states have call predecessors, (211), 105 states have return successors, (213), 208 states have call predecessors, (213), 209 states have call successors, (213) [2022-07-23 00:27:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1604 transitions. [2022-07-23 00:27:54,948 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1604 transitions. Word has length 267 [2022-07-23 00:27:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:54,948 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1604 transitions. [2022-07-23 00:27:54,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 00:27:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1604 transitions. [2022-07-23 00:27:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-23 00:27:54,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:54,951 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-23 00:27:54,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:27:54,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1551606951, now seen corresponding path program 1 times [2022-07-23 00:27:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:54,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316198042] [2022-07-23 00:27:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 00:27:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 00:27:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:27:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 00:27:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:27:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-23 00:27:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-23 00:27:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:55,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316198042] [2022-07-23 00:27:55,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316198042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:55,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:55,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:27:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812809026] [2022-07-23 00:27:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:55,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:27:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:27:55,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:27:55,242 INFO L87 Difference]: Start difference. First operand 1215 states and 1604 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-23 00:27:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:56,059 INFO L93 Difference]: Finished difference Result 2898 states and 3833 transitions. [2022-07-23 00:27:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:27:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 267 [2022-07-23 00:27:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:56,067 INFO L225 Difference]: With dead ends: 2898 [2022-07-23 00:27:56,067 INFO L226 Difference]: Without dead ends: 1848 [2022-07-23 00:27:56,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:27:56,071 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 667 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:56,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1904 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 00:27:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-07-23 00:27:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1575. [2022-07-23 00:27:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1174 states have (on average 1.3160136286201023) internal successors, (1545), 1183 states have internal predecessors, (1545), 263 states have call successors, (263), 137 states have call predecessors, (263), 137 states have return successors, (265), 260 states have call predecessors, (265), 261 states have call successors, (265) [2022-07-23 00:27:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2073 transitions. [2022-07-23 00:27:56,134 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2073 transitions. Word has length 267 [2022-07-23 00:27:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:56,135 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2073 transitions. [2022-07-23 00:27:56,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-23 00:27:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2073 transitions. [2022-07-23 00:27:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-23 00:27:56,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:56,141 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:27:56,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:27:56,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash -350932392, now seen corresponding path program 1 times [2022-07-23 00:27:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:56,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526094910] [2022-07-23 00:27:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 00:27:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 00:27:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:27:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-23 00:27:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 00:27:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:27:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-23 00:27:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-07-23 00:27:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526094910] [2022-07-23 00:27:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526094910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 00:27:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109637132] [2022-07-23 00:27:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:56,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 00:27:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 00:27:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:27:56,611 INFO L87 Difference]: Start difference. First operand 1575 states and 2073 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 00:27:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:58,255 INFO L93 Difference]: Finished difference Result 4803 states and 6330 transitions. [2022-07-23 00:27:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 00:27:58,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 286 [2022-07-23 00:27:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:58,269 INFO L225 Difference]: With dead ends: 4803 [2022-07-23 00:27:58,270 INFO L226 Difference]: Without dead ends: 3393 [2022-07-23 00:27:58,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-23 00:27:58,273 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 823 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:58,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3980 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-23 00:27:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-23 00:27:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2675. [2022-07-23 00:27:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2007 states have (on average 1.3248629795714997) internal successors, (2659), 2026 states have internal predecessors, (2659), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-23 00:27:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3541 transitions. [2022-07-23 00:27:58,390 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3541 transitions. Word has length 286 [2022-07-23 00:27:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:58,391 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3541 transitions. [2022-07-23 00:27:58,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-23 00:27:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3541 transitions. [2022-07-23 00:27:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-23 00:27:58,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:58,397 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:27:58,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 00:27:58,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash 311520253, now seen corresponding path program 1 times [2022-07-23 00:27:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:58,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738198823] [2022-07-23 00:27:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:58,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:27:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:27:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:27:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:27:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:27:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:27:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:27:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:27:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:27:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:27:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:27:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:27:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:27:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:27:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 00:27:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:27:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-23 00:27:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 00:27:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-23 00:27:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:27:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-23 00:27:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2022-07-23 00:27:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:27:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738198823] [2022-07-23 00:27:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738198823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:27:58,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:27:58,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 00:27:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160255726] [2022-07-23 00:27:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:27:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 00:27:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 00:27:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:27:58,876 INFO L87 Difference]: Start difference. First operand 2675 states and 3541 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-23 00:27:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:27:59,596 INFO L93 Difference]: Finished difference Result 5643 states and 7511 transitions. [2022-07-23 00:27:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:27:59,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 306 [2022-07-23 00:27:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:27:59,611 INFO L225 Difference]: With dead ends: 5643 [2022-07-23 00:27:59,611 INFO L226 Difference]: Without dead ends: 3133 [2022-07-23 00:27:59,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:27:59,618 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 467 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:27:59,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1646 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 00:27:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-07-23 00:27:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2703. [2022-07-23 00:27:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2035 states have (on average 1.3282555282555282) internal successors, (2703), 2054 states have internal predecessors, (2703), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-23 00:27:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3585 transitions. [2022-07-23 00:27:59,722 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3585 transitions. Word has length 306 [2022-07-23 00:27:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:27:59,723 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 3585 transitions. [2022-07-23 00:27:59,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-23 00:27:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3585 transitions. [2022-07-23 00:27:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-23 00:27:59,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:27:59,728 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:27:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 00:27:59,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:27:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:27:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1101263580, now seen corresponding path program 1 times [2022-07-23 00:27:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:27:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850366976] [2022-07-23 00:27:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:27:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:27:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:27:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:27:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:27:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:27:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:27:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:27:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:27:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:27:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:28:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:28:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:28:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:28:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:28:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:28:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:28:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:28:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:28:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:28:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:28:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:28:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:28:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:28:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 00:28:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:28:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-23 00:28:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 00:28:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-23 00:28:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:28:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-23 00:28:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-07-23 00:28:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:00,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850366976] [2022-07-23 00:28:00,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850366976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:00,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598100599] [2022-07-23 00:28:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:00,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:00,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:00,211 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-23 00:28:00,226 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-23 00:28:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:00,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 2457 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 00:28:00,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-23 00:28:00,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:28:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598100599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:28:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:28:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-23 00:28:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692470433] [2022-07-23 00:28:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:28:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:28:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:28:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:28:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:28:00,782 INFO L87 Difference]: Start difference. First operand 2703 states and 3585 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 00:28:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:00,888 INFO L93 Difference]: Finished difference Result 4225 states and 5561 transitions. [2022-07-23 00:28:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:28:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 305 [2022-07-23 00:28:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:00,896 INFO L225 Difference]: With dead ends: 4225 [2022-07-23 00:28:00,897 INFO L226 Difference]: Without dead ends: 1646 [2022-07-23 00:28:00,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-23 00:28:00,903 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 20 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:00,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2015 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:28:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-07-23 00:28:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1547. [2022-07-23 00:28:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1152 states have (on average 1.3159722222222223) internal successors, (1516), 1164 states have internal predecessors, (1516), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-23 00:28:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2022-07-23 00:28:00,964 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 305 [2022-07-23 00:28:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:00,965 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2022-07-23 00:28:00,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-23 00:28:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2022-07-23 00:28:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-23 00:28:00,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:00,969 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:28:00,993 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-23 00:28:01,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:01,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -191141444, now seen corresponding path program 1 times [2022-07-23 00:28:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:01,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104080293] [2022-07-23 00:28:01,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:28:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:28:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:28:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:28:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:28:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 00:28:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:28:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:28:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 00:28:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 00:28:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:28:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:28:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:28:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:28:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:28:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:28:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:28:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:28:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:28:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 00:28:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 00:28:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-23 00:28:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-23 00:28:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-23 00:28:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-23 00:28:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:28:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-23 00:28:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2022-07-23 00:28:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:01,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104080293] [2022-07-23 00:28:01,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104080293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:01,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066099238] [2022-07-23 00:28:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:01,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:01,609 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-23 00:28:01,611 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-23 00:28:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 00:28:02,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-07-23 00:28:02,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:28:02,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066099238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:28:02,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:28:02,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-23 00:28:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436078915] [2022-07-23 00:28:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:28:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:28:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:28:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:28:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:28:02,289 INFO L87 Difference]: Start difference. First operand 1547 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 00:28:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:02,365 INFO L93 Difference]: Finished difference Result 3072 states and 4060 transitions. [2022-07-23 00:28:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:28:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 317 [2022-07-23 00:28:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:02,370 INFO L225 Difference]: With dead ends: 3072 [2022-07-23 00:28:02,371 INFO L226 Difference]: Without dead ends: 1548 [2022-07-23 00:28:02,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:28:02,374 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 3 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:02,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:28:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-23 00:28:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2022-07-23 00:28:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1153 states have (on average 1.3156981786643538) internal successors, (1517), 1165 states have internal predecessors, (1517), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-23 00:28:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2038 transitions. [2022-07-23 00:28:02,448 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2038 transitions. Word has length 317 [2022-07-23 00:28:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:02,448 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2038 transitions. [2022-07-23 00:28:02,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 00:28:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2038 transitions. [2022-07-23 00:28:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-23 00:28:02,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:02,452 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:28:02,474 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-23 00:28:02,672 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,SelfDestructingSolverStorable9 [2022-07-23 00:28:02,673 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 931062163, now seen corresponding path program 1 times [2022-07-23 00:28:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:02,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038690716] [2022-07-23 00:28:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:28:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:28:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:28:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:28:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:28:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:28:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:28:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 00:28:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 00:28:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-23 00:28:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:28:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:28:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 00:28:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 00:28:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 00:28:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:28:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 00:28:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:28:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:28:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-23 00:28:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 00:28:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-23 00:28:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-23 00:28:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-23 00:28:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-23 00:28:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:28:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-23 00:28:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2022-07-23 00:28:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:03,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038690716] [2022-07-23 00:28:03,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038690716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:03,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020452114] [2022-07-23 00:28:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:03,116 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-23 00:28:03,131 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-23 00:28:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:03,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 319 conjunts are in the unsatisfiable core [2022-07-23 00:28:03,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:04,017 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-23 00:28:04,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 262 treesize of output 244 [2022-07-23 00:28:06,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 00:28:06,811 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 7 treesize of output 3 [2022-07-23 00:28:06,853 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2251 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2251) |c_#memory_int|))) is different from true [2022-07-23 00:28:06,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 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-23 00:28:07,284 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 7 treesize of output 3 [2022-07-23 00:28:07,298 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2252 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2252) |c_#memory_int|))) is different from true [2022-07-23 00:28:07,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 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-23 00:28:07,582 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 7 treesize of output 3 [2022-07-23 00:28:07,593 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2253 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2253) |c_#memory_int|))) is different from true [2022-07-23 00:28:07,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-23 00:28:07,802 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 7 treesize of output 3 [2022-07-23 00:28:07,815 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2254 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2254)))) is different from true [2022-07-23 00:28:07,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, 11 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-23 00:28:08,001 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 7 treesize of output 3 [2022-07-23 00:28:22,519 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 00:28:22,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 00:28:23,826 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 7 treesize of output 3 [2022-07-23 00:28:23,839 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2257 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2257) |c_#memory_int|))) is different from true [2022-07-23 00:28:23,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-23 00:28:26,016 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 7 treesize of output 3 [2022-07-23 00:28:26,079 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 00:28:26,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 00:28:28,199 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 7 treesize of output 3 [2022-07-23 00:28:28,214 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2260 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2260)))) is different from true [2022-07-23 00:28:28,244 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 14 treesize of output 16 [2022-07-23 00:28:29,203 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 7 treesize of output 3 [2022-07-23 00:28:29,214 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2261 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2261) |c_#memory_int|))) is different from true [2022-07-23 00:28:29,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-23 00:28:30,711 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 7 treesize of output 3 [2022-07-23 00:28:30,723 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2262 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2262) |c_#memory_int|))) is different from true [2022-07-23 00:28:30,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 00:28:31,706 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 7 treesize of output 3 [2022-07-23 00:28:31,717 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2263 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2263) |c_#memory_int|))) is different from true [2022-07-23 00:28:31,732 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-23 00:28:35,899 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 7 treesize of output 3 [2022-07-23 00:28:36,602 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2264) |c_#memory_int|))) is different from true [2022-07-23 00:28:36,614 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| v_ArrVal_2264)) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| |c_#StackHeapBarrier|)))) is different from true [2022-07-23 00:28:36,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:28:36,647 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-23 00:28:36,660 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 7 treesize of output 3 [2022-07-23 00:28:36,672 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2265 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2265) |c_#memory_int|))) is different from true [2022-07-23 00:28:38,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:39,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:28:39,183 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-23 00:28:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:28:39,548 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-23 00:28:39,601 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 7 treesize of output 3 [2022-07-23 00:28:39,643 WARN L855 $PredicateComparison]: unable to prove that (exists ((|raw_open_~filp#1.base| Int)) (and (<= |raw_open_~filp#1.base| |c_raw_open_#in~filp#1.base|) (exists ((v_ArrVal_2267 (Array Int Int))) (= (store |c_old(#memory_int)| |raw_open_~filp#1.base| v_ArrVal_2267) |c_#memory_int|)))) is different from true [2022-07-23 00:28:39,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:28:39,655 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-23 00:28:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 87 proven. 101 refuted. 10 times theorem prover too weak. 223 trivial. 403 not checked. [2022-07-23 00:28:39,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:28:39,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2270 (Array Int Int)) (|v_raw_open_~filp#1.base_10| Int)) (or (< c_~raw_ctl_fops_group2~0.base |v_raw_open_~filp#1.base_10|) (not (= (select (select (store |c_#memory_int| |v_raw_open_~filp#1.base_10| v_ArrVal_2270) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032)))) is different from false [2022-07-23 00:28:39,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020452114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:39,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:28:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 52] total 59 [2022-07-23 00:28:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040768407] [2022-07-23 00:28:39,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:28:39,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 00:28:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:28:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 00:28:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1894, Unknown=41, NotChecked=1442, Total=3660 [2022-07-23 00:28:39,848 INFO L87 Difference]: Start difference. First operand 1548 states and 2038 transitions. Second operand has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-23 00:28:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:55,641 INFO L93 Difference]: Finished difference Result 3342 states and 4415 transitions. [2022-07-23 00:28:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 00:28:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) Word has length 331 [2022-07-23 00:28:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:55,650 INFO L225 Difference]: With dead ends: 3342 [2022-07-23 00:28:55,651 INFO L226 Difference]: Without dead ends: 1820 [2022-07-23 00:28:55,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 420 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=450, Invalid=3695, Unknown=71, NotChecked=1946, Total=6162 [2022-07-23 00:28:55,657 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 377 mSDsluCounter, 5840 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 11950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8947 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:55,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 6292 Invalid, 11950 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [243 Valid, 2760 Invalid, 0 Unknown, 8947 Unchecked, 1.8s Time] [2022-07-23 00:28:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-07-23 00:28:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1558. [2022-07-23 00:28:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1161 states have (on average 1.3152454780361758) internal successors, (1527), 1174 states have internal predecessors, (1527), 257 states have call successors, (257), 134 states have call predecessors, (257), 139 states have return successors, (271), 252 states have call predecessors, (271), 255 states have call successors, (271) [2022-07-23 00:28:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2055 transitions. [2022-07-23 00:28:55,742 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2055 transitions. Word has length 331 [2022-07-23 00:28:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:55,743 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 2055 transitions. [2022-07-23 00:28:55,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-23 00:28:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2055 transitions. [2022-07-23 00:28:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-07-23 00:28:55,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:55,749 INFO L195 NwaCegarLoop]: trace histogram [17, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:28:55,781 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-23 00:28:55,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:55,969 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1184488591, now seen corresponding path program 1 times [2022-07-23 00:28:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:55,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888056167] [2022-07-23 00:28:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:28:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:28:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:28:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:28:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:28:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 00:28:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 00:28:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 00:28:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 00:28:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:28:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:28:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 00:28:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 00:28:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:28:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 00:28:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:28:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 00:28:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:28:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:28:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-23 00:28:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 00:28:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-23 00:28:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 00:28:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-23 00:28:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-23 00:28:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:28:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-07-23 00:28:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2022-07-23 00:28:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888056167] [2022-07-23 00:28:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888056167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96680519] [2022-07-23 00:28:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:56,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:56,476 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-23 00:28:56,477 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-23 00:28:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:57,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 00:28:57,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 351 proven. 6 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-07-23 00:28:57,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:28:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 9 proven. 79 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2022-07-23 00:28:57,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96680519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:28:57,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:28:57,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 5] total 19 [2022-07-23 00:28:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269156181] [2022-07-23 00:28:57,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:28:57,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 00:28:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:28:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 00:28:57,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-07-23 00:28:57,960 INFO L87 Difference]: Start difference. First operand 1558 states and 2055 transitions. Second operand has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-23 00:28:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:59,345 INFO L93 Difference]: Finished difference Result 3344 states and 4429 transitions. [2022-07-23 00:28:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 00:28:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 334 [2022-07-23 00:28:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:59,352 INFO L225 Difference]: With dead ends: 3344 [2022-07-23 00:28:59,352 INFO L226 Difference]: Without dead ends: 1803 [2022-07-23 00:28:59,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 00:28:59,358 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 639 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:59,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 3237 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 00:28:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-23 00:28:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1559. [2022-07-23 00:28:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1163 states have (on average 1.3138435081685296) internal successors, (1528), 1175 states have internal predecessors, (1528), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-23 00:28:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2049 transitions. [2022-07-23 00:28:59,504 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2049 transitions. Word has length 334 [2022-07-23 00:28:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:59,504 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2049 transitions. [2022-07-23 00:28:59,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 14 states have internal predecessors, (188), 2 states have call successors, (85), 7 states have call predecessors, (85), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-23 00:28:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2049 transitions. [2022-07-23 00:28:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-23 00:28:59,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:59,526 INFO L195 NwaCegarLoop]: trace histogram [43, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:28:59,560 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-23 00:28:59,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:59,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 943002118, now seen corresponding path program 2 times [2022-07-23 00:28:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936661252] [2022-07-23 00:28:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:29:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:29:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:29:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:29:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:29:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-23 00:29:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:29:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 00:29:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 00:29:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 00:29:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 00:29:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 00:29:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 00:29:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 00:29:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 00:29:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-23 00:29:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-23 00:29:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:29:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:29:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-23 00:29:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-23 00:29:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-23 00:29:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-23 00:29:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-23 00:29:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-23 00:29:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:29:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-23 00:29:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2022-07-23 00:29:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:29:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936661252] [2022-07-23 00:29:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936661252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:29:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902326614] [2022-07-23 00:29:00,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:29:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:29:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:29:00,363 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-23 00:29:00,364 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-23 00:29:01,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 00:29:01,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:29:01,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 00:29:01,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:29:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 392 proven. 6 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2022-07-23 00:29:01,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:29:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2022-07-23 00:29:01,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902326614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:29:01,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:29:01,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2022-07-23 00:29:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672528839] [2022-07-23 00:29:01,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:29:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 00:29:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:29:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 00:29:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-23 00:29:01,665 INFO L87 Difference]: Start difference. First operand 1559 states and 2049 transitions. Second operand has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-23 00:29:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:29:02,929 INFO L93 Difference]: Finished difference Result 3341 states and 4411 transitions. [2022-07-23 00:29:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 00:29:02,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 362 [2022-07-23 00:29:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:29:02,954 INFO L225 Difference]: With dead ends: 3341 [2022-07-23 00:29:02,966 INFO L226 Difference]: Without dead ends: 1805 [2022-07-23 00:29:02,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 00:29:02,972 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 375 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 00:29:02,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2568 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 00:29:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-23 00:29:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1560. [2022-07-23 00:29:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1164 states have (on average 1.313573883161512) internal successors, (1529), 1176 states have internal predecessors, (1529), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-23 00:29:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2050 transitions. [2022-07-23 00:29:03,098 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2050 transitions. Word has length 362 [2022-07-23 00:29:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:29:03,111 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 2050 transitions. [2022-07-23 00:29:03,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 16 states have internal predecessors, (187), 2 states have call successors, (86), 7 states have call predecessors, (86), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-23 00:29:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2050 transitions. [2022-07-23 00:29:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-07-23 00:29:03,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:29:03,117 INFO L195 NwaCegarLoop]: trace histogram [48, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:29:03,157 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-23 00:29:03,338 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,SelfDestructingSolverStorable12 [2022-07-23 00:29:03,338 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:29:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:29:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -298770021, now seen corresponding path program 3 times [2022-07-23 00:29:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:29:03,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202693268] [2022-07-23 00:29:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:29:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:29:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:29:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:29:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:29:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:29:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 00:29:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:29:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 00:29:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:29:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 00:29:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 00:29:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:29:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:29:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 00:29:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 00:29:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-23 00:29:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-23 00:29:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:29:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:29:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-23 00:29:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-23 00:29:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 00:29:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-23 00:29:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-23 00:29:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-23 00:29:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:29:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-23 00:29:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 28 proven. 290 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2022-07-23 00:29:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:29:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202693268] [2022-07-23 00:29:04,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202693268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:29:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248199886] [2022-07-23 00:29:04,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 00:29:04,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:29:04,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:29:04,056 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-23 00:29:04,090 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-23 00:29:07,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-23 00:29:07,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:29:07,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 00:29:07,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:29:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 452 proven. 10 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2022-07-23 00:29:07,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:29:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 308 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2022-07-23 00:29:07,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248199886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:29:07,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:29:07,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2022-07-23 00:29:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238954192] [2022-07-23 00:29:07,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:29:07,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 00:29:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:29:07,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 00:29:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-07-23 00:29:07,585 INFO L87 Difference]: Start difference. First operand 1560 states and 2050 transitions. Second operand has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-23 00:29:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:29:09,211 INFO L93 Difference]: Finished difference Result 3342 states and 4418 transitions. [2022-07-23 00:29:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 00:29:09,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 367 [2022-07-23 00:29:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:29:09,225 INFO L225 Difference]: With dead ends: 3342 [2022-07-23 00:29:09,225 INFO L226 Difference]: Without dead ends: 1802 [2022-07-23 00:29:09,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2022-07-23 00:29:09,229 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 216 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:29:09,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 3506 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-23 00:29:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-07-23 00:29:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1564. [2022-07-23 00:29:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1168 states have (on average 1.3116438356164384) internal successors, (1532), 1180 states have internal predecessors, (1532), 257 states have call successors, (257), 134 states have call predecessors, (257), 138 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-23 00:29:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2053 transitions. [2022-07-23 00:29:09,345 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2053 transitions. Word has length 367 [2022-07-23 00:29:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:29:09,345 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 2053 transitions. [2022-07-23 00:29:09,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.125) internal successors, (195), 19 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2022-07-23 00:29:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2053 transitions. [2022-07-23 00:29:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-07-23 00:29:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:29:09,348 INFO L195 NwaCegarLoop]: trace histogram [76, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:29:09,375 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-23 00:29:09,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:29:09,561 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:29:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:29:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 750840027, now seen corresponding path program 4 times [2022-07-23 00:29:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:29:09,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916025591] [2022-07-23 00:29:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:29:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:29:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 00:29:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-23 00:29:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 00:29:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 00:29:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 00:29:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 00:29:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:29:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:29:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 00:29:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 00:29:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 00:29:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 00:29:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-23 00:29:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 00:29:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 00:29:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-23 00:29:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:29:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 00:29:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 00:29:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-23 00:29:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-23 00:29:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:29:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-23 00:29:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-23 00:29:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-07-23 00:29:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-07-23 00:29:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:29:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-23 00:29:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-23 00:29:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:29:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 451 proven. 879 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2022-07-23 00:29:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:29:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916025591] [2022-07-23 00:29:13,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916025591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:29:13,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722992409] [2022-07-23 00:29:13,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 00:29:13,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:29:13,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:29:13,724 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-23 00:29:13,799 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-23 00:29:14,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 00:29:14,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:29:14,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 432 conjunts are in the unsatisfiable core [2022-07-23 00:29:14,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:29:14,871 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-23 00:29:14,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 258 treesize of output 240 [2022-07-23 00:29:17,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 00:29:17,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:29:17,202 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 24 [2022-07-23 00:29:17,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:29:17,252 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 21 treesize of output 20 [2022-07-23 00:29:17,303 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 00:29:17,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 00:29:18,357 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 7 treesize of output 3 [2022-07-23 00:29:18,881 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6844 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6844)))) is different from true [2022-07-23 00:29:18,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 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-23 00:29:19,220 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 7 treesize of output 3 [2022-07-23 00:29:19,550 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6852 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6852) |c_#memory_int|))) is different from true [2022-07-23 00:29:19,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 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-23 00:29:19,920 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 7 treesize of output 3 [2022-07-23 00:29:20,241 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6860 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6860) |c_#memory_int|))) is different from true [2022-07-23 00:29:20,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-23 00:29:20,564 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 7 treesize of output 3 [2022-07-23 00:29:50,160 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 00:29:50,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2022-07-23 00:29:51,891 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 7 treesize of output 3 [2022-07-23 00:29:52,255 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6876 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6876) |c_#memory_int|))) is different from true [2022-07-23 00:29:52,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-23 00:29:53,774 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 7 treesize of output 3 [2022-07-23 00:29:53,928 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6880 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6880) |c_#memory_int|))) is different from true [2022-07-23 00:29:53,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-23 00:29:55,637 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 7 treesize of output 3 [2022-07-23 00:29:56,030 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6888 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6888)))) is different from true [2022-07-23 00:29:56,064 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 14 treesize of output 16 [2022-07-23 00:29:57,892 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 7 treesize of output 3 [2022-07-23 00:29:58,186 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6896 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6896) |c_#memory_int|))) is different from true [2022-07-23 00:29:58,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-23 00:30:00,029 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 7 treesize of output 3 [2022-07-23 00:30:35,019 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 00:30:35,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2022-07-23 00:30:36,827 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 7 treesize of output 3 [2022-07-23 00:30:36,966 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6908 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6908) |c_#memory_int|))) is different from true [2022-07-23 00:30:36,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 00:30:38,466 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 7 treesize of output 3 [2022-07-23 00:30:38,771 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6916 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6916) |c_#memory_int|))) is different from true [2022-07-23 00:30:38,805 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-23 00:30:46,322 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 7 treesize of output 3 [2022-07-23 00:30:47,424 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6917 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_6917) |c_#memory_int|))) is different from true [2022-07-23 00:30:47,439 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| Int) (v_ArrVal_6917 (Array Int Int))) (and (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| v_ArrVal_6917) |c_#memory_int|) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_41| |c_#StackHeapBarrier|)))) is different from true [2022-07-23 00:30:47,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:30:47,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:30:47,503 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-23 00:30:47,517 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 7 treesize of output 3 [2022-07-23 00:30:47,530 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6918 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_6918)))) is different from true [2022-07-23 00:30:50,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:30:52,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:30:52,089 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-23 00:30:52,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:30:52,779 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-23 00:30:52,994 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 7 treesize of output 3 [2022-07-23 00:30:53,008 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6920 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_raw_open_#in~filp#1.base| v_ArrVal_6920))) is different from true [2022-07-23 00:30:53,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:30:53,016 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-23 00:30:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 249 proven. 1107 refuted. 333 times theorem prover too weak. 1708 trivial. 979 not checked. [2022-07-23 00:30:53,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:30:53,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6923 (Array Int Int))) (not (= (select (select (store |c_#memory_int| c_~raw_ctl_fops_group2~0.base v_ArrVal_6923) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032))) is different from false [2022-07-23 00:30:53,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722992409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:30:53,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:30:53,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 66] total 110 [2022-07-23 00:30:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206537110] [2022-07-23 00:30:53,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:30:53,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-23 00:30:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:30:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-23 00:30:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=9226, Unknown=87, NotChecked=2954, Total=13110 [2022-07-23 00:30:53,392 INFO L87 Difference]: Start difference. First operand 1564 states and 2053 transitions. Second operand has 110 states, 108 states have (on average 3.0) internal successors, (324), 98 states have internal predecessors, (324), 42 states have call successors, (75), 12 states have call predecessors, (75), 30 states have return successors, (73), 45 states have call predecessors, (73), 42 states have call successors, (73) [2022-07-23 00:31:18,344 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_6916 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6916) |c_#memory_int|)) (exists ((v_ArrVal_6876 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6876) |c_#memory_int|)) (exists ((v_ArrVal_6888 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6888))) (exists ((v_ArrVal_6860 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6860) |c_#memory_int|)) (exists ((v_ArrVal_6844 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6844))) (exists ((v_ArrVal_6896 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6896) |c_#memory_int|)) (exists ((v_ArrVal_6852 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6852) |c_#memory_int|)) (exists ((v_ArrVal_6880 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6880) |c_#memory_int|)) (exists ((v_ArrVal_6903 Int) (v_ArrVal_6902 Int) (v_ArrVal_6899 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| (store (store (store (store (select |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base|) |c_ldv_memset_#in~s#1.offset| |c_ldv_memset_#in~c#1|) (+ |c_ldv_memset_#in~s#1.offset| 1) v_ArrVal_6899) (+ |c_ldv_memset_#in~s#1.offset| 2) v_ArrVal_6902) (+ |c_ldv_memset_#in~s#1.offset| 3) v_ArrVal_6903)))) (exists ((v_ArrVal_6908 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_6908) |c_#memory_int|))) is different from true