./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-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_1a-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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:42:05,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:42:05,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:42:05,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:42:05,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:42:05,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:42:05,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:42:05,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:42:05,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:42:05,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:42:05,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:42:05,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:42:05,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:42:05,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:42:05,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:42:05,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:42:05,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:42:05,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:42:05,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:42:05,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:42:05,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:42:05,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:42:05,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:42:05,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:42:05,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:42:05,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:42:05,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:42:05,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:42:05,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:42:05,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:42:05,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:42:05,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:42:05,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:42:05,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:42:05,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:42:05,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:42:05,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:42:05,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:42:05,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:42:05,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:42:05,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:42:05,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:42:05,796 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:05,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:42:05,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:42:05,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:42:05,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:42:05,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:42:05,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:42:05,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:42:05,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:42:05,819 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:42:05,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:42:05,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:42:05,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:42:05,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:42:05,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:42:05,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:42:05,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:42:05,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:42:05,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:42:05,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:42:05,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:42:05,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:42:05,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:42:05,823 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:42:05,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:42:05,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:42:05,823 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-07-21 11:42:06,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:42:06,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:42:06,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:42:06,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:42:06,126 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:42:06,128 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:06,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804ee2bfe/bbcde5195da44ead8066b0f776c7590d/FLAG14119cbfd [2022-07-21 11:42:06,758 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:42:06,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:06,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804ee2bfe/bbcde5195da44ead8066b0f776c7590d/FLAG14119cbfd [2022-07-21 11:42:07,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804ee2bfe/bbcde5195da44ead8066b0f776c7590d [2022-07-21 11:42:07,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:42:07,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:42:07,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:42:07,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:42:07,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:42:07,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:42:07" (1/1) ... [2022-07-21 11:42:07,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585c751c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:07, skipping insertion in model container [2022-07-21 11:42:07,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:42:07" (1/1) ... [2022-07-21 11:42:07,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:42:07,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:42:07,892 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-21 11:42:07,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:42:07,949 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:42:08,090 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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-07-21 11:42:08,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:42:08,135 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:42:08,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:08 WrapperNode [2022-07-21 11:42:08,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:42:08,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:42:08,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:42:08,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:42:08,144 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:08" (1/1) ... [2022-07-21 11:42:08,181 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:08" (1/1) ... [2022-07-21 11:42:08,250 INFO L137 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 781 [2022-07-21 11:42:08,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:42:08,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:42:08,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:42:08,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:42:08,258 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:08" (1/1) ... [2022-07-21 11:42:08,263 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:08" (1/1) ... [2022-07-21 11:42:08,275 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:08" (1/1) ... [2022-07-21 11:42:08,279 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:08" (1/1) ... [2022-07-21 11:42:08,316 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:08" (1/1) ... [2022-07-21 11:42:08,326 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:08" (1/1) ... [2022-07-21 11:42:08,337 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:08" (1/1) ... [2022-07-21 11:42:08,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:42:08,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:42:08,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:42:08,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:42:08,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:08" (1/1) ... [2022-07-21 11:42:08,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:42:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:08,389 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:08,396 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:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:42:08,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:42:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:42:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 11:42:08,417 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 11:42:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:42:08,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:42:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:42:08,418 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:42:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-21 11:42:08,418 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-21 11:42:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:42:08,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:42:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:42:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:42:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:42:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-21 11:42:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-21 11:42:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 11:42:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 11:42:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:42:08,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 11:42:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-21 11:42:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-21 11:42:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-21 11:42:08,420 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-21 11:42:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-21 11:42:08,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-21 11:42:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:42:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:42:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:42:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 11:42:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 11:42:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 11:42:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 11:42:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:42:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:42:08,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:42:08,644 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:42:08,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:42:08,731 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:42:09,245 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:42:09,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:42:09,251 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:42:09,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:42:09 BoogieIcfgContainer [2022-07-21 11:42:09,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:42:09,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:42:09,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:42:09,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:42:09,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:42:07" (1/3) ... [2022-07-21 11:42:09,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e6824f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:42:09, skipping insertion in model container [2022-07-21 11:42:09,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:42:08" (2/3) ... [2022-07-21 11:42:09,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e6824f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:42:09, skipping insertion in model container [2022-07-21 11:42:09,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:42:09" (3/3) ... [2022-07-21 11:42:09,278 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:42:09,288 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:42:09,288 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:42:09,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:42:09,356 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@1739599b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77ba0b9b [2022-07-21 11:42:09,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:42:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 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:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 11:42:09,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:09,369 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:09,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -949146533, now seen corresponding path program 1 times [2022-07-21 11:42:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:09,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465907726] [2022-07-21 11:42:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:09,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:09,708 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:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465907726] [2022-07-21 11:42:09,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465907726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:09,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:42:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511774770] [2022-07-21 11:42:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:09,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:42:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:42:09,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:42:09,748 INFO L87 Difference]: Start difference. First operand has 237 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 188 states have internal predecessors, (235), 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:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:10,010 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-07-21 11:42:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:42:10,012 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:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:10,020 INFO L225 Difference]: With dead ends: 476 [2022-07-21 11:42:10,020 INFO L226 Difference]: Without dead ends: 233 [2022-07-21 11:42:10,023 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:10,025 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 90 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:10,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 468 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-21 11:42:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-07-21 11:42:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 172 states have (on average 1.2848837209302326) internal successors, (221), 177 states have internal predecessors, (221), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 11:42:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 295 transitions. [2022-07-21 11:42:10,115 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 295 transitions. Word has length 32 [2022-07-21 11:42:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:10,116 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 295 transitions. [2022-07-21 11:42:10,116 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:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 295 transitions. [2022-07-21 11:42:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 11:42:10,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:10,120 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:10,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:42:10,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -526444707, now seen corresponding path program 1 times [2022-07-21 11:42:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:10,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426753113] [2022-07-21 11:42:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,253 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:10,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:10,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426753113] [2022-07-21 11:42:10,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426753113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:10,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:10,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240926580] [2022-07-21 11:42:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:10,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:10,257 INFO L87 Difference]: Start difference. First operand 226 states and 295 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:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:10,763 INFO L93 Difference]: Finished difference Result 658 states and 868 transitions. [2022-07-21 11:42:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:42:10,764 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:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:10,768 INFO L225 Difference]: With dead ends: 658 [2022-07-21 11:42:10,768 INFO L226 Difference]: Without dead ends: 437 [2022-07-21 11:42:10,769 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:10,770 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 394 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:10,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 674 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 11:42:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-21 11:42:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2022-07-21 11:42:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 322 states have (on average 1.279503105590062) internal successors, (412), 329 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-21 11:42:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-07-21 11:42:10,817 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 32 [2022-07-21 11:42:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:10,818 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-07-21 11:42:10,818 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:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-07-21 11:42:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 11:42:10,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:10,824 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:10,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:42:10,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1956153286, now seen corresponding path program 1 times [2022-07-21 11:42:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:10,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18666533] [2022-07-21 11:42:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:10,974 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:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18666533] [2022-07-21 11:42:10,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18666533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:10,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:10,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:42:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166426001] [2022-07-21 11:42:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:10,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:42:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:10,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:42:10,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:10,978 INFO L87 Difference]: Start difference. First operand 423 states and 552 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:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:11,521 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-07-21 11:42:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:42:11,522 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:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:11,525 INFO L225 Difference]: With dead ends: 1000 [2022-07-21 11:42:11,525 INFO L226 Difference]: Without dead ends: 592 [2022-07-21 11:42:11,527 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:11,528 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 626 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:11,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 11:42:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-21 11:42:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2022-07-21 11:42:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 325 states have (on average 1.2738461538461539) internal successors, (414), 332 states have internal predecessors, (414), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-21 11:42:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2022-07-21 11:42:11,549 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 55 [2022-07-21 11:42:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:11,549 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2022-07-21 11:42:11,550 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:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2022-07-21 11:42:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 11:42:11,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:11,552 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:11,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:42:11,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1601497338, now seen corresponding path program 1 times [2022-07-21 11:42:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:11,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585227791] [2022-07-21 11:42:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:11,672 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:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:11,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585227791] [2022-07-21 11:42:11,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585227791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:11,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:11,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120706195] [2022-07-21 11:42:11,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:11,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:11,674 INFO L87 Difference]: Start difference. First operand 426 states and 554 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:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:12,012 INFO L93 Difference]: Finished difference Result 1269 states and 1671 transitions. [2022-07-21 11:42:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:42:12,012 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:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:12,016 INFO L225 Difference]: With dead ends: 1269 [2022-07-21 11:42:12,016 INFO L226 Difference]: Without dead ends: 858 [2022-07-21 11:42:12,017 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:12,018 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 391 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:12,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 779 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:42:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-07-21 11:42:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 828. [2022-07-21 11:42:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 636 states have (on average 1.2688679245283019) internal successors, (807), 647 states have internal predecessors, (807), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1077 transitions. [2022-07-21 11:42:12,044 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1077 transitions. Word has length 55 [2022-07-21 11:42:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:12,045 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1077 transitions. [2022-07-21 11:42:12,045 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:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1077 transitions. [2022-07-21 11:42:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 11:42:12,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:12,046 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:12,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:42:12,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1893200283, now seen corresponding path program 1 times [2022-07-21 11:42:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:12,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845937951] [2022-07-21 11:42:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,131 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:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:12,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845937951] [2022-07-21 11:42:12,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845937951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:12,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:12,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353296069] [2022-07-21 11:42:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:12,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:12,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:12,133 INFO L87 Difference]: Start difference. First operand 828 states and 1077 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:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:12,341 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2022-07-21 11:42:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:12,342 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:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:12,345 INFO L225 Difference]: With dead ends: 858 [2022-07-21 11:42:12,345 INFO L226 Difference]: Without dead ends: 855 [2022-07-21 11:42:12,345 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:12,346 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 279 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:12,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 599 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-07-21 11:42:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 827. [2022-07-21 11:42:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 636 states have (on average 1.2672955974842768) internal successors, (806), 646 states have internal predecessors, (806), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1075 transitions. [2022-07-21 11:42:12,372 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1075 transitions. Word has length 56 [2022-07-21 11:42:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:12,372 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1075 transitions. [2022-07-21 11:42:12,372 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:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1075 transitions. [2022-07-21 11:42:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 11:42:12,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:12,374 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:12,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:42:12,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1440318295, now seen corresponding path program 1 times [2022-07-21 11:42:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686735458] [2022-07-21 11:42:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,458 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:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686735458] [2022-07-21 11:42:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686735458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799899638] [2022-07-21 11:42:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:12,460 INFO L87 Difference]: Start difference. First operand 827 states and 1075 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:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:12,669 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2022-07-21 11:42:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:12,669 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:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:12,672 INFO L225 Difference]: With dead ends: 857 [2022-07-21 11:42:12,672 INFO L226 Difference]: Without dead ends: 854 [2022-07-21 11:42:12,673 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:12,673 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 276 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:12,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 595 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-21 11:42:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2022-07-21 11:42:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 636 states have (on average 1.2657232704402517) internal successors, (805), 645 states have internal predecessors, (805), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1073 transitions. [2022-07-21 11:42:12,697 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1073 transitions. Word has length 57 [2022-07-21 11:42:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:12,697 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1073 transitions. [2022-07-21 11:42:12,697 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:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1073 transitions. [2022-07-21 11:42:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 11:42:12,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:12,698 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:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:42:12,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1700174242, now seen corresponding path program 1 times [2022-07-21 11:42:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:12,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166863136] [2022-07-21 11:42:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:12,767 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:12,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:12,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166863136] [2022-07-21 11:42:12,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166863136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:12,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:12,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:42:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920618345] [2022-07-21 11:42:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:42:12,769 INFO L87 Difference]: Start difference. First operand 826 states and 1073 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:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:13,014 INFO L93 Difference]: Finished difference Result 856 states and 1122 transitions. [2022-07-21 11:42:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:42:13,014 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:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:13,017 INFO L225 Difference]: With dead ends: 856 [2022-07-21 11:42:13,018 INFO L226 Difference]: Without dead ends: 845 [2022-07-21 11:42:13,018 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:13,019 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 273 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:13,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 594 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-21 11:42:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 817. [2022-07-21 11:42:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 628 states have (on average 1.2643312101910829) internal successors, (794), 636 states have internal predecessors, (794), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1061 transitions. [2022-07-21 11:42:13,046 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1061 transitions. Word has length 58 [2022-07-21 11:42:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:13,046 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 1061 transitions. [2022-07-21 11:42:13,046 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:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1061 transitions. [2022-07-21 11:42:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 11:42:13,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:13,049 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] [2022-07-21 11:42:13,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:42:13,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1841089283, now seen corresponding path program 1 times [2022-07-21 11:42:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:13,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943465569] [2022-07-21 11:42:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:42:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 11:42:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 11:42:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:42:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:42:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:42:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 11:42:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 11:42:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:42:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:42:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,208 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:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:13,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943465569] [2022-07-21 11:42:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943465569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:13,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:42:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632572599] [2022-07-21 11:42:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:42:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:13,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:42:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:42:13,211 INFO L87 Difference]: Start difference. First operand 817 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:13,509 INFO L93 Difference]: Finished difference Result 1711 states and 2241 transitions. [2022-07-21 11:42:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2022-07-21 11:42:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:13,513 INFO L225 Difference]: With dead ends: 1711 [2022-07-21 11:42:13,513 INFO L226 Difference]: Without dead ends: 909 [2022-07-21 11:42:13,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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:13,518 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 90 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:13,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1119 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:42:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-07-21 11:42:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 871. [2022-07-21 11:42:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 681 states have (on average 1.2745961820851688) internal successors, (868), 689 states have internal predecessors, (868), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1135 transitions. [2022-07-21 11:42:13,542 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1135 transitions. Word has length 153 [2022-07-21 11:42:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:13,543 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1135 transitions. [2022-07-21 11:42:13,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1135 transitions. [2022-07-21 11:42:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 11:42:13,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:13,545 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] [2022-07-21 11:42:13,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:42:13,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 314942574, now seen corresponding path program 1 times [2022-07-21 11:42:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:13,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517273416] [2022-07-21 11:42:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:42:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 11:42:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:42:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 11:42:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:42:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:42:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:42:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:42:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:13,672 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:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517273416] [2022-07-21 11:42:13,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517273416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:13,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:13,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:42:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145828954] [2022-07-21 11:42:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:13,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:42:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:13,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:42:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:13,674 INFO L87 Difference]: Start difference. First operand 871 states and 1135 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:14,012 INFO L93 Difference]: Finished difference Result 2321 states and 3120 transitions. [2022-07-21 11:42:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:14,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-07-21 11:42:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:14,017 INFO L225 Difference]: With dead ends: 2321 [2022-07-21 11:42:14,017 INFO L226 Difference]: Without dead ends: 1469 [2022-07-21 11:42:14,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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:14,019 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 450 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:14,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1833 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:42:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-21 11:42:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 883. [2022-07-21 11:42:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 693 states have (on average 1.2698412698412698) internal successors, (880), 701 states have internal predecessors, (880), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-07-21 11:42:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1147 transitions. [2022-07-21 11:42:14,049 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1147 transitions. Word has length 162 [2022-07-21 11:42:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:14,049 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1147 transitions. [2022-07-21 11:42:14,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1147 transitions. [2022-07-21 11:42:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 11:42:14,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:14,052 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] [2022-07-21 11:42:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:42:14,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1067823865, now seen corresponding path program 1 times [2022-07-21 11:42:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:14,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354221025] [2022-07-21 11:42:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 11:42:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:42:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:42:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:42:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,213 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:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354221025] [2022-07-21 11:42:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354221025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646963018] [2022-07-21 11:42:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:14,232 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:14,299 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:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:14,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:42:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:14,620 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:14,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:14,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646963018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:14,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:14,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-21 11:42:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80233291] [2022-07-21 11:42:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:14,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:42:14,623 INFO L87 Difference]: Start difference. First operand 883 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:14,765 INFO L93 Difference]: Finished difference Result 2857 states and 3742 transitions. [2022-07-21 11:42:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:42:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-21 11:42:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:14,772 INFO L225 Difference]: With dead ends: 2857 [2022-07-21 11:42:14,772 INFO L226 Difference]: Without dead ends: 1993 [2022-07-21 11:42:14,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 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:14,774 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 401 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1915 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:14,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1915 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:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-21 11:42:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 919. [2022-07-21 11:42:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 721 states have (on average 1.259361997226075) internal successors, (908), 729 states have internal predecessors, (908), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-07-21 11:42:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1191 transitions. [2022-07-21 11:42:14,862 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1191 transitions. Word has length 164 [2022-07-21 11:42:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:14,863 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1191 transitions. [2022-07-21 11:42:14,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1191 transitions. [2022-07-21 11:42:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 11:42:14,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:14,865 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] [2022-07-21 11:42:14,900 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:15,084 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,SelfDestructingSolverStorable9 [2022-07-21 11:42:15,084 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2078941115, now seen corresponding path program 1 times [2022-07-21 11:42:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:15,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371773256] [2022-07-21 11:42:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 11:42:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:42:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:42:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:42:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:42:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,284 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:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:15,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371773256] [2022-07-21 11:42:15,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371773256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:15,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530811164] [2022-07-21 11:42:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:15,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:15,304 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:15,354 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:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 11:42:15,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-21 11:42:15,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:15,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530811164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:15,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:15,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-07-21 11:42:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499838200] [2022-07-21 11:42:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:15,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:42:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:42:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:42:15,766 INFO L87 Difference]: Start difference. First operand 919 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:15,889 INFO L93 Difference]: Finished difference Result 2201 states and 2930 transitions. [2022-07-21 11:42:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:42:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-07-21 11:42:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:15,894 INFO L225 Difference]: With dead ends: 2201 [2022-07-21 11:42:15,894 INFO L226 Difference]: Without dead ends: 1301 [2022-07-21 11:42:15,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:42:15,896 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 97 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:15,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1903 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:42:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-07-21 11:42:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 939. [2022-07-21 11:42:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2537313432835822) internal successors, (924), 745 states have internal predecessors, (924), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-21 11:42:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1227 transitions. [2022-07-21 11:42:15,948 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1227 transitions. Word has length 164 [2022-07-21 11:42:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:15,948 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1227 transitions. [2022-07-21 11:42:15,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 11:42:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1227 transitions. [2022-07-21 11:42:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 11:42:15,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:15,951 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] [2022-07-21 11:42:15,985 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:16,186 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,SelfDestructingSolverStorable10 [2022-07-21 11:42:16,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1954792649, now seen corresponding path program 1 times [2022-07-21 11:42:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89333744] [2022-07-21 11:42:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 11:42:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:42:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:42:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:42:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 11:42:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 11:42:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 11:42:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:42:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:16,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89333744] [2022-07-21 11:42:16,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89333744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:16,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243721931] [2022-07-21 11:42:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:16,376 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:16,378 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:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:16,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 11:42:16,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-21 11:42:16,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:16,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243721931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:16,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:16,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-21 11:42:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236384460] [2022-07-21 11:42:16,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:16,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:42:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:16,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:42:16,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:16,721 INFO L87 Difference]: Start difference. First operand 939 states and 1227 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:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:16,804 INFO L93 Difference]: Finished difference Result 1879 states and 2467 transitions. [2022-07-21 11:42:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:42:16,804 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 170 [2022-07-21 11:42:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:16,807 INFO L225 Difference]: With dead ends: 1879 [2022-07-21 11:42:16,807 INFO L226 Difference]: Without dead ends: 959 [2022-07-21 11:42:16,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:42:16,810 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 1 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:16,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:42:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-21 11:42:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 947. [2022-07-21 11:42:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 745 states have (on average 1.251006711409396) internal successors, (932), 749 states have internal predecessors, (932), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-21 11:42:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1235 transitions. [2022-07-21 11:42:16,863 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1235 transitions. Word has length 170 [2022-07-21 11:42:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:16,863 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1235 transitions. [2022-07-21 11:42:16,863 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:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1235 transitions. [2022-07-21 11:42:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-21 11:42:16,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:16,866 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] [2022-07-21 11:42:16,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 11:42:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:17,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -794500219, now seen corresponding path program 2 times [2022-07-21 11:42:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032789997] [2022-07-21 11:42:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,209 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,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:17,216 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 56 [2022-07-21 11:42:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:42:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:42:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:42:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:42:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:42:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:42:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 11:42:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:17,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032789997] [2022-07-21 11:42:17,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032789997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:17,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394648381] [2022-07-21 11:42:17,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:42:17,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:17,344 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:17,392 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:17,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:42:17,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:42:17,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 11:42:17,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:17,655 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:17,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:17,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394648381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:17,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:17,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-07-21 11:42:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867494690] [2022-07-21 11:42:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:17,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:42:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:42:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:42:17,658 INFO L87 Difference]: Start difference. First operand 947 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:17,888 INFO L93 Difference]: Finished difference Result 1933 states and 2603 transitions. [2022-07-21 11:42:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:42:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 176 [2022-07-21 11:42:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:17,894 INFO L225 Difference]: With dead ends: 1933 [2022-07-21 11:42:17,894 INFO L226 Difference]: Without dead ends: 1465 [2022-07-21 11:42:17,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-21 11:42:17,896 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 611 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:17,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1863 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-07-21 11:42:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 953. [2022-07-21 11:42:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 751 states have (on average 1.2490013315579227) internal successors, (938), 755 states have internal predecessors, (938), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-07-21 11:42:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1241 transitions. [2022-07-21 11:42:17,956 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1241 transitions. Word has length 176 [2022-07-21 11:42:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:17,957 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1241 transitions. [2022-07-21 11:42:17,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 11:42:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1241 transitions. [2022-07-21 11:42:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 11:42:17,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:17,959 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 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] [2022-07-21 11:42:17,977 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:18,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:18,177 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1273770335, now seen corresponding path program 1 times [2022-07-21 11:42:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:18,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292983643] [2022-07-21 11:42:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:42:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:42:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:42:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:42:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:42:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 11:42:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 11:42:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 11:42:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-21 11:42:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292983643] [2022-07-21 11:42:18,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292983643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545523530] [2022-07-21 11:42:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:18,448 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:18,449 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:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:18,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:42:18,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-21 11:42:18,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:42:18,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545523530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:18,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:42:18,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 11:42:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19555381] [2022-07-21 11:42:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:18,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:42:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:42:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:42:18,965 INFO L87 Difference]: Start difference. First operand 953 states and 1241 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 11:42:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:19,208 INFO L93 Difference]: Finished difference Result 2823 states and 3686 transitions. [2022-07-21 11:42:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:42:19,209 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 207 [2022-07-21 11:42:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:19,216 INFO L225 Difference]: With dead ends: 2823 [2022-07-21 11:42:19,216 INFO L226 Difference]: Without dead ends: 2815 [2022-07-21 11:42:19,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 245 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:19,217 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 410 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:19,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1103 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 11:42:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-07-21 11:42:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2801. [2022-07-21 11:42:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2211 states have (on average 1.252826775214835) internal successors, (2770), 2227 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-21 11:42:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3665 transitions. [2022-07-21 11:42:19,377 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3665 transitions. Word has length 207 [2022-07-21 11:42:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:19,377 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 3665 transitions. [2022-07-21 11:42:19,378 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 11:42:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3665 transitions. [2022-07-21 11:42:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 11:42:19,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:19,381 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 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] [2022-07-21 11:42:19,402 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:19,600 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,SelfDestructingSolverStorable13 [2022-07-21 11:42:19,601 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 262653085, now seen corresponding path program 1 times [2022-07-21 11:42:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676803935] [2022-07-21 11:42:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:42:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:42:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:42:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:42:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:42:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 11:42:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 11:42:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 11:42:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-21 11:42:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676803935] [2022-07-21 11:42:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676803935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:42:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:42:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:42:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31512857] [2022-07-21 11:42:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:42:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:42:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:42:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:42:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:42:19,849 INFO L87 Difference]: Start difference. First operand 2801 states and 3665 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-21 11:42:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:42:20,728 INFO L93 Difference]: Finished difference Result 8991 states and 11824 transitions. [2022-07-21 11:42:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 11:42:20,729 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 207 [2022-07-21 11:42:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:42:20,747 INFO L225 Difference]: With dead ends: 8991 [2022-07-21 11:42:20,747 INFO L226 Difference]: Without dead ends: 6209 [2022-07-21 11:42:20,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 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:20,754 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 472 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:42:20,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1553 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 11:42:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2022-07-21 11:42:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 2813. [2022-07-21 11:42:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2223 states have (on average 1.2514619883040936) internal successors, (2782), 2243 states have internal predecessors, (2782), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-07-21 11:42:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3677 transitions. [2022-07-21 11:42:21,033 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3677 transitions. Word has length 207 [2022-07-21 11:42:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:42:21,034 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3677 transitions. [2022-07-21 11:42:21,034 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-21 11:42:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3677 transitions. [2022-07-21 11:42:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 11:42:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:42:21,041 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 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, 1, 1] [2022-07-21 11:42:21,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 11:42:21,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:42:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:42:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1700386181, now seen corresponding path program 1 times [2022-07-21 11:42:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:42:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61606351] [2022-07-21 11:42:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:42:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:42:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:42:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:42:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:42:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:42:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:42:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:42:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:42:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:42:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:42:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:42:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:42:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 11:42:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 11:42:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:42:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:42:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-21 11:42:21,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:42:21,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61606351] [2022-07-21 11:42:21,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61606351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:42:21,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582050429] [2022-07-21 11:42:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:42:21,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:42:21,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:42:21,325 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:21,326 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:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:42:21,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-21 11:42:21,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:42:21,713 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:21,764 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:22,053 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1026 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1026) |c_#memory_int|)) is different from true [2022-07-21 11:42:22,086 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:22,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:42:22,102 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:22,107 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:42:22,108 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:35,032 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:43:47,160 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:43:47,173 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:43:59,319 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:43:59,325 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:43:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-07-21 11:43:59,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:43:59,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1035 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1035) |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:43:59,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582050429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:43:59,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:43:59,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-07-21 11:43:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762458983] [2022-07-21 11:43:59,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:43:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 11:43:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:43:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 11:43:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1426, Unknown=9, NotChecked=154, Total=1722 [2022-07-21 11:43:59,400 INFO L87 Difference]: Start difference. First operand 2813 states and 3677 transitions. Second operand has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-21 11:45:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:45:21,348 INFO L93 Difference]: Finished difference Result 7649 states and 10194 transitions. [2022-07-21 11:45:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 11:45:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 214 [2022-07-21 11:45:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:45:21,386 INFO L225 Difference]: With dead ends: 7649 [2022-07-21 11:45:21,386 INFO L226 Difference]: Without dead ends: 4855 [2022-07-21 11:45:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 275 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 177.7s TimeCoverageRelationStatistics Valid=322, Invalid=3798, Unknown=48, NotChecked=254, Total=4422 [2022-07-21 11:45:21,396 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 661 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 8120 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1373 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:45:21,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 8120 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1608 Invalid, 0 Unknown, 1373 Unchecked, 0.9s Time] [2022-07-21 11:45:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2022-07-21 11:45:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3317. [2022-07-21 11:45:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 2652 states have (on average 1.254524886877828) internal successors, (3327), 2664 states have internal predecessors, (3327), 457 states have call successors, (457), 180 states have call predecessors, (457), 207 states have return successors, (564), 496 states have call predecessors, (564), 456 states have call successors, (564) [2022-07-21 11:45:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4348 transitions. [2022-07-21 11:45:21,676 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4348 transitions. Word has length 214 [2022-07-21 11:45:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:45:21,676 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4348 transitions. [2022-07-21 11:45:21,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.552631578947368) internal successors, (249), 28 states have internal predecessors, (249), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-07-21 11:45:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4348 transitions. [2022-07-21 11:45:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-21 11:45:21,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:45:21,683 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 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, 1, 1] [2022-07-21 11:45:21,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 11:45:21,904 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,SelfDestructingSolverStorable15 [2022-07-21 11:45:21,905 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:45:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:45:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1803165317, now seen corresponding path program 2 times [2022-07-21 11:45:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:45:21,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636634324] [2022-07-21 11:45:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:45:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:45:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 11:45:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:45:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:45:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:45:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:45:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:45:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:45:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:45:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:45:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:45:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:45:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:45:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 11:45:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:45:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 11:45:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 11:45:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:45:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-21 11:45:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:45:22,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636634324] [2022-07-21 11:45:22,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636634324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:45:22,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934581305] [2022-07-21 11:45:22,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:45:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:45:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:45:22,156 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:22,157 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:22,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:45:22,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:45:22,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 150 conjunts are in the unsatisfiable core [2022-07-21 11:45:22,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:45:22,573 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:22,593 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:22,802 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:22,806 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1324 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1324))) is different from true [2022-07-21 11:45:22,838 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:22,840 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:22,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:45:22,859 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:22,870 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:45:22,871 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:22,923 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:26,985 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:27,087 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:45:27,087 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:27,519 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:45:31,567 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:31,793 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 11:45:31,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 11:45:31,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 11:45:58,187 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-21 11:45:58,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 11:46:08,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:46:18,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:46:18,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-21 11:46:28,757 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:28,799 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:28,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-07-21 11:46:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 44 proven. 86 refuted. 0 times theorem prover too weak. 29 trivial. 2 not checked. [2022-07-21 11:46:28,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:46:28,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-07-21 11:46:28,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934581305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:46:28,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:46:28,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 45] total 52 [2022-07-21 11:46:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920999532] [2022-07-21 11:46:28,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:46:28,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-21 11:46:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:46:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-21 11:46:28,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2611, Unknown=22, NotChecked=210, Total=3080 [2022-07-21 11:46:28,970 INFO L87 Difference]: Start difference. First operand 3317 states and 4348 transitions. Second operand has 52 states, 48 states have (on average 5.333333333333333) internal successors, (256), 38 states have internal predecessors, (256), 15 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41)