./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:05:05,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:05:05,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:05:05,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:05:05,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:05:05,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:05:05,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:05:05,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:05:05,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:05:05,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:05:05,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:05:05,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:05:05,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:05:05,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:05:05,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:05:05,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:05:05,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:05:05,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:05:05,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:05:05,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:05:05,124 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:05:05,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:05:05,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:05:05,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:05:05,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:05:05,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:05:05,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:05:05,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:05:05,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:05:05,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:05:05,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:05:05,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:05:05,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:05:05,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:05:05,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:05:05,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:05:05,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:05:05,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:05:05,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:05:05,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:05:05,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:05:05,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:05:05,143 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:05:05,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:05:05,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:05:05,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:05:05,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:05:05,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:05:05,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:05:05,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:05:05,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:05:05,180 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:05:05,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:05:05,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:05:05,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:05:05,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:05:05,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:05:05,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:05:05,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:05:05,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:05:05,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:05:05,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:05:05,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:05:05,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:05:05,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:05:05,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:05:05,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:05:05,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:05:05,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:05:05,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:05:05,184 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:05:05,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:05:05,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:05:05,184 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 -> 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 [2022-07-21 11:05:05,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:05:05,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:05:05,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:05:05,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:05:05,500 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:05:05,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-21 11:05:05,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499fbd57b/a707db8f5ece42d192d617d07a429e75/FLAGfccb71927 [2022-07-21 11:05:06,163 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:05:06,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-21 11:05:06,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499fbd57b/a707db8f5ece42d192d617d07a429e75/FLAGfccb71927 [2022-07-21 11:05:06,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499fbd57b/a707db8f5ece42d192d617d07a429e75 [2022-07-21 11:05:06,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:05:06,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:05:06,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:05:06,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:05:06,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:05:06,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:05:06" (1/1) ... [2022-07-21 11:05:06,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681818ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:06, skipping insertion in model container [2022-07-21 11:05:06,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:05:06" (1/1) ... [2022-07-21 11:05:06,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:05:06,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:05:07,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-21 11:05:07,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:05:07,340 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:05:07,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-21 11:05:07,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:05:07,568 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:05:07,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07 WrapperNode [2022-07-21 11:05:07,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:05:07,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:05:07,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:05:07,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:05:07,575 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:05:07" (1/1) ... [2022-07-21 11:05:07,617 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:05:07" (1/1) ... [2022-07-21 11:05:07,666 INFO L137 Inliner]: procedures = 88, calls = 403, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1034 [2022-07-21 11:05:07,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:05:07,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:05:07,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:05:07,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:05:07,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:05:07,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:05:07,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:05:07,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:05:07,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (1/1) ... [2022-07-21 11:05:07,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:05:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:07,809 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:05:07,835 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:05:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-21 11:05:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-21 11:05:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:05:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2022-07-21 11:05:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2022-07-21 11:05:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 11:05:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:05:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:05:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 11:05:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 11:05:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:05:07,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:05:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:05:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:05:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-21 11:05:07,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-21 11:05:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 11:05:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 11:05:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:05:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:05:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-07-21 11:05:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-07-21 11:05:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:05:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:05:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-21 11:05:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-21 11:05:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2022-07-21 11:05:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2022-07-21 11:05:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-21 11:05:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-21 11:05:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:05:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:05:07,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:05:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 11:05:07,851 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 11:05:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:05:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:05:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:05:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:05:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-21 11:05:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-21 11:05:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 11:05:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 11:05:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 11:05:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-21 11:05:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-21 11:05:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:05:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:05:08,096 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:05:08,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:05:08,297 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:05:08,921 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:05:08,928 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:05:08,928 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 11:05:08,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:05:08 BoogieIcfgContainer [2022-07-21 11:05:08,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:05:08,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:05:08,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:05:08,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:05:08,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:05:06" (1/3) ... [2022-07-21 11:05:08,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342cfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:05:08, skipping insertion in model container [2022-07-21 11:05:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:05:07" (2/3) ... [2022-07-21 11:05:08,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342cfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:05:08, skipping insertion in model container [2022-07-21 11:05:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:05:08" (3/3) ... [2022-07-21 11:05:08,935 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-21 11:05:08,945 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:05:08,945 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:05:08,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:05:08,989 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@15f2da7b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@570c77ca [2022-07-21 11:05:08,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:05:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-21 11:05:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 11:05:09,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:09,003 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] [2022-07-21 11:05:09,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 722424881, now seen corresponding path program 1 times [2022-07-21 11:05:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:09,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626915358] [2022-07-21 11:05:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:09,317 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:05:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:09,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626915358] [2022-07-21 11:05:09,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626915358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:09,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:09,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:05:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056387619] [2022-07-21 11:05:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:09,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:05:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:05:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:05:09,342 INFO L87 Difference]: Start difference. First operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 11:05:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:10,091 INFO L93 Difference]: Finished difference Result 947 states and 1418 transitions. [2022-07-21 11:05:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:05:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-21 11:05:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:10,114 INFO L225 Difference]: With dead ends: 947 [2022-07-21 11:05:10,115 INFO L226 Difference]: Without dead ends: 633 [2022-07-21 11:05:10,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:05:10,130 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 503 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:10,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1037 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:05:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-07-21 11:05:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2022-07-21 11:05:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-21 11:05:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2022-07-21 11:05:10,215 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 25 [2022-07-21 11:05:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:10,216 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2022-07-21 11:05:10,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 11:05:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2022-07-21 11:05:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 11:05:10,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:10,218 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] [2022-07-21 11:05:10,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:05:10,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1364109622, now seen corresponding path program 1 times [2022-07-21 11:05:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975076663] [2022-07-21 11:05:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:10,333 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:05:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975076663] [2022-07-21 11:05:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975076663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:10,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:10,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:05:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234997897] [2022-07-21 11:05:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:10,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:05:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:05:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:05:10,336 INFO L87 Difference]: Start difference. First operand 565 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 11:05:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:11,100 INFO L93 Difference]: Finished difference Result 1189 states and 1695 transitions. [2022-07-21 11:05:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:05:11,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-21 11:05:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:11,104 INFO L225 Difference]: With dead ends: 1189 [2022-07-21 11:05:11,104 INFO L226 Difference]: Without dead ends: 632 [2022-07-21 11:05:11,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:05:11,106 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 701 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:11,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1320 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:05:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-07-21 11:05:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 564. [2022-07-21 11:05:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-21 11:05:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 797 transitions. [2022-07-21 11:05:11,144 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 797 transitions. Word has length 29 [2022-07-21 11:05:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:11,144 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 797 transitions. [2022-07-21 11:05:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 11:05:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 797 transitions. [2022-07-21 11:05:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 11:05:11,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:11,151 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:11,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:05:11,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2094845703, now seen corresponding path program 1 times [2022-07-21 11:05:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352097860] [2022-07-21 11:05:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:05:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:11,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:05:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 11:05:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:11,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352097860] [2022-07-21 11:05:11,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352097860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:11,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:05:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506492357] [2022-07-21 11:05:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:11,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:05:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:05:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:05:11,343 INFO L87 Difference]: Start difference. First operand 564 states and 797 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 11:05:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:12,026 INFO L93 Difference]: Finished difference Result 1799 states and 2590 transitions. [2022-07-21 11:05:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:05:12,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-21 11:05:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:12,031 INFO L225 Difference]: With dead ends: 1799 [2022-07-21 11:05:12,031 INFO L226 Difference]: Without dead ends: 1238 [2022-07-21 11:05:12,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:05:12,034 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 491 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:12,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1756 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:05:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-07-21 11:05:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1138. [2022-07-21 11:05:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-07-21 11:05:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2022-07-21 11:05:12,068 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 50 [2022-07-21 11:05:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:12,068 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2022-07-21 11:05:12,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 11:05:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2022-07-21 11:05:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 11:05:12,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:12,073 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:12,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:05:12,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1094727353, now seen corresponding path program 1 times [2022-07-21 11:05:12,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231071237] [2022-07-21 11:05:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:05:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:05:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 11:05:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 11:05:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 11:05:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231071237] [2022-07-21 11:05:12,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231071237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:12,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:12,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:05:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075100768] [2022-07-21 11:05:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:05:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:05:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:05:12,214 INFO L87 Difference]: Start difference. First operand 1138 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 11:05:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:12,816 INFO L93 Difference]: Finished difference Result 1832 states and 2618 transitions. [2022-07-21 11:05:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:05:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2022-07-21 11:05:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:12,819 INFO L225 Difference]: With dead ends: 1832 [2022-07-21 11:05:12,820 INFO L226 Difference]: Without dead ends: 702 [2022-07-21 11:05:12,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:05:12,822 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:12,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1111 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:05:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-21 11:05:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 642. [2022-07-21 11:05:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-07-21 11:05:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 910 transitions. [2022-07-21 11:05:12,839 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 910 transitions. Word has length 97 [2022-07-21 11:05:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:12,839 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 910 transitions. [2022-07-21 11:05:12,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 11:05:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 910 transitions. [2022-07-21 11:05:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 11:05:12,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:12,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:12,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:05:12,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -660311895, now seen corresponding path program 2 times [2022-07-21 11:05:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433471596] [2022-07-21 11:05:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:05:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:05:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:05:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 11:05:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 11:05:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:13,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433471596] [2022-07-21 11:05:13,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433471596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:13,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:13,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:05:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630767369] [2022-07-21 11:05:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:13,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:05:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:05:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:05:13,077 INFO L87 Difference]: Start difference. First operand 642 states and 910 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 11:05:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:13,686 INFO L93 Difference]: Finished difference Result 1288 states and 1855 transitions. [2022-07-21 11:05:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:05:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 97 [2022-07-21 11:05:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:13,690 INFO L225 Difference]: With dead ends: 1288 [2022-07-21 11:05:13,690 INFO L226 Difference]: Without dead ends: 678 [2022-07-21 11:05:13,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:05:13,691 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 98 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:13,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2271 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 11:05:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-21 11:05:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 642. [2022-07-21 11:05:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-07-21 11:05:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 908 transitions. [2022-07-21 11:05:13,708 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 908 transitions. Word has length 97 [2022-07-21 11:05:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:13,708 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 908 transitions. [2022-07-21 11:05:13,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 11:05:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 908 transitions. [2022-07-21 11:05:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 11:05:13,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:13,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:13,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:05:13,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1628559102, now seen corresponding path program 1 times [2022-07-21 11:05:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399083082] [2022-07-21 11:05:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:05:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:05:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:05:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:05:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 11:05:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:13,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399083082] [2022-07-21 11:05:13,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399083082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:13,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:13,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 11:05:13,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309404507] [2022-07-21 11:05:13,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:13,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 11:05:13,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 11:05:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:05:13,921 INFO L87 Difference]: Start difference. First operand 642 states and 908 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 11:05:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:14,664 INFO L93 Difference]: Finished difference Result 1292 states and 1853 transitions. [2022-07-21 11:05:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 11:05:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 109 [2022-07-21 11:05:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:14,667 INFO L225 Difference]: With dead ends: 1292 [2022-07-21 11:05:14,667 INFO L226 Difference]: Without dead ends: 682 [2022-07-21 11:05:14,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:05:14,669 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 113 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:14,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 3309 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:05:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-21 11:05:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2022-07-21 11:05:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-21 11:05:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 910 transitions. [2022-07-21 11:05:14,687 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 910 transitions. Word has length 109 [2022-07-21 11:05:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:14,688 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 910 transitions. [2022-07-21 11:05:14,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 11:05:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 910 transitions. [2022-07-21 11:05:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 11:05:14,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:14,690 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:14,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:05:14,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash -556686604, now seen corresponding path program 1 times [2022-07-21 11:05:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933184571] [2022-07-21 11:05:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 11:05:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:05:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:05:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:05:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 11:05:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:14,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933184571] [2022-07-21 11:05:14,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933184571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:14,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:14,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:05:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480119340] [2022-07-21 11:05:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:05:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:05:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:05:14,899 INFO L87 Difference]: Start difference. First operand 646 states and 910 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:05:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:15,366 INFO L93 Difference]: Finished difference Result 1347 states and 1922 transitions. [2022-07-21 11:05:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:05:15,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-07-21 11:05:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:15,370 INFO L225 Difference]: With dead ends: 1347 [2022-07-21 11:05:15,371 INFO L226 Difference]: Without dead ends: 719 [2022-07-21 11:05:15,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:05:15,374 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 140 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:15,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 11:05:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-07-21 11:05:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 647. [2022-07-21 11:05:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-21 11:05:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2022-07-21 11:05:15,394 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 115 [2022-07-21 11:05:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:15,394 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2022-07-21 11:05:15,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:05:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2022-07-21 11:05:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 11:05:15,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:15,396 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:15,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:05:15,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1428826331, now seen corresponding path program 1 times [2022-07-21 11:05:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:15,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068098463] [2022-07-21 11:05:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 11:05:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 11:05:15,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:15,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068098463] [2022-07-21 11:05:15,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068098463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:15,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:15,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-21 11:05:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912525311] [2022-07-21 11:05:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:15,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 11:05:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 11:05:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-21 11:05:15,925 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:05:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:17,769 INFO L93 Difference]: Finished difference Result 1567 states and 2276 transitions. [2022-07-21 11:05:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 11:05:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 111 [2022-07-21 11:05:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:17,774 INFO L225 Difference]: With dead ends: 1567 [2022-07-21 11:05:17,774 INFO L226 Difference]: Without dead ends: 953 [2022-07-21 11:05:17,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-21 11:05:17,775 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 237 mSDsluCounter, 7480 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 8036 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:17,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 8036 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 11:05:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-21 11:05:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 656. [2022-07-21 11:05:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 532 states have (on average 1.3759398496240602) internal successors, (732), 533 states have internal predecessors, (732), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-21 11:05:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 922 transitions. [2022-07-21 11:05:17,803 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 922 transitions. Word has length 111 [2022-07-21 11:05:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:17,804 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 922 transitions. [2022-07-21 11:05:17,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:05:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 922 transitions. [2022-07-21 11:05:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 11:05:17,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:17,808 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:05:17,809 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -363635253, now seen corresponding path program 1 times [2022-07-21 11:05:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:17,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575660781] [2022-07-21 11:05:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 11:05:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:17,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575660781] [2022-07-21 11:05:17,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575660781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:17,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:17,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:05:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219098430] [2022-07-21 11:05:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:17,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:05:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:05:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:05:17,997 INFO L87 Difference]: Start difference. First operand 656 states and 922 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:05:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:19,384 INFO L93 Difference]: Finished difference Result 1520 states and 2195 transitions. [2022-07-21 11:05:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:05:19,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-07-21 11:05:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:19,388 INFO L225 Difference]: With dead ends: 1520 [2022-07-21 11:05:19,388 INFO L226 Difference]: Without dead ends: 897 [2022-07-21 11:05:19,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:05:19,389 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 186 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:19,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1911 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 11:05:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-07-21 11:05:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 664. [2022-07-21 11:05:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 540 states have (on average 1.3777777777777778) internal successors, (744), 541 states have internal predecessors, (744), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-21 11:05:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 934 transitions. [2022-07-21 11:05:19,420 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 934 transitions. Word has length 116 [2022-07-21 11:05:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:19,420 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 934 transitions. [2022-07-21 11:05:19,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 11:05:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 934 transitions. [2022-07-21 11:05:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 11:05:19,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:19,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:19,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:05:19,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -161811319, now seen corresponding path program 1 times [2022-07-21 11:05:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:19,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497853382] [2022-07-21 11:05:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 11:05:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:19,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497853382] [2022-07-21 11:05:19,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497853382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:19,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:19,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-21 11:05:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574789421] [2022-07-21 11:05:19,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:19,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 11:05:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 11:05:19,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-21 11:05:19,924 INFO L87 Difference]: Start difference. First operand 664 states and 934 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:05:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:21,151 INFO L93 Difference]: Finished difference Result 1386 states and 1981 transitions. [2022-07-21 11:05:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 11:05:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 116 [2022-07-21 11:05:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:21,164 INFO L225 Difference]: With dead ends: 1386 [2022-07-21 11:05:21,164 INFO L226 Difference]: Without dead ends: 755 [2022-07-21 11:05:21,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-21 11:05:21,167 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 214 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:21,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 5139 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:05:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-07-21 11:05:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 668. [2022-07-21 11:05:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 544 states have (on average 1.375) internal successors, (748), 543 states have internal predecessors, (748), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-21 11:05:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 938 transitions. [2022-07-21 11:05:21,189 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 938 transitions. Word has length 116 [2022-07-21 11:05:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:21,190 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 938 transitions. [2022-07-21 11:05:21,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 11:05:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 938 transitions. [2022-07-21 11:05:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 11:05:21,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:21,192 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:21,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 11:05:21,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1915934418, now seen corresponding path program 1 times [2022-07-21 11:05:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:21,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172083205] [2022-07-21 11:05:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:05:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:05:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:05:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 11:05:21,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:21,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172083205] [2022-07-21 11:05:21,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172083205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:21,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:21,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:05:21,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832609704] [2022-07-21 11:05:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:21,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:05:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:05:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:05:21,325 INFO L87 Difference]: Start difference. First operand 668 states and 938 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 11:05:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:22,049 INFO L93 Difference]: Finished difference Result 1067 states and 1523 transitions. [2022-07-21 11:05:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:05:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 121 [2022-07-21 11:05:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:22,052 INFO L225 Difference]: With dead ends: 1067 [2022-07-21 11:05:22,052 INFO L226 Difference]: Without dead ends: 741 [2022-07-21 11:05:22,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:05:22,053 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 202 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:22,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1400 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:05:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-21 11:05:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2022-07-21 11:05:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 546 states have (on average 1.3736263736263736) internal successors, (750), 545 states have internal predecessors, (750), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-21 11:05:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2022-07-21 11:05:22,077 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 121 [2022-07-21 11:05:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:22,077 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2022-07-21 11:05:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 11:05:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2022-07-21 11:05:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 11:05:22,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:22,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 11:05:22,080 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1115994769, now seen corresponding path program 1 times [2022-07-21 11:05:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:22,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25601354] [2022-07-21 11:05:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:05:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:05:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 11:05:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 11:05:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:22,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25601354] [2022-07-21 11:05:22,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25601354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:22,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:22,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 11:05:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207658340] [2022-07-21 11:05:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:22,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 11:05:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 11:05:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:05:22,259 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 11:05:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:23,638 INFO L93 Difference]: Finished difference Result 1415 states and 2001 transitions. [2022-07-21 11:05:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 11:05:23,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2022-07-21 11:05:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:23,641 INFO L225 Difference]: With dead ends: 1415 [2022-07-21 11:05:23,641 INFO L226 Difference]: Without dead ends: 778 [2022-07-21 11:05:23,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2022-07-21 11:05:23,644 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 989 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:23,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1646 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 11:05:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-21 11:05:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 688. [2022-07-21 11:05:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 558 states have (on average 1.3620071684587813) internal successors, (760), 558 states have internal predecessors, (760), 88 states have call successors, (88), 33 states have call predecessors, (88), 41 states have return successors, (106), 96 states have call predecessors, (106), 87 states have call successors, (106) [2022-07-21 11:05:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 954 transitions. [2022-07-21 11:05:23,668 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 954 transitions. Word has length 123 [2022-07-21 11:05:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:23,669 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 954 transitions. [2022-07-21 11:05:23,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 11:05:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 954 transitions. [2022-07-21 11:05:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 11:05:23,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:23,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:23,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 11:05:23,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1527207652, now seen corresponding path program 1 times [2022-07-21 11:05:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:23,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069747225] [2022-07-21 11:05:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:05:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:05:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:05:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:23,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069747225] [2022-07-21 11:05:23,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069747225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:23,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:23,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:05:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100116742] [2022-07-21 11:05:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:23,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:05:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:05:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:05:23,823 INFO L87 Difference]: Start difference. First operand 688 states and 954 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:05:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:24,694 INFO L93 Difference]: Finished difference Result 1617 states and 2297 transitions. [2022-07-21 11:05:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:05:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2022-07-21 11:05:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:24,740 INFO L225 Difference]: With dead ends: 1617 [2022-07-21 11:05:24,740 INFO L226 Difference]: Without dead ends: 962 [2022-07-21 11:05:24,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:05:24,743 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 306 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:24,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1789 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 11:05:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-21 11:05:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 684. [2022-07-21 11:05:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 556 states have (on average 1.3597122302158273) internal successors, (756), 556 states have internal predecessors, (756), 86 states have call successors, (86), 33 states have call predecessors, (86), 41 states have return successors, (104), 94 states have call predecessors, (104), 85 states have call successors, (104) [2022-07-21 11:05:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 946 transitions. [2022-07-21 11:05:24,782 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 946 transitions. Word has length 139 [2022-07-21 11:05:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:24,782 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 946 transitions. [2022-07-21 11:05:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:05:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 946 transitions. [2022-07-21 11:05:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 11:05:24,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:24,785 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:05:24,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 11:05:24,785 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1475201316, now seen corresponding path program 1 times [2022-07-21 11:05:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688829506] [2022-07-21 11:05:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 11:05:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:05:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:05:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688829506] [2022-07-21 11:05:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688829506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:05:24,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:05:24,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:05:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713889411] [2022-07-21 11:05:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:24,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:05:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:24,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:05:24,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:05:24,983 INFO L87 Difference]: Start difference. First operand 684 states and 946 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 11:05:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:26,119 INFO L93 Difference]: Finished difference Result 1619 states and 2299 transitions. [2022-07-21 11:05:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:05:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 139 [2022-07-21 11:05:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:26,123 INFO L225 Difference]: With dead ends: 1619 [2022-07-21 11:05:26,123 INFO L226 Difference]: Without dead ends: 968 [2022-07-21 11:05:26,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:05:26,125 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 224 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:26,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2647 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:05:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-21 11:05:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 692. [2022-07-21 11:05:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 562 states have (on average 1.3629893238434163) internal successors, (766), 564 states have internal predecessors, (766), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 960 transitions. [2022-07-21 11:05:26,150 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 960 transitions. Word has length 139 [2022-07-21 11:05:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:26,150 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 960 transitions. [2022-07-21 11:05:26,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 11:05:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 960 transitions. [2022-07-21 11:05:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 11:05:26,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:26,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-21 11:05:26,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 11:05:26,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1269181933, now seen corresponding path program 1 times [2022-07-21 11:05:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:26,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255611652] [2022-07-21 11:05:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:05:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 11:05:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:05:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:26,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255611652] [2022-07-21 11:05:26,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255611652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:26,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509577034] [2022-07-21 11:05:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:26,392 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:05:26,397 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:05:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:26,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 11:05:26,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:05:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:26,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:05:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509577034] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:26,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:05:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 11 [2022-07-21 11:05:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222061278] [2022-07-21 11:05:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:05:26,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:05:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:05:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:05:26,911 INFO L87 Difference]: Start difference. First operand 692 states and 960 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:05:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:26,983 INFO L93 Difference]: Finished difference Result 1359 states and 1901 transitions. [2022-07-21 11:05:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:05:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2022-07-21 11:05:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:26,987 INFO L225 Difference]: With dead ends: 1359 [2022-07-21 11:05:26,987 INFO L226 Difference]: Without dead ends: 700 [2022-07-21 11:05:26,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:05:26,989 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 3 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:26,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 815 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:05:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-21 11:05:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2022-07-21 11:05:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 564 states have (on average 1.3617021276595744) internal successors, (768), 566 states have internal predecessors, (768), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2022-07-21 11:05:27,017 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 140 [2022-07-21 11:05:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:27,017 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2022-07-21 11:05:27,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 11:05:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2022-07-21 11:05:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 11:05:27,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:27,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-21 11:05:27,042 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:05:27,239 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,SelfDestructingSolverStorable14 [2022-07-21 11:05:27,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash 316514682, now seen corresponding path program 1 times [2022-07-21 11:05:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:27,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531014223] [2022-07-21 11:05:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:05:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:05:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 11:05:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531014223] [2022-07-21 11:05:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531014223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773913551] [2022-07-21 11:05:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:27,528 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:05:27,543 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:05:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:28,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:05:28,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:05:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:28,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:05:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:28,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773913551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:05:28,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:05:28,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2022-07-21 11:05:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780978099] [2022-07-21 11:05:28,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:05:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 11:05:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 11:05:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:05:28,320 INFO L87 Difference]: Start difference. First operand 694 states and 962 transitions. Second operand has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:29,693 INFO L93 Difference]: Finished difference Result 1641 states and 2331 transitions. [2022-07-21 11:05:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 11:05:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2022-07-21 11:05:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:29,698 INFO L225 Difference]: With dead ends: 1641 [2022-07-21 11:05:29,698 INFO L226 Difference]: Without dead ends: 980 [2022-07-21 11:05:29,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-21 11:05:29,700 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 398 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:29,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 4052 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 11:05:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-07-21 11:05:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 698. [2022-07-21 11:05:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 568 states have (on average 1.3626760563380282) internal successors, (774), 570 states have internal predecessors, (774), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2022-07-21 11:05:29,753 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 141 [2022-07-21 11:05:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:29,754 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2022-07-21 11:05:29,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2022-07-21 11:05:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-21 11:05:29,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:29,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-21 11:05:29,777 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:05:29,971 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,SelfDestructingSolverStorable15 [2022-07-21 11:05:29,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 558897227, now seen corresponding path program 2 times [2022-07-21 11:05:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:29,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93719314] [2022-07-21 11:05:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:05:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:05:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 11:05:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93719314] [2022-07-21 11:05:30,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93719314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808576926] [2022-07-21 11:05:30,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:05:30,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:30,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:30,226 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:05:30,256 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:05:31,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:05:31,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:05:31,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:05:31,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:05:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:31,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:05:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808576926] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:05:31,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:05:31,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2022-07-21 11:05:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165487187] [2022-07-21 11:05:31,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:05:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 11:05:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 11:05:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:05:31,383 INFO L87 Difference]: Start difference. First operand 698 states and 968 transitions. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:32,886 INFO L93 Difference]: Finished difference Result 1655 states and 2353 transitions. [2022-07-21 11:05:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 11:05:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2022-07-21 11:05:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:32,890 INFO L225 Difference]: With dead ends: 1655 [2022-07-21 11:05:32,890 INFO L226 Difference]: Without dead ends: 990 [2022-07-21 11:05:32,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-07-21 11:05:32,892 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 378 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4932 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:32,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4932 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 11:05:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-21 11:05:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 700. [2022-07-21 11:05:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 570 states have (on average 1.3649122807017544) internal successors, (778), 572 states have internal predecessors, (778), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 972 transitions. [2022-07-21 11:05:32,922 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 972 transitions. Word has length 142 [2022-07-21 11:05:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 972 transitions. [2022-07-21 11:05:32,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 972 transitions. [2022-07-21 11:05:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 11:05:32,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:32,924 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-21 11:05:32,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 11:05:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:33,148 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash -517178470, now seen corresponding path program 3 times [2022-07-21 11:05:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:33,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880021250] [2022-07-21 11:05:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 11:05:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 11:05:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:05:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:33,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880021250] [2022-07-21 11:05:33,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880021250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:33,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744427797] [2022-07-21 11:05:33,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 11:05:33,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:33,557 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:05:33,590 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:05:42,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 11:05:42,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:05:42,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 11:05:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:05:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:42,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:05:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:43,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744427797] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:05:43,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:05:43,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2022-07-21 11:05:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20569147] [2022-07-21 11:05:43,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:05:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 11:05:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 11:05:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-21 11:05:43,152 INFO L87 Difference]: Start difference. First operand 700 states and 972 transitions. Second operand has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:45,541 INFO L93 Difference]: Finished difference Result 1667 states and 2373 transitions. [2022-07-21 11:05:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 11:05:45,541 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2022-07-21 11:05:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:45,544 INFO L225 Difference]: With dead ends: 1667 [2022-07-21 11:05:45,545 INFO L226 Difference]: Without dead ends: 1000 [2022-07-21 11:05:45,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2022-07-21 11:05:45,546 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 322 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:45,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 5003 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 11:05:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-07-21 11:05:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 702. [2022-07-21 11:05:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 572 states have (on average 1.367132867132867) internal successors, (782), 574 states have internal predecessors, (782), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 976 transitions. [2022-07-21 11:05:45,576 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 976 transitions. Word has length 143 [2022-07-21 11:05:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:45,576 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 976 transitions. [2022-07-21 11:05:45,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 976 transitions. [2022-07-21 11:05:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 11:05:45,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:45,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-07-21 11:05:45,605 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:05:45,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 11:05:45,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 484213291, now seen corresponding path program 4 times [2022-07-21 11:05:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:45,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676168900] [2022-07-21 11:05:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 11:05:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:05:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:05:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676168900] [2022-07-21 11:05:46,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676168900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705772754] [2022-07-21 11:05:46,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 11:05:46,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:46,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:46,214 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:05:46,215 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:05:48,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 11:05:48,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:05:48,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 11:05:48,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:05:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 11:05:48,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:05:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705772754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:05:48,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:05:48,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2022-07-21 11:05:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450853396] [2022-07-21 11:05:48,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:05:48,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 11:05:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:05:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 11:05:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2022-07-21 11:05:48,881 INFO L87 Difference]: Start difference. First operand 702 states and 976 transitions. Second operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:05:52,011 INFO L93 Difference]: Finished difference Result 1681 states and 2397 transitions. [2022-07-21 11:05:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 11:05:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2022-07-21 11:05:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:05:52,015 INFO L225 Difference]: With dead ends: 1681 [2022-07-21 11:05:52,015 INFO L226 Difference]: Without dead ends: 1012 [2022-07-21 11:05:52,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 295 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 11:05:52,017 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 476 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 6259 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:05:52,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 6259 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1826 Invalid, 0 Unknown, 3 Unchecked, 2.3s Time] [2022-07-21 11:05:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-07-21 11:05:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 704. [2022-07-21 11:05:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 576 states have internal predecessors, (786), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-21 11:05:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 980 transitions. [2022-07-21 11:05:52,050 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 980 transitions. Word has length 144 [2022-07-21 11:05:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:05:52,050 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 980 transitions. [2022-07-21 11:05:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 11:05:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 980 transitions. [2022-07-21 11:05:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 11:05:52,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:05:52,052 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2022-07-21 11:05:52,081 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:05:52,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:52,269 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:05:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:05:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1462586810, now seen corresponding path program 5 times [2022-07-21 11:05:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:05:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518166419] [2022-07-21 11:05:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:05:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:05:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:05:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 11:05:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 11:05:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 11:05:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 11:05:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:05:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:05:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 11:05:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 11:05:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:05:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:05:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:05:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:05:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 11:05:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:05:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518166419] [2022-07-21 11:05:52,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518166419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:05:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507400003] [2022-07-21 11:05:52,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 11:05:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:05:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:05:52,645 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:05:52,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process