./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 0f8a17c6 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.1-dev-0f8a17c [2021-11-17 00:42:08,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:42:08,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:42:08,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:42:08,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:42:08,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:42:08,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:42:08,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:42:08,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:42:08,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:42:08,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:42:08,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:42:08,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:42:08,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:42:08,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:42:08,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:42:08,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:42:08,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:42:08,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:42:08,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:42:08,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:42:08,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:42:08,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:42:08,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:42:08,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:42:08,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:42:08,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:42:08,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:42:08,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:42:08,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:42:08,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:42:08,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:42:08,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:42:08,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:42:08,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:42:08,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:42:08,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:42:08,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:42:08,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:42:08,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:42:08,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:42:08,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 00:42:08,240 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:42:08,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:42:08,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:42:08,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:42:08,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:42:08,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:42:08,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:42:08,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:42:08,242 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:42:08,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:42:08,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:42:08,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:42:08,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:42:08,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:42:08,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:42:08,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:42:08,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:42:08,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:42:08,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:42:08,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:42:08,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:42:08,246 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 [2021-11-17 00:42:08,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:42:08,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:42:08,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:42:08,439 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:42:08,440 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:42:08,440 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 [2021-11-17 00:42:08,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84eaa28bb/a3dee1f021a14de4a36ea1026f457b0b/FLAG9faa813f1 [2021-11-17 00:42:09,032 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:42:09,033 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 [2021-11-17 00:42:09,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84eaa28bb/a3dee1f021a14de4a36ea1026f457b0b/FLAG9faa813f1 [2021-11-17 00:42:09,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84eaa28bb/a3dee1f021a14de4a36ea1026f457b0b [2021-11-17 00:42:09,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:42:09,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:42:09,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:42:09,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:42:09,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:42:09,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:09" (1/1) ... [2021-11-17 00:42:09,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620043fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:09, skipping insertion in model container [2021-11-17 00:42:09,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:09" (1/1) ... [2021-11-17 00:42:09,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:42:09,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:42:09,719 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] [2021-11-17 00:42:09,836 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:42:09,846 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:42:09,967 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] [2021-11-17 00:42:10,083 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:42:10,103 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:42:10,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10 WrapperNode [2021-11-17 00:42:10,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:42:10,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:42:10,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:42:10,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:42:10,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,204 INFO L137 Inliner]: procedures = 88, calls = 403, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1032 [2021-11-17 00:42:10,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:42:10,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:42:10,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:42:10,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:42:10,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:42:10,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:42:10,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:42:10,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:42:10,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (1/1) ... [2021-11-17 00:42:10,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:42:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:42:10,349 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) [2021-11-17 00:42:10,351 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 [2021-11-17 00:42:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2021-11-17 00:42:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2021-11-17 00:42:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:42:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2021-11-17 00:42:10,380 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2021-11-17 00:42:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 00:42:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:42:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:42:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:42:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:42:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:42:10,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:42:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:42:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:42:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-11-17 00:42:10,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-11-17 00:42:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:42:10,382 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:42:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:42:10,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:42:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2021-11-17 00:42:10,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2021-11-17 00:42:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:42:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:42:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:42:10,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:42:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2021-11-17 00:42:10,383 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2021-11-17 00:42:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-11-17 00:42:10,384 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-11-17 00:42:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:42:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:42:10,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:42:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-17 00:42:10,384 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-17 00:42:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:42:10,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:42:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:42:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:42:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2021-11-17 00:42:10,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2021-11-17 00:42:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 00:42:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:42:10,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:42:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2021-11-17 00:42:10,386 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2021-11-17 00:42:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:42:10,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:42:10,609 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:42:10,610 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:42:10,772 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:42:11,309 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:42:11,315 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:42:11,315 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-17 00:42:11,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:42:11 BoogieIcfgContainer [2021-11-17 00:42:11,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:42:11,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:42:11,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:42:11,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:42:11,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:42:09" (1/3) ... [2021-11-17 00:42:11,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736edb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:11, skipping insertion in model container [2021-11-17 00:42:11,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:10" (2/3) ... [2021-11-17 00:42:11,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736edb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:11, skipping insertion in model container [2021-11-17 00:42:11,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:42:11" (3/3) ... [2021-11-17 00:42:11,333 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 [2021-11-17 00:42:11,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:42:11,337 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:42:11,366 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:42:11,370 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 00:42:11,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:42:11,385 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) [2021-11-17 00:42:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-17 00:42:11,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:11,390 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:11,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 722424881, now seen corresponding path program 1 times [2021-11-17 00:42:11,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:11,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551087516] [2021-11-17 00:42:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:11,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 00:42:11,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:11,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551087516] [2021-11-17 00:42:11,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551087516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:11,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:11,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:42:11,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128331043] [2021-11-17 00:42:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:11,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:42:11,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:11,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:42:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:42:11,688 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) [2021-11-17 00:42:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:12,404 INFO L93 Difference]: Finished difference Result 947 states and 1418 transitions. [2021-11-17 00:42:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:42:12,406 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 [2021-11-17 00:42:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:12,421 INFO L225 Difference]: With dead ends: 947 [2021-11-17 00:42:12,421 INFO L226 Difference]: Without dead ends: 633 [2021-11-17 00:42:12,425 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:12,428 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 503 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:12,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1066 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:42:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-11-17 00:42:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2021-11-17 00:42:12,487 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) [2021-11-17 00:42:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2021-11-17 00:42:12,490 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 25 [2021-11-17 00:42:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:12,491 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2021-11-17 00:42:12,491 INFO L471 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) [2021-11-17 00:42:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2021-11-17 00:42:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-17 00:42:12,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:12,492 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:12,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:42:12,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1364109622, now seen corresponding path program 1 times [2021-11-17 00:42:12,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:12,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947817294] [2021-11-17 00:42:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:12,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 00:42:12,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:12,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947817294] [2021-11-17 00:42:12,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947817294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:12,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:12,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:42:12,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631657409] [2021-11-17 00:42:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:12,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:42:12,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:42:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:42:12,598 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) [2021-11-17 00:42:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:13,267 INFO L93 Difference]: Finished difference Result 1189 states and 1695 transitions. [2021-11-17 00:42:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:42:13,268 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 [2021-11-17 00:42:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:13,272 INFO L225 Difference]: With dead ends: 1189 [2021-11-17 00:42:13,272 INFO L226 Difference]: Without dead ends: 632 [2021-11-17 00:42:13,273 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:13,274 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 701 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:13,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 1350 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:42:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-11-17 00:42:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 564. [2021-11-17 00:42:13,300 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) [2021-11-17 00:42:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 797 transitions. [2021-11-17 00:42:13,303 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 797 transitions. Word has length 29 [2021-11-17 00:42:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:13,303 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 797 transitions. [2021-11-17 00:42:13,303 INFO L471 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) [2021-11-17 00:42:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 797 transitions. [2021-11-17 00:42:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-17 00:42:13,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:13,306 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:13,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:42:13,306 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2094845703, now seen corresponding path program 1 times [2021-11-17 00:42:13,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:13,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425582162] [2021-11-17 00:42:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:13,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 00:42:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:42:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-17 00:42:13,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:13,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425582162] [2021-11-17 00:42:13,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425582162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:13,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:13,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:42:13,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989639978] [2021-11-17 00:42:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:13,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:42:13,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:13,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:42:13,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:42:13,390 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) [2021-11-17 00:42:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:14,022 INFO L93 Difference]: Finished difference Result 1799 states and 2590 transitions. [2021-11-17 00:42:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:42:14,023 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 [2021-11-17 00:42:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:14,028 INFO L225 Difference]: With dead ends: 1799 [2021-11-17 00:42:14,028 INFO L226 Difference]: Without dead ends: 1238 [2021-11-17 00:42:14,029 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:14,030 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 491 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:14,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 1891 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:42:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2021-11-17 00:42:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1138. [2021-11-17 00:42:14,063 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) [2021-11-17 00:42:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2021-11-17 00:42:14,068 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 50 [2021-11-17 00:42:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:14,068 INFO L470 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2021-11-17 00:42:14,068 INFO L471 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) [2021-11-17 00:42:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2021-11-17 00:42:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-17 00:42:14,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:14,075 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:14,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:42:14,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1094727353, now seen corresponding path program 1 times [2021-11-17 00:42:14,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:14,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81904114] [2021-11-17 00:42:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:14,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:42:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:42:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 00:42:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:42:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-17 00:42:14,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:14,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81904114] [2021-11-17 00:42:14,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81904114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:14,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:14,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:42:14,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578752273] [2021-11-17 00:42:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:14,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:42:14,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:42:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:42:14,160 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) [2021-11-17 00:42:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:14,763 INFO L93 Difference]: Finished difference Result 1832 states and 2618 transitions. [2021-11-17 00:42:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:42:14,764 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 [2021-11-17 00:42:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:14,767 INFO L225 Difference]: With dead ends: 1832 [2021-11-17 00:42:14,767 INFO L226 Difference]: Without dead ends: 702 [2021-11-17 00:42:14,769 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:14,770 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:14,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1140 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:42:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-11-17 00:42:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 642. [2021-11-17 00:42:14,812 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) [2021-11-17 00:42:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 910 transitions. [2021-11-17 00:42:14,814 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 910 transitions. Word has length 97 [2021-11-17 00:42:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:14,814 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 910 transitions. [2021-11-17 00:42:14,815 INFO L471 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) [2021-11-17 00:42:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 910 transitions. [2021-11-17 00:42:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-17 00:42:14,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:14,817 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:14,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:42:14,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -660311895, now seen corresponding path program 2 times [2021-11-17 00:42:14,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:14,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639441854] [2021-11-17 00:42:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:14,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 00:42:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:42:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:42:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:42:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-17 00:42:14,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:14,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639441854] [2021-11-17 00:42:14,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639441854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:14,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:14,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 00:42:14,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081589293] [2021-11-17 00:42:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:14,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:42:14,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:42:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:42:14,970 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) [2021-11-17 00:42:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:15,542 INFO L93 Difference]: Finished difference Result 1294 states and 1865 transitions. [2021-11-17 00:42:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:42:15,543 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 [2021-11-17 00:42:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:15,545 INFO L225 Difference]: With dead ends: 1294 [2021-11-17 00:42:15,546 INFO L226 Difference]: Without dead ends: 684 [2021-11-17 00:42:15,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:42:15,548 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 101 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:15,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 2435 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:42:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-11-17 00:42:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 642. [2021-11-17 00:42:15,564 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) [2021-11-17 00:42:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 908 transitions. [2021-11-17 00:42:15,566 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 908 transitions. Word has length 97 [2021-11-17 00:42:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:15,566 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 908 transitions. [2021-11-17 00:42:15,567 INFO L471 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) [2021-11-17 00:42:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 908 transitions. [2021-11-17 00:42:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-17 00:42:15,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:15,568 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:15,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:42:15,569 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1628559102, now seen corresponding path program 1 times [2021-11-17 00:42:15,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:15,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499581634] [2021-11-17 00:42:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:15,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 00:42:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:42:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:42:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 00:42:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-17 00:42:15,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:15,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499581634] [2021-11-17 00:42:15,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499581634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:15,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:15,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-17 00:42:15,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800342594] [2021-11-17 00:42:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:15,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 00:42:15,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:15,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 00:42:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:42:15,754 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) [2021-11-17 00:42:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:16,351 INFO L93 Difference]: Finished difference Result 1292 states and 1853 transitions. [2021-11-17 00:42:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 00:42:16,351 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 [2021-11-17 00:42:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:16,354 INFO L225 Difference]: With dead ends: 1292 [2021-11-17 00:42:16,354 INFO L226 Difference]: Without dead ends: 682 [2021-11-17 00:42:16,356 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:16,356 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 113 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:16,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 3559 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 00:42:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-11-17 00:42:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2021-11-17 00:42:16,371 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) [2021-11-17 00:42:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 910 transitions. [2021-11-17 00:42:16,373 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 910 transitions. Word has length 109 [2021-11-17 00:42:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:16,374 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 910 transitions. [2021-11-17 00:42:16,374 INFO L471 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) [2021-11-17 00:42:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 910 transitions. [2021-11-17 00:42:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-17 00:42:16,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:16,376 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:16,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:42:16,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -807563758, now seen corresponding path program 1 times [2021-11-17 00:42:16,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:16,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013717392] [2021-11-17 00:42:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:16,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-17 00:42:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 00:42:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 00:42:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:42:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-17 00:42:16,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:16,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013717392] [2021-11-17 00:42:16,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013717392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:16,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:16,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:42:16,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930253226] [2021-11-17 00:42:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:16,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:42:16,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:42:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:42:16,506 INFO L87 Difference]: Start difference. First operand 646 states and 910 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2021-11-17 00:42:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:16,904 INFO L93 Difference]: Finished difference Result 1347 states and 1922 transitions. [2021-11-17 00:42:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:42:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 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 110 [2021-11-17 00:42:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:16,907 INFO L225 Difference]: With dead ends: 1347 [2021-11-17 00:42:16,907 INFO L226 Difference]: Without dead ends: 719 [2021-11-17 00:42:16,909 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:16,909 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 140 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:16,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 1246 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:42:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-11-17 00:42:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 647. [2021-11-17 00:42:16,923 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) [2021-11-17 00:42:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2021-11-17 00:42:16,925 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 110 [2021-11-17 00:42:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:16,925 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2021-11-17 00:42:16,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2021-11-17 00:42:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2021-11-17 00:42:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-17 00:42:16,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:16,927 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:16,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 00:42:16,927 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -363635253, now seen corresponding path program 1 times [2021-11-17 00:42:16,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:16,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359038189] [2021-11-17 00:42:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:16,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-17 00:42:17,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:17,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359038189] [2021-11-17 00:42:17,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359038189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:17,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:17,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:42:17,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839978598] [2021-11-17 00:42:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:17,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:42:17,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:42:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:42:17,078 INFO L87 Difference]: Start difference. First operand 647 states and 911 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) [2021-11-17 00:42:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:18,092 INFO L93 Difference]: Finished difference Result 1503 states and 2175 transitions. [2021-11-17 00:42:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:42:18,092 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 [2021-11-17 00:42:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:18,096 INFO L225 Difference]: With dead ends: 1503 [2021-11-17 00:42:18,096 INFO L226 Difference]: Without dead ends: 889 [2021-11-17 00:42:18,097 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:18,097 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 270 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:18,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 1942 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-17 00:42:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-11-17 00:42:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 655. [2021-11-17 00:42:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 535 states have internal predecessors, (737), 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) [2021-11-17 00:42:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 923 transitions. [2021-11-17 00:42:18,115 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 923 transitions. Word has length 116 [2021-11-17 00:42:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:18,115 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 923 transitions. [2021-11-17 00:42:18,115 INFO L471 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) [2021-11-17 00:42:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 923 transitions. [2021-11-17 00:42:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-17 00:42:18,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:18,117 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:18,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 00:42:18,117 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1428826331, now seen corresponding path program 1 times [2021-11-17 00:42:18,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:18,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108413334] [2021-11-17 00:42:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:18,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 00:42:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-17 00:42:18,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:18,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108413334] [2021-11-17 00:42:18,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108413334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:18,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:18,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-17 00:42:18,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489457899] [2021-11-17 00:42:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:18,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-17 00:42:18,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-17 00:42:18,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-11-17 00:42:18,498 INFO L87 Difference]: Start difference. First operand 655 states and 923 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) [2021-11-17 00:42:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:19,573 INFO L93 Difference]: Finished difference Result 1583 states and 2300 transitions. [2021-11-17 00:42:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-17 00:42:19,574 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 [2021-11-17 00:42:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:19,577 INFO L225 Difference]: With dead ends: 1583 [2021-11-17 00:42:19,577 INFO L226 Difference]: Without dead ends: 961 [2021-11-17 00:42:19,579 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:19,579 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 242 mSDsluCounter, 7316 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 7872 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:19,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 7872 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 00:42:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-11-17 00:42:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 664. [2021-11-17 00:42:19,599 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) [2021-11-17 00:42:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 934 transitions. [2021-11-17 00:42:19,601 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 934 transitions. Word has length 111 [2021-11-17 00:42:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:19,601 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 934 transitions. [2021-11-17 00:42:19,601 INFO L471 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) [2021-11-17 00:42:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 934 transitions. [2021-11-17 00:42:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-17 00:42:19,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:19,603 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:19,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 00:42:19,603 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -161811319, now seen corresponding path program 1 times [2021-11-17 00:42:19,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:19,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692022069] [2021-11-17 00:42:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:19,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-17 00:42:20,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:20,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692022069] [2021-11-17 00:42:20,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692022069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:20,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:20,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-17 00:42:20,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008716403] [2021-11-17 00:42:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:20,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-17 00:42:20,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-17 00:42:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-11-17 00:42:20,131 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) [2021-11-17 00:42:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:21,159 INFO L93 Difference]: Finished difference Result 1386 states and 1981 transitions. [2021-11-17 00:42:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-17 00:42:21,160 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 [2021-11-17 00:42:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:21,163 INFO L225 Difference]: With dead ends: 1386 [2021-11-17 00:42:21,163 INFO L226 Difference]: Without dead ends: 755 [2021-11-17 00:42:21,165 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:21,165 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 162 mSDsluCounter, 5755 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 6167 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:21,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 6167 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:42:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-11-17 00:42:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 668. [2021-11-17 00:42: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) [2021-11-17 00:42:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 938 transitions. [2021-11-17 00:42:21,189 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 938 transitions. Word has length 116 [2021-11-17 00:42:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:21,189 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 938 transitions. [2021-11-17 00:42:21,189 INFO L471 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) [2021-11-17 00:42:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 938 transitions. [2021-11-17 00:42:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-17 00:42:21,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:21,191 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:21,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 00:42:21,191 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1915934418, now seen corresponding path program 1 times [2021-11-17 00:42:21,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:21,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418536774] [2021-11-17 00:42:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:21,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:42:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 00:42:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:42:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 00:42:21,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:21,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418536774] [2021-11-17 00:42:21,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418536774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:21,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:21,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:42:21,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901939248] [2021-11-17 00:42:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:21,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:42:21,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:42:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:42:21,350 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) [2021-11-17 00:42:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:22,016 INFO L93 Difference]: Finished difference Result 1067 states and 1523 transitions. [2021-11-17 00:42:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:42:22,017 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 [2021-11-17 00:42:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:22,020 INFO L225 Difference]: With dead ends: 1067 [2021-11-17 00:42:22,021 INFO L226 Difference]: Without dead ends: 741 [2021-11-17 00:42:22,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:42:22,022 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 202 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:22,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1438 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:42:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-11-17 00:42:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2021-11-17 00:42:22,074 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) [2021-11-17 00:42:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2021-11-17 00:42:22,076 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 121 [2021-11-17 00:42:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:22,077 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2021-11-17 00:42:22,077 INFO L471 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) [2021-11-17 00:42:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2021-11-17 00:42:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-17 00:42:22,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:22,078 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:22,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 00:42:22,079 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1115994769, now seen corresponding path program 1 times [2021-11-17 00:42:22,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:22,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910177512] [2021-11-17 00:42:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:22,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:42:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 00:42:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-17 00:42:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-17 00:42:22,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:22,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910177512] [2021-11-17 00:42:22,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910177512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:22,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:22,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-17 00:42:22,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742431660] [2021-11-17 00:42:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:22,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 00:42:22,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 00:42:22,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:42:22,269 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) [2021-11-17 00:42:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:23,928 INFO L93 Difference]: Finished difference Result 1415 states and 2001 transitions. [2021-11-17 00:42:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-17 00:42:23,929 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 [2021-11-17 00:42:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:23,932 INFO L225 Difference]: With dead ends: 1415 [2021-11-17 00:42:23,932 INFO L226 Difference]: Without dead ends: 778 [2021-11-17 00:42:23,933 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:23,934 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 793 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:23,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [829 Valid, 2502 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 00:42:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-11-17 00:42:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 688. [2021-11-17 00:42:23,951 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) [2021-11-17 00:42:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 954 transitions. [2021-11-17 00:42:23,953 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 954 transitions. Word has length 123 [2021-11-17 00:42:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:23,953 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 954 transitions. [2021-11-17 00:42:23,953 INFO L471 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) [2021-11-17 00:42:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 954 transitions. [2021-11-17 00:42:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-17 00:42:23,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:23,955 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:23,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 00:42:23,955 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1527207652, now seen corresponding path program 1 times [2021-11-17 00:42:23,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:23,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209384176] [2021-11-17 00:42:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:23,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:42:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 00:42:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 00:42:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-17 00:42:24,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:24,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209384176] [2021-11-17 00:42:24,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209384176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:24,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:24,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:42:24,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923717668] [2021-11-17 00:42:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:24,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:42:24,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:24,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:42:24,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:42:24,078 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) [2021-11-17 00:42:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:24,854 INFO L93 Difference]: Finished difference Result 1617 states and 2297 transitions. [2021-11-17 00:42:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:42:24,855 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 [2021-11-17 00:42:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:24,858 INFO L225 Difference]: With dead ends: 1617 [2021-11-17 00:42:24,858 INFO L226 Difference]: Without dead ends: 962 [2021-11-17 00:42:24,860 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:24,860 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 215 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:24,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1802 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-17 00:42:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-11-17 00:42:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 684. [2021-11-17 00:42:24,880 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) [2021-11-17 00:42:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 946 transitions. [2021-11-17 00:42:24,884 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 946 transitions. Word has length 139 [2021-11-17 00:42:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:24,884 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 946 transitions. [2021-11-17 00:42:24,884 INFO L471 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) [2021-11-17 00:42:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 946 transitions. [2021-11-17 00:42:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-17 00:42:24,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:24,886 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:24,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 00:42:24,886 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1475201316, now seen corresponding path program 1 times [2021-11-17 00:42:24,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:24,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284983500] [2021-11-17 00:42:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:24,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 00:42:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 00:42:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 00:42:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-17 00:42:25,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:25,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284983500] [2021-11-17 00:42:25,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284983500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:25,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:25,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 00:42:25,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061990650] [2021-11-17 00:42:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:25,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:42:25,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:42:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:42:25,113 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) [2021-11-17 00:42:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:25,956 INFO L93 Difference]: Finished difference Result 1619 states and 2299 transitions. [2021-11-17 00:42:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:42:25,957 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 [2021-11-17 00:42:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:25,961 INFO L225 Difference]: With dead ends: 1619 [2021-11-17 00:42:25,961 INFO L226 Difference]: Without dead ends: 968 [2021-11-17 00:42:25,962 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:25,963 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 315 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:25,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 2774 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 00:42:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-11-17 00:42:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 692. [2021-11-17 00:42:25,985 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) [2021-11-17 00:42:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 960 transitions. [2021-11-17 00:42:25,986 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 960 transitions. Word has length 139 [2021-11-17 00:42:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:25,987 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 960 transitions. [2021-11-17 00:42:25,987 INFO L471 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) [2021-11-17 00:42:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 960 transitions. [2021-11-17 00:42:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 00:42:25,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:25,989 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:25,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 00:42:25,990 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:25,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1269181933, now seen corresponding path program 1 times [2021-11-17 00:42:25,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:25,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348926416] [2021-11-17 00:42:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:25,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 00:42:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-17 00:42:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 00:42:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-17 00:42:26,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:26,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348926416] [2021-11-17 00:42:26,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348926416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:42:26,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:42:26,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:42:26,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138588288] [2021-11-17 00:42:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:42:26,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:42:26,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:42:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:42:26,157 INFO L87 Difference]: Start difference. First operand 692 states and 960 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:42:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:26,853 INFO L93 Difference]: Finished difference Result 1429 states and 2007 transitions. [2021-11-17 00:42:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:42:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 6 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 [2021-11-17 00:42:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:26,856 INFO L225 Difference]: With dead ends: 1429 [2021-11-17 00:42:26,856 INFO L226 Difference]: Without dead ends: 770 [2021-11-17 00:42:26,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:42:26,858 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 151 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:26,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1767 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 00:42:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-11-17 00:42:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 694. [2021-11-17 00:42:26,875 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) [2021-11-17 00:42:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2021-11-17 00:42:26,876 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 140 [2021-11-17 00:42:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:26,877 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2021-11-17 00:42:26,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:42:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2021-11-17 00:42:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-17 00:42:26,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:26,878 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:26,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 00:42:26,879 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 316514682, now seen corresponding path program 1 times [2021-11-17 00:42:26,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:26,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288742967] [2021-11-17 00:42:26,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:26,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-17 00:42:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 00:42:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 00:42:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:27,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:27,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288742967] [2021-11-17 00:42:27,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288742967] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:42:27,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645635837] [2021-11-17 00:42:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:27,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:42:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:42:27,139 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) [2021-11-17 00:42:27,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 00:42:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:27,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-17 00:42:27,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:42:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:27,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:42:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:28,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645635837] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:42:28,283 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:42:28,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2021-11-17 00:42:28,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907028485] [2021-11-17 00:42:28,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:42:28,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 00:42:28,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:28,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 00:42:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:42:28,285 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) [2021-11-17 00:42:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:29,295 INFO L93 Difference]: Finished difference Result 1641 states and 2331 transitions. [2021-11-17 00:42:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 00:42:29,295 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 [2021-11-17 00:42:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:29,298 INFO L225 Difference]: With dead ends: 1641 [2021-11-17 00:42:29,298 INFO L226 Difference]: Without dead ends: 980 [2021-11-17 00:42:29,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-11-17 00:42:29,300 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 388 mSDsluCounter, 3793 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:29,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 4309 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 00:42:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-11-17 00:42:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 698. [2021-11-17 00:42:29,320 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) [2021-11-17 00:42:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2021-11-17 00:42:29,321 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 141 [2021-11-17 00:42:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:29,322 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2021-11-17 00:42:29,322 INFO L471 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) [2021-11-17 00:42:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2021-11-17 00:42:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-17 00:42:29,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:29,324 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:29,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 00:42:29,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-17 00:42:29,543 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash 558897227, now seen corresponding path program 2 times [2021-11-17 00:42:29,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:29,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631431996] [2021-11-17 00:42:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:29,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 00:42:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:42:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-17 00:42:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:29,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:29,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631431996] [2021-11-17 00:42:29,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631431996] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:42:29,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822339328] [2021-11-17 00:42:29,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:42:29,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:42:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:42:29,861 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) [2021-11-17 00:42:29,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 00:42:32,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 00:42:32,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:42:32,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 00:42:32,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:42:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:32,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:42:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:33,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822339328] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:42:33,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:42:33,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2021-11-17 00:42:33,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679129216] [2021-11-17 00:42:33,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:42:33,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-17 00:42:33,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:42:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-17 00:42:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-17 00:42:33,132 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) [2021-11-17 00:42:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:42:34,480 INFO L93 Difference]: Finished difference Result 1655 states and 2353 transitions. [2021-11-17 00:42:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 00:42:34,480 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 [2021-11-17 00:42:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:42:34,484 INFO L225 Difference]: With dead ends: 1655 [2021-11-17 00:42:34,485 INFO L226 Difference]: Without dead ends: 990 [2021-11-17 00:42:34,486 INFO L932 BasicCegarLoop]: 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 [2021-11-17 00:42:34,487 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 296 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:42:34,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 4541 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:42:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2021-11-17 00:42:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 700. [2021-11-17 00:42:34,528 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) [2021-11-17 00:42:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 972 transitions. [2021-11-17 00:42:34,529 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 972 transitions. Word has length 142 [2021-11-17 00:42:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:42:34,529 INFO L470 AbstractCegarLoop]: Abstraction has 700 states and 972 transitions. [2021-11-17 00:42:34,529 INFO L471 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) [2021-11-17 00:42:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 972 transitions. [2021-11-17 00:42:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-17 00:42:34,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:42:34,531 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:42:34,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-17 00:42:34,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-17 00:42:34,742 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:42:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:42:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash -517178470, now seen corresponding path program 3 times [2021-11-17 00:42:34,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:42:34,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371775274] [2021-11-17 00:42:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:42:34,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:42:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:42:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:42:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:42:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:42:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:42:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:42:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:42:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:42:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:42:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 00:42:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:42:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:42:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:42:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:42:35,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:42:35,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371775274] [2021-11-17 00:42:35,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371775274] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:42:35,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316299609] [2021-11-17 00:42:35,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-17 00:42:35,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:42:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:42:35,035 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) [2021-11-17 00:42:35,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 00:43:00,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-17 00:43:00,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:43:00,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-17 00:43:00,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:43:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:43:00,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:43:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:43:01,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316299609] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:43:01,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:43:01,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2021-11-17 00:43:01,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489958744] [2021-11-17 00:43:01,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:43:01,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-17 00:43:01,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:43:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-17 00:43:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-17 00:43:01,151 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) [2021-11-17 00:43:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:43:02,740 INFO L93 Difference]: Finished difference Result 1667 states and 2373 transitions. [2021-11-17 00:43:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 00:43:02,741 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 [2021-11-17 00:43:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:43:02,744 INFO L225 Difference]: With dead ends: 1667 [2021-11-17 00:43:02,744 INFO L226 Difference]: Without dead ends: 1000 [2021-11-17 00:43:02,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2021-11-17 00:43:02,746 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 511 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 5639 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:43:02,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 5639 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 00:43:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2021-11-17 00:43:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 702. [2021-11-17 00:43:02,768 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) [2021-11-17 00:43:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 976 transitions. [2021-11-17 00:43:02,769 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 976 transitions. Word has length 143 [2021-11-17 00:43:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:43:02,769 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 976 transitions. [2021-11-17 00:43:02,770 INFO L471 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) [2021-11-17 00:43:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 976 transitions. [2021-11-17 00:43:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-17 00:43:02,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:43:02,771 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:43:02,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-17 00:43:02,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-17 00:43:02,984 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:43:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:43:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 484213291, now seen corresponding path program 4 times [2021-11-17 00:43:02,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:43:02,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930597187] [2021-11-17 00:43:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:43:02,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:43:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:43:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:43:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:43:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:43:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:43:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:43:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:43:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:43:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:43:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:43:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 00:43:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 00:43:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 00:43:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:43:03,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:43:03,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930597187] [2021-11-17 00:43:03,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930597187] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:43:03,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937093769] [2021-11-17 00:43:03,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-17 00:43:03,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:43:03,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:43:03,255 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) [2021-11-17 00:43:03,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 00:43:04,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-17 00:43:04,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:43:04,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-17 00:43:04,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:43:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-17 00:43:05,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:43:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:43:06,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937093769] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:43:06,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:43:06,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2021-11-17 00:43:06,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607893659] [2021-11-17 00:43:06,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:43:06,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-17 00:43:06,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:43:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-17 00:43:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-11-17 00:43:06,552 INFO L87 Difference]: Start difference. First operand 702 states and 976 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 20 states have internal predecessors, (133), 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) [2021-11-17 00:43:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:43:11,545 INFO L93 Difference]: Finished difference Result 1679 states and 2393 transitions. [2021-11-17 00:43:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-17 00:43:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 20 states have internal predecessors, (133), 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 [2021-11-17 00:43:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:43:11,550 INFO L225 Difference]: With dead ends: 1679 [2021-11-17 00:43:11,550 INFO L226 Difference]: Without dead ends: 1010 [2021-11-17 00:43:11,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 296 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2021-11-17 00:43:11,552 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 739 mSDsluCounter, 7589 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 8103 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:43:11,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [790 Valid, 8103 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-17 00:43:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-11-17 00:43:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 704. [2021-11-17 00:43:11,578 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) [2021-11-17 00:43:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 980 transitions. [2021-11-17 00:43:11,580 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 980 transitions. Word has length 144 [2021-11-17 00:43:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:43:11,580 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 980 transitions. [2021-11-17 00:43:11,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 20 states have internal predecessors, (133), 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) [2021-11-17 00:43:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 980 transitions. [2021-11-17 00:43:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 00:43:11,582 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:43:11,582 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:43:11,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-17 00:43:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:43:11,808 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:43:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:43:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1462586810, now seen corresponding path program 5 times [2021-11-17 00:43:11,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:43:11,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439438805] [2021-11-17 00:43:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:43:11,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:43:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:43:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 00:43:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:43:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:43:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 00:43:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:43:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:43:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:43:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:43:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 00:43:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 00:43:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 00:43:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-17 00:43:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:43:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-17 00:43:12,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:43:12,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439438805] [2021-11-17 00:43:12,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439438805] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:43:12,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693179014] [2021-11-17 00:43:12,207 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-17 00:43:12,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:43:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:43:12,224 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) [2021-11-17 00:43:12,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Killed by 15