./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:42:11,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:42:11,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:42:11,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:42:11,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:42:11,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:42:11,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:42:11,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:42:11,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:42:11,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:42:11,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:42:11,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:42:11,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:42:11,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:42:11,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:42:11,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:42:11,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:42:11,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:42:11,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:42:11,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:42:11,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:42:11,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:42:11,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:42:11,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:42:11,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:42:11,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:42:11,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:42:11,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:42:11,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:42:11,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:42:11,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:42:11,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:42:11,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:42:11,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:42:11,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:42:11,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:42:11,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:42:11,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:42:11,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:42:11,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:42:11,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:42:11,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:42:11,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:42:11,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:42:11,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:42:11,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:42:11,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:42:11,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:42:11,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:42:11,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:42:11,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:42:11,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:42:11,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:42:11,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:42:11,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:42:11,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:42:11,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:42:11,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:42:11,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:42:11,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:42:11,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:42:11,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:42:11,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:42:11,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:42:11,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:42:11,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:42:11,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:42:11,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:42:11,195 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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-07-21 11:42:11,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:42:11,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:42:11,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:42:11,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:42:11,460 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:42:11,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:11,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c4f1406/92bd35f38e024a2284fb4f7dd0e97881/FLAGb54c88f3e [2022-07-21 11:42:11,980 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:42:11,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:12,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c4f1406/92bd35f38e024a2284fb4f7dd0e97881/FLAGb54c88f3e [2022-07-21 11:42:12,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c4f1406/92bd35f38e024a2284fb4f7dd0e97881 [2022-07-21 11:42:12,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:42:12,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:42:12,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:42:12,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:42:12,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:42:12,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523fba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12, skipping insertion in model container [2022-07-21 11:42:12,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:42:12,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:42:12,603 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-21 11:42:12,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:42:12,661 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:42:12,770 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-21 11:42:12,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:42:12,808 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:42:12,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12 WrapperNode [2022-07-21 11:42:12,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:42:12,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:42:12,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:42:12,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:42:12,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,896 INFO L137 Inliner]: procedures = 107, calls = 312, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 771 [2022-07-21 11:42:12,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:42:12,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:42:12,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:42:12,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:42:12,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:42:12,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:42:12,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:42:12,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:42:12,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (1/1) ... [2022-07-21 11:42:12,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:42:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:13,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 11:42:13,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 11:42:13,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:42:13,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:42:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:42:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 11:42:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 11:42:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:42:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:42:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:42:13,055 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:42:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-21 11:42:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-21 11:42:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:42:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:42:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:42:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:42:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:42:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-21 11:42:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-21 11:42:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 11:42:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 11:42:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:42:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:42:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:42:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:42:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 11:42:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 11:42:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:42:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-21 11:42:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-21 11:42:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-21 11:42:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-21 11:42:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-21 11:42:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-21 11:42:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:42:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:42:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:42:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 11:42:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 11:42:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 11:42:13,059 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 11:42:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:42:13,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:42:13,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:42:13,290 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:42:13,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:42:13,386 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:42:13,908 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:42:13,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:42:13,915 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:42:13,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:42:13 BoogieIcfgContainer [2022-07-21 11:42:13,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:42:13,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:42:13,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:42:13,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:42:13,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:42:12" (1/3) ... [2022-07-21 11:42:13,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a232bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:42:13, skipping insertion in model container [2022-07-21 11:42:13,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:12" (2/3) ... [2022-07-21 11:42:13,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a232bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:42:13, skipping insertion in model container [2022-07-21 11:42:13,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:42:13" (3/3) ... [2022-07-21 11:42:13,923 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:13,933 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:42:13,933 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:42:13,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:42:13,982 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@49bd2da1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c9c8713 [2022-07-21 11:42:13,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:42:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-21 11:42:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 11:42:13,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:13,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:13,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564762, now seen corresponding path program 1 times [2022-07-21 11:42:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:14,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832849801] [2022-07-21 11:42:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:14,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 11:42:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:14,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832849801] [2022-07-21 11:42:14,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832849801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:14,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:14,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:42:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055915851] [2022-07-21 11:42:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:14,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:42:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:42:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:42:14,345 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:42:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:14,636 INFO L93 Difference]: Finished difference Result 472 states and 644 transitions. [2022-07-21 11:42:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:42:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-21 11:42:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:14,650 INFO L225 Difference]: With dead ends: 472 [2022-07-21 11:42:14,651 INFO L226 Difference]: Without dead ends: 231 [2022-07-21 11:42:14,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:42:14,663 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:14,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 464 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-21 11:42:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-07-21 11:42:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 176 states have internal predecessors, (218), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-21 11:42:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2022-07-21 11:42:14,714 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 32 [2022-07-21 11:42:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:14,715 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2022-07-21 11:42:14,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:42:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2022-07-21 11:42:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 11:42:14,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:14,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:14,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:42:14,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -660862936, now seen corresponding path program 1 times [2022-07-21 11:42:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218460904] [2022-07-21 11:42:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 11:42:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218460904] [2022-07-21 11:42:14,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218460904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:14,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:14,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753038099] [2022-07-21 11:42:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:14,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:14,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:14,838 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:42:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:15,277 INFO L93 Difference]: Finished difference Result 650 states and 851 transitions. [2022-07-21 11:42:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:42:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-21 11:42:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:15,280 INFO L225 Difference]: With dead ends: 650 [2022-07-21 11:42:15,280 INFO L226 Difference]: Without dead ends: 431 [2022-07-21 11:42:15,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:15,282 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 306 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:15,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 831 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 11:42:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-21 11:42:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2022-07-21 11:42:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 317 states have (on average 1.274447949526814) internal successors, (404), 325 states have internal predecessors, (404), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-21 11:42:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 541 transitions. [2022-07-21 11:42:15,330 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 541 transitions. Word has length 32 [2022-07-21 11:42:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:15,330 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 541 transitions. [2022-07-21 11:42:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 11:42:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 541 transitions. [2022-07-21 11:42:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 11:42:15,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:15,332 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:42:15,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 748866141, now seen corresponding path program 1 times [2022-07-21 11:42:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:15,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219786426] [2022-07-21 11:42:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219786426] [2022-07-21 11:42:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219786426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:15,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:15,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:42:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824611267] [2022-07-21 11:42:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:15,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:42:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:42:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:15,414 INFO L87 Difference]: Start difference. First operand 417 states and 541 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 11:42:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:15,910 INFO L93 Difference]: Finished difference Result 990 states and 1323 transitions. [2022-07-21 11:42:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:42:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-21 11:42:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:15,914 INFO L225 Difference]: With dead ends: 990 [2022-07-21 11:42:15,914 INFO L226 Difference]: Without dead ends: 588 [2022-07-21 11:42:15,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:42:15,916 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 622 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:15,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1539 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 11:42:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-21 11:42:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 420. [2022-07-21 11:42:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 320 states have (on average 1.26875) internal successors, (406), 328 states have internal predecessors, (406), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-21 11:42:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 543 transitions. [2022-07-21 11:42:15,938 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 543 transitions. Word has length 55 [2022-07-21 11:42:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:15,940 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 543 transitions. [2022-07-21 11:42:15,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 11:42:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 543 transitions. [2022-07-21 11:42:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 11:42:15,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:15,946 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:42:15,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1486182813, now seen corresponding path program 1 times [2022-07-21 11:42:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:15,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108189636] [2022-07-21 11:42:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:16,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108189636] [2022-07-21 11:42:16,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108189636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:16,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:16,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416588845] [2022-07-21 11:42:16,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:16,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:16,081 INFO L87 Difference]: Start difference. First operand 420 states and 543 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:16,414 INFO L93 Difference]: Finished difference Result 1257 states and 1644 transitions. [2022-07-21 11:42:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:42:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-07-21 11:42:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:16,435 INFO L225 Difference]: With dead ends: 1257 [2022-07-21 11:42:16,435 INFO L226 Difference]: Without dead ends: 852 [2022-07-21 11:42:16,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:16,438 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 389 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:16,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 665 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:42:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-07-21 11:42:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2022-07-21 11:42:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 625 states have (on average 1.2656) internal successors, (791), 637 states have internal predecessors, (791), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1056 transitions. [2022-07-21 11:42:16,478 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1056 transitions. Word has length 55 [2022-07-21 11:42:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:16,478 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1056 transitions. [2022-07-21 11:42:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1056 transitions. [2022-07-21 11:42:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 11:42:16,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:16,480 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:16,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:42:16,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1172967990, now seen corresponding path program 1 times [2022-07-21 11:42:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408757729] [2022-07-21 11:42:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408757729] [2022-07-21 11:42:16,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408757729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:16,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:16,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478291456] [2022-07-21 11:42:16,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:16,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:16,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:16,556 INFO L87 Difference]: Start difference. First operand 814 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:16,760 INFO L93 Difference]: Finished difference Result 844 states and 1101 transitions. [2022-07-21 11:42:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-21 11:42:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:16,763 INFO L225 Difference]: With dead ends: 844 [2022-07-21 11:42:16,764 INFO L226 Difference]: Without dead ends: 841 [2022-07-21 11:42:16,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:16,765 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 310 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:16,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 437 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-21 11:42:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 813. [2022-07-21 11:42:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 625 states have (on average 1.264) internal successors, (790), 636 states have internal predecessors, (790), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1054 transitions. [2022-07-21 11:42:16,788 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1054 transitions. Word has length 56 [2022-07-21 11:42:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:16,790 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1054 transitions. [2022-07-21 11:42:16,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1054 transitions. [2022-07-21 11:42:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 11:42:16,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:16,794 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:16,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:42:16,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2002259392, now seen corresponding path program 1 times [2022-07-21 11:42:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:16,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016242] [2022-07-21 11:42:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:16,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016242] [2022-07-21 11:42:16,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:16,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:16,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963996297] [2022-07-21 11:42:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:16,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:16,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:16,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:16,893 INFO L87 Difference]: Start difference. First operand 813 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:17,079 INFO L93 Difference]: Finished difference Result 843 states and 1099 transitions. [2022-07-21 11:42:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-21 11:42:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:17,085 INFO L225 Difference]: With dead ends: 843 [2022-07-21 11:42:17,085 INFO L226 Difference]: Without dead ends: 840 [2022-07-21 11:42:17,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:17,086 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 270 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:17,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 591 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-21 11:42:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 812. [2022-07-21 11:42:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 625 states have (on average 1.2624) internal successors, (789), 635 states have internal predecessors, (789), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1052 transitions. [2022-07-21 11:42:17,133 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1052 transitions. Word has length 57 [2022-07-21 11:42:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:17,133 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1052 transitions. [2022-07-21 11:42:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1052 transitions. [2022-07-21 11:42:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 11:42:17,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:17,134 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:17,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:42:17,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1940484211, now seen corresponding path program 1 times [2022-07-21 11:42:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701224612] [2022-07-21 11:42:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701224612] [2022-07-21 11:42:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701224612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:17,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:17,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660906629] [2022-07-21 11:42:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:17,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:17,227 INFO L87 Difference]: Start difference. First operand 812 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:17,379 INFO L93 Difference]: Finished difference Result 842 states and 1097 transitions. [2022-07-21 11:42:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:17,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-21 11:42:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:17,382 INFO L225 Difference]: With dead ends: 842 [2022-07-21 11:42:17,382 INFO L226 Difference]: Without dead ends: 839 [2022-07-21 11:42:17,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:17,383 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 304 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:17,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 431 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-21 11:42:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 811. [2022-07-21 11:42:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 625 states have (on average 1.2608) internal successors, (788), 634 states have internal predecessors, (788), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1050 transitions. [2022-07-21 11:42:17,406 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1050 transitions. Word has length 58 [2022-07-21 11:42:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1050 transitions. [2022-07-21 11:42:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1050 transitions. [2022-07-21 11:42:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 11:42:17,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:17,407 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 11:42:17,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:42:17,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -25448733, now seen corresponding path program 1 times [2022-07-21 11:42:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:17,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55281287] [2022-07-21 11:42:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:42:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55281287] [2022-07-21 11:42:17,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55281287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:17,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:17,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022173563] [2022-07-21 11:42:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:17,489 INFO L87 Difference]: Start difference. First operand 811 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:17,651 INFO L93 Difference]: Finished difference Result 841 states and 1095 transitions. [2022-07-21 11:42:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-07-21 11:42:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:17,654 INFO L225 Difference]: With dead ends: 841 [2022-07-21 11:42:17,655 INFO L226 Difference]: Without dead ends: 829 [2022-07-21 11:42:17,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:17,655 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 301 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:17,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 430 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-21 11:42:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 801. [2022-07-21 11:42:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 616 states have (on average 1.2597402597402598) internal successors, (776), 624 states have internal predecessors, (776), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1037 transitions. [2022-07-21 11:42:17,679 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1037 transitions. Word has length 59 [2022-07-21 11:42:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:17,679 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1037 transitions. [2022-07-21 11:42:17,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:42:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1037 transitions. [2022-07-21 11:42:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 11:42:17,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:17,682 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:17,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:42:17,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1150661192, now seen corresponding path program 1 times [2022-07-21 11:42:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:17,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747118513] [2022-07-21 11:42:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:42:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:42:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 11:42:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 11:42:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:42:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:42:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 11:42:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:42:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:42:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:42:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 11:42:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747118513] [2022-07-21 11:42:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747118513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:17,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:42:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627129019] [2022-07-21 11:42:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:42:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:42:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:17,816 INFO L87 Difference]: Start difference. First operand 801 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:18,059 INFO L93 Difference]: Finished difference Result 1679 states and 2189 transitions. [2022-07-21 11:42:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:18,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-07-21 11:42:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:18,062 INFO L225 Difference]: With dead ends: 1679 [2022-07-21 11:42:18,063 INFO L226 Difference]: Without dead ends: 893 [2022-07-21 11:42:18,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:42:18,065 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 212 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:18,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 777 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-21 11:42:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 855. [2022-07-21 11:42:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 669 states have (on average 1.2705530642750373) internal successors, (850), 677 states have internal predecessors, (850), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1111 transitions. [2022-07-21 11:42:18,092 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1111 transitions. Word has length 160 [2022-07-21 11:42:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:18,093 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1111 transitions. [2022-07-21 11:42:18,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1111 transitions. [2022-07-21 11:42:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 11:42:18,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:18,095 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 11:42:18,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:42:18,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1334474301, now seen corresponding path program 1 times [2022-07-21 11:42:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:18,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669325934] [2022-07-21 11:42:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:42:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:42:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:42:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:42:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:42:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:42:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:42:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:42:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:42:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:42:18,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:18,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669325934] [2022-07-21 11:42:18,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669325934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:18,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:18,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:42:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470638836] [2022-07-21 11:42:18,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:18,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:42:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:42:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:18,237 INFO L87 Difference]: Start difference. First operand 855 states and 1111 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:18,575 INFO L93 Difference]: Finished difference Result 2293 states and 3074 transitions. [2022-07-21 11:42:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 169 [2022-07-21 11:42:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:18,580 INFO L225 Difference]: With dead ends: 2293 [2022-07-21 11:42:18,581 INFO L226 Difference]: Without dead ends: 1457 [2022-07-21 11:42:18,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:42:18,583 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 455 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:18,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1533 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:42:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-21 11:42:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 867. [2022-07-21 11:42:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 681 states have (on average 1.2657856093979443) internal successors, (862), 689 states have internal predecessors, (862), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-21 11:42:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2022-07-21 11:42:18,616 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 169 [2022-07-21 11:42:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:18,616 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2022-07-21 11:42:18,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2022-07-21 11:42:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 11:42:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:18,619 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 11:42:18,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1080620452, now seen corresponding path program 1 times [2022-07-21 11:42:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414395910] [2022-07-21 11:42:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 11:42:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:42:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 11:42:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 11:42:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:42:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:42:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:42:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:42:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414395910] [2022-07-21 11:42:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414395910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597237989] [2022-07-21 11:42:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:18,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:18,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 11:42:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:42:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:42:19,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:19,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597237989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:19,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:19,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-21 11:42:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556561743] [2022-07-21 11:42:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:19,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:19,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:19,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:19,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:42:19,167 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:19,311 INFO L93 Difference]: Finished difference Result 2809 states and 3672 transitions. [2022-07-21 11:42:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-21 11:42:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:19,318 INFO L225 Difference]: With dead ends: 2809 [2022-07-21 11:42:19,319 INFO L226 Difference]: Without dead ends: 1961 [2022-07-21 11:42:19,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:42:19,322 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 394 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1866 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:42:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2022-07-21 11:42:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 903. [2022-07-21 11:42:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 709 states have (on average 1.2552891396332864) internal successors, (890), 717 states have internal predecessors, (890), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-07-21 11:42:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1167 transitions. [2022-07-21 11:42:19,371 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1167 transitions. Word has length 171 [2022-07-21 11:42:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:19,371 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1167 transitions. [2022-07-21 11:42:19,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1167 transitions. [2022-07-21 11:42:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 11:42:19,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:19,374 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:19,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 11:42:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 11:42:19,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:19,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2091737702, now seen corresponding path program 1 times [2022-07-21 11:42:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:19,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283774249] [2022-07-21 11:42:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 11:42:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:42:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 11:42:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 11:42:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:42:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:42:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:42:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 11:42:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:19,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283774249] [2022-07-21 11:42:19,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283774249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:19,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425774260] [2022-07-21 11:42:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:19,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:19,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:19,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:19,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 11:42:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 11:42:20,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 11:42:20,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:20,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425774260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:20,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:20,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-21 11:42:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261707636] [2022-07-21 11:42:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:20,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:20,075 INFO L87 Difference]: Start difference. First operand 903 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:20,167 INFO L93 Difference]: Finished difference Result 1803 states and 2343 transitions. [2022-07-21 11:42:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:20,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-21 11:42:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:20,171 INFO L225 Difference]: With dead ends: 1803 [2022-07-21 11:42:20,171 INFO L226 Difference]: Without dead ends: 911 [2022-07-21 11:42:20,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:20,173 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:20,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:42:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-21 11:42:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2022-07-21 11:42:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2538569424964936) internal successors, (894), 725 states have internal predecessors, (894), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-07-21 11:42:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1183 transitions. [2022-07-21 11:42:20,271 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1183 transitions. Word has length 171 [2022-07-21 11:42:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:20,271 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1183 transitions. [2022-07-21 11:42:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1183 transitions. [2022-07-21 11:42:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 11:42:20,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:20,274 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:20,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 11:42:20,491 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,SelfDestructingSolverStorable11 [2022-07-21 11:42:20,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2083587314, now seen corresponding path program 1 times [2022-07-21 11:42:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:20,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503704465] [2022-07-21 11:42:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:42:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:42:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:42:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:42:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:42:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 11:42:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 11:42:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 11:42:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:20,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503704465] [2022-07-21 11:42:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503704465] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:20,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636991125] [2022-07-21 11:42:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:20,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:20,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 11:42:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 11:42:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-21 11:42:21,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:42:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 11:42:21,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636991125] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:42:21,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:42:21,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-07-21 11:42:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156231202] [2022-07-21 11:42:21,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:42:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 11:42:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 11:42:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-21 11:42:21,449 INFO L87 Difference]: Start difference. First operand 911 states and 1183 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-21 11:42:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:22,199 INFO L93 Difference]: Finished difference Result 2037 states and 2676 transitions. [2022-07-21 11:42:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 11:42:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 177 [2022-07-21 11:42:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:22,204 INFO L225 Difference]: With dead ends: 2037 [2022-07-21 11:42:22,204 INFO L226 Difference]: Without dead ends: 1145 [2022-07-21 11:42:22,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-21 11:42:22,206 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 141 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:22,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 3569 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:42:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-21 11:42:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-07-21 11:42:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 745 states have (on average 1.2429530201342283) internal successors, (926), 753 states have internal predecessors, (926), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (167), 149 states have call predecessors, (167), 141 states have call successors, (167) [2022-07-21 11:42:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1235 transitions. [2022-07-21 11:42:22,252 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1235 transitions. Word has length 177 [2022-07-21 11:42:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:22,252 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1235 transitions. [2022-07-21 11:42:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-21 11:42:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1235 transitions. [2022-07-21 11:42:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 11:42:22,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:22,254 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:22,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 11:42:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:22,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1620349506, now seen corresponding path program 2 times [2022-07-21 11:42:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848526958] [2022-07-21 11:42:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:42:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:42:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:42:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:42:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 11:42:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 11:42:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848526958] [2022-07-21 11:42:22,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848526958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953892748] [2022-07-21 11:42:22,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:42:22,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:22,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:22,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 11:42:22,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:42:22,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:42:22,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 11:42:23,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-21 11:42:23,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:23,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953892748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-21 11:42:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201261524] [2022-07-21 11:42:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:42:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:42:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:42:23,127 INFO L87 Difference]: Start difference. First operand 951 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:42:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:23,397 INFO L93 Difference]: Finished difference Result 2075 states and 2732 transitions. [2022-07-21 11:42:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:42:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 183 [2022-07-21 11:42:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:23,401 INFO L225 Difference]: With dead ends: 2075 [2022-07-21 11:42:23,401 INFO L226 Difference]: Without dead ends: 1143 [2022-07-21 11:42:23,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-21 11:42:23,404 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 725 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:23,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-21 11:42:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 945. [2022-07-21 11:42:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 741 states have (on average 1.2415654520917678) internal successors, (920), 749 states have internal predecessors, (920), 140 states have call successors, (140), 56 states have call predecessors, (140), 63 states have return successors, (165), 147 states have call predecessors, (165), 139 states have call successors, (165) [2022-07-21 11:42:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1225 transitions. [2022-07-21 11:42:23,463 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1225 transitions. Word has length 183 [2022-07-21 11:42:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:23,463 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1225 transitions. [2022-07-21 11:42:23,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:42:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1225 transitions. [2022-07-21 11:42:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-21 11:42:23,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:23,466 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:23,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 11:42:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:23,684 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:23,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1006053722, now seen corresponding path program 1 times [2022-07-21 11:42:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:23,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294371718] [2022-07-21 11:42:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:42:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:42:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:42:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:42:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 11:42:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 11:42:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-21 11:42:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294371718] [2022-07-21 11:42:23,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294371718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866854943] [2022-07-21 11:42:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:23,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:23,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 11:42:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:24,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:42:24,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:42:24,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:24,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866854943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:24,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:24,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 11:42:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897760243] [2022-07-21 11:42:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:24,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:42:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:42:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:24,424 INFO L87 Difference]: Start difference. First operand 945 states and 1225 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 11:42:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:24,720 INFO L93 Difference]: Finished difference Result 2799 states and 3638 transitions. [2022-07-21 11:42:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:42:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 202 [2022-07-21 11:42:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:24,728 INFO L225 Difference]: With dead ends: 2799 [2022-07-21 11:42:24,739 INFO L226 Difference]: Without dead ends: 2791 [2022-07-21 11:42:24,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:24,741 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 400 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:24,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1042 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-07-21 11:42:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-07-21 11:42:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2181 states have (on average 1.245300320953691) internal successors, (2716), 2209 states have internal predecessors, (2716), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 431 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-21 11:42:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3617 transitions. [2022-07-21 11:42:24,888 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3617 transitions. Word has length 202 [2022-07-21 11:42:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:24,888 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3617 transitions. [2022-07-21 11:42:24,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 11:42:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3617 transitions. [2022-07-21 11:42:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-21 11:42:24,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:24,892 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:42:24,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 11:42:25,112 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,SelfDestructingSolverStorable14 [2022-07-21 11:42:25,112 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2017170972, now seen corresponding path program 1 times [2022-07-21 11:42:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:25,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179259424] [2022-07-21 11:42:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:42:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:42:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:42:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:42:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 11:42:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 11:42:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-21 11:42:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179259424] [2022-07-21 11:42:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179259424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:25,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:42:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863927136] [2022-07-21 11:42:25,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:25,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:42:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:42:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:42:25,276 INFO L87 Difference]: Start difference. First operand 2777 states and 3617 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 11:42:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:26,120 INFO L93 Difference]: Finished difference Result 8799 states and 11542 transitions. [2022-07-21 11:42:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 11:42:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 202 [2022-07-21 11:42:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:26,139 INFO L225 Difference]: With dead ends: 8799 [2022-07-21 11:42:26,139 INFO L226 Difference]: Without dead ends: 6041 [2022-07-21 11:42:26,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:42:26,146 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:26,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1530 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 11:42:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-07-21 11:42:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 2789. [2022-07-21 11:42:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2193 states have (on average 1.2439580483356134) internal successors, (2728), 2225 states have internal predecessors, (2728), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 427 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-21 11:42:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3629 transitions. [2022-07-21 11:42:26,378 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3629 transitions. Word has length 202 [2022-07-21 11:42:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:26,381 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3629 transitions. [2022-07-21 11:42:26,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 11:42:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3629 transitions. [2022-07-21 11:42:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-21 11:42:26,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:26,385 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 11:42:26,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 11:42:26,386 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1121007566, now seen corresponding path program 1 times [2022-07-21 11:42:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762773915] [2022-07-21 11:42:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:42:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:42:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:42:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:42:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 11:42:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 11:42:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 11:42:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 11:42:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:26,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762773915] [2022-07-21 11:42:26,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762773915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:26,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688391411] [2022-07-21 11:42:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:26,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:26,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:42:26,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 11:42:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:27,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-21 11:42:27,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:27,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:42:27,099 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 7 treesize of output 6 [2022-07-21 11:42:27,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:42:27,443 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1045 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1045))) is different from true [2022-07-21 11:42:27,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:42:27,490 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-21 11:42:27,522 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:42:27,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:42:27,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:42:27,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-21 11:42:35,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:42:47,791 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:42:47,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:42:48,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-21 11:43:04,314 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:43:04,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 11:43:28,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:43:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:43:53,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:44:05,242 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 13 treesize of output 15 [2022-07-21 11:44:05,248 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 13 treesize of output 15 [2022-07-21 11:44:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-07-21 11:44:05,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:44:05,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-07-21 11:44:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688391411] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:44:05,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:44:05,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-07-21 11:44:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392669635] [2022-07-21 11:44:05,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:44:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 11:44:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:44:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 11:44:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2182, Unknown=20, NotChecked=190, Total=2550 [2022-07-21 11:44:05,315 INFO L87 Difference]: Start difference. First operand 2789 states and 3629 transitions. Second operand has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-21 11:45:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:31,778 INFO L93 Difference]: Finished difference Result 8338 states and 11184 transitions. [2022-07-21 11:45:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-21 11:45:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) Word has length 209 [2022-07-21 11:45:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:31,806 INFO L225 Difference]: With dead ends: 8338 [2022-07-21 11:45:31,806 INFO L226 Difference]: Without dead ends: 5568 [2022-07-21 11:45:31,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 247 SyntacticMatches, 18 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 182.3s TimeCoverageRelationStatistics Valid=359, Invalid=5285, Unknown=64, NotChecked=298, Total=6006 [2022-07-21 11:45:31,813 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 659 mSDsluCounter, 12041 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 12573 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2594 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:45:31,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 12573 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2269 Invalid, 0 Unknown, 2594 Unchecked, 1.3s Time] [2022-07-21 11:45:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-07-21 11:45:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 3019. [2022-07-21 11:45:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2382 states have (on average 1.2472712006717044) internal successors, (2971), 2422 states have internal predecessors, (2971), 435 states have call successors, (435), 174 states have call predecessors, (435), 201 states have return successors, (518), 450 states have call predecessors, (518), 434 states have call successors, (518) [2022-07-21 11:45:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3924 transitions. [2022-07-21 11:45:32,057 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3924 transitions. Word has length 209 [2022-07-21 11:45:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:32,058 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3924 transitions. [2022-07-21 11:45:32,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-21 11:45:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3924 transitions. [2022-07-21 11:45:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-21 11:45:32,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:32,065 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:45:32,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 11:45:32,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 11:45:32,286 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1619461338, now seen corresponding path program 2 times [2022-07-21 11:45:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:32,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130650273] [2022-07-21 11:45:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:45:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:45:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:45:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:45:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:45:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:45:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 11:45:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:45:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 11:45:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-21 11:45:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:45:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 11:45:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 11:45:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130650273] [2022-07-21 11:45:32,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130650273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852348879] [2022-07-21 11:45:32,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:45:32,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:32,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:32,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:45:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 11:45:37,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:45:37,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:45:37,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 11:45:37,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:37,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:45:37,264 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 7 treesize of output 6 [2022-07-21 11:45:37,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:45:37,462 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1338) |c_#memory_int|)) is different from true [2022-07-21 11:45:37,495 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-21 11:45:37,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:45:37,525 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:45:37,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:45:37,529 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 13 treesize of output 15 [2022-07-21 11:45:37,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:45:45,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:45:55,714 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:45:55,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:45:55,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:45:59,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:46:00,179 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:46:00,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:46:00,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 11:46:16,530 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 11:46:16,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 11:46:26,724 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 13 treesize of output 15 [2022-07-21 11:46:46,902 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 13 treesize of output 15 [2022-07-21 11:46:46,908 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 13 treesize of output 15