./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.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 a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 14:31:01,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 14:31:01,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 14:31:01,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 14:31:01,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 14:31:01,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 14:31:01,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 14:31:01,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 14:31:01,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 14:31:01,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 14:31:01,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 14:31:01,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 14:31:01,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 14:31:01,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 14:31:01,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 14:31:01,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 14:31:01,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 14:31:01,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 14:31:01,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 14:31:01,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 14:31:01,194 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 14:31:01,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 14:31:01,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 14:31:01,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 14:31:01,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 14:31:01,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 14:31:01,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 14:31:01,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 14:31:01,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 14:31:01,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 14:31:01,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 14:31:01,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 14:31:01,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 14:31:01,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 14:31:01,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 14:31:01,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 14:31:01,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 14:31:01,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 14:31:01,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 14:31:01,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 14:31:01,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 14:31:01,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 14:31:01,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 14:31:01,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 14:31:01,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 14:31:01,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 14:31:01,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 14:31:01,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 14:31:01,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 14:31:01,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 14:31:01,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 14:31:01,252 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 14:31:01,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 14:31:01,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 14:31:01,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 14:31:01,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 14:31:01,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 14:31:01,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 14:31:01,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 14:31:01,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 14:31:01,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 14:31:01,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 14:31:01,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 14:31:01,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 14:31:01,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 14:31:01,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 14:31:01,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 14:31:01,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 14:31:01,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 14:31:01,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 14:31:01,258 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 14:31:01,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 14:31:01,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 14:31:01,258 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 -> a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 [2022-07-12 14:31:01,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 14:31:01,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 14:31:01,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 14:31:01,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 14:31:01,531 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 14:31:01,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-12 14:31:01,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a9f0c61/bac7b390a4de4444aa4ac412771e9c3b/FLAG24dfdccce [2022-07-12 14:31:02,433 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 14:31:02,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-12 14:31:02,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a9f0c61/bac7b390a4de4444aa4ac412771e9c3b/FLAG24dfdccce [2022-07-12 14:31:02,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a9f0c61/bac7b390a4de4444aa4ac412771e9c3b [2022-07-12 14:31:02,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 14:31:02,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 14:31:02,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 14:31:02,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 14:31:02,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 14:31:02,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:02" (1/1) ... [2022-07-12 14:31:02,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d65210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:02, skipping insertion in model container [2022-07-12 14:31:02,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:31:02" (1/1) ... [2022-07-12 14:31:02,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 14:31:02,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 14:31:05,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-12 14:31:05,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 14:31:05,231 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 14:31:05,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-12 14:31:05,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 14:31:05,715 INFO L208 MainTranslator]: Completed translation [2022-07-12 14:31:05,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05 WrapperNode [2022-07-12 14:31:05,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 14:31:05,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 14:31:05,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 14:31:05,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 14:31:05,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:05,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:05,992 INFO L137 Inliner]: procedures = 311, calls = 1623, calls flagged for inlining = 133, calls inlined = 130, statements flattened = 4354 [2022-07-12 14:31:05,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 14:31:05,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 14:31:05,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 14:31:05,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 14:31:06,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 14:31:06,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 14:31:06,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 14:31:06,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 14:31:06,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (1/1) ... [2022-07-12 14:31:06,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 14:31:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 14:31:06,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 14:31:06,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 14:31:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 14:31:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 14:31:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev32 [2022-07-12 14:31:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev32 [2022-07-12 14:31:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 14:31:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 14:31:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure put_rx_struct [2022-07-12 14:31:06,329 INFO L138 BoogieDeclarations]: Found implementation of procedure put_rx_struct [2022-07-12 14:31:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 14:31:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 14:31:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_netif_rx [2022-07-12 14:31:06,329 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_netif_rx [2022-07-12 14:31:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 14:31:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 14:31:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 14:31:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 14:31:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-12 14:31:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-12 14:31:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 14:31:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 14:31:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-12 14:31:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-12 14:31:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-07-12 14:31:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-07-12 14:31:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-07-12 14:31:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev16 [2022-07-12 14:31:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev16 [2022-07-12 14:31:06,332 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev16_to_cpu [2022-07-12 14:31:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev16_to_cpu [2022-07-12 14:31:06,332 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_stats [2022-07-12 14:31:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_stats [2022-07-12 14:31:06,332 INFO L130 BoogieDeclarations]: Found specification of procedure free_rx_struct [2022-07-12 14:31:06,333 INFO L138 BoogieDeclarations]: Found implementation of procedure free_rx_struct [2022-07-12 14:31:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 14:31:06,333 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 14:31:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 14:31:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 14:31:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 14:31:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 14:31:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 14:31:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 14:31:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 14:31:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 14:31:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 14:31:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 14:31:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_set_config [2022-07-12 14:31:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_set_config [2022-07-12 14:31:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_set_endian [2022-07-12 14:31:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_set_endian [2022-07-12 14:31:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 14:31:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 14:31:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 14:31:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 14:31:06,337 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 14:31:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 14:31:06,338 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_resume [2022-07-12 14:31:06,338 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_resume [2022-07-12 14:31:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 14:31:06,339 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_rx [2022-07-12 14:31:06,339 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_rx [2022-07-12 14:31:06,340 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_sdu_struct [2022-07-12 14:31:06,340 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_sdu_struct [2022-07-12 14:31:06,340 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-07-12 14:31:06,340 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-07-12 14:31:06,340 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 14:31:06,340 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 14:31:06,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 14:31:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 14:31:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 14:31:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 14:31:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-07-12 14:31:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-07-12 14:31:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 14:31:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 14:31:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 14:31:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 14:31:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 14:31:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 14:31:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 14:31:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 14:31:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 14:31:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 14:31:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure packet_aggregation [2022-07-12 14:31:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_aggregation [2022-07-12 14:31:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_struct [2022-07-12 14:31:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_struct [2022-07-12 14:31:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-07-12 14:31:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-07-12 14:31:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev_index [2022-07-12 14:31:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev_index [2022-07-12 14:31:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 14:31:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 14:31:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 14:31:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-12 14:31:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-12 14:31:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 14:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure do_tx [2022-07-12 14:31:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure do_tx [2022-07-12 14:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-12 14:31:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-12 14:31:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-07-12 14:31:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-07-12 14:31:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 14:31:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_has_listeners [2022-07-12 14:31:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_has_listeners [2022-07-12 14:31:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 14:31:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 14:31:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 14:31:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 14:31:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure ether_addr_copy [2022-07-12 14:31:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ether_addr_copy [2022-07-12 14:31:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 14:31:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 14:31:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 14:31:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 14:31:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_send_complete [2022-07-12 14:31:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_send_complete [2022-07-12 14:31:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 14:31:06,353 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 14:31:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure ether_setup [2022-07-12 14:31:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 14:31:06,356 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 14:31:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 14:31:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-12 14:31:06,358 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-12 14:31:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-12 14:31:06,358 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-12 14:31:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 14:31:06,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 14:31:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_disconnect [2022-07-12 14:31:06,365 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_disconnect [2022-07-12 14:31:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 14:31:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-12 14:31:06,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-12 14:31:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 14:31:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_recv [2022-07-12 14:31:06,366 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_recv [2022-07-12 14:31:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 14:31:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 14:31:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 14:31:06,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 14:31:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_lte_device [2022-07-12 14:31:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_lte_device [2022-07-12 14:31:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 14:31:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 14:31:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 14:31:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 14:31:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-12 14:31:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-12 14:31:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-12 14:31:06,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-12 14:31:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-07-12 14:31:06,368 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-07-12 14:31:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_struct [2022-07-12 14:31:06,368 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_struct [2022-07-12 14:31:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-12 14:31:06,368 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-12 14:31:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 14:31:06,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 14:31:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev32_to_cpu [2022-07-12 14:31:06,369 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev32_to_cpu [2022-07-12 14:31:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 14:31:06,369 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 14:31:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure do_rx [2022-07-12 14:31:06,369 INFO L138 BoogieDeclarations]: Found implementation of procedure do_rx [2022-07-12 14:31:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 14:31:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-12 14:31:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-12 14:31:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure release_usb [2022-07-12 14:31:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure release_usb [2022-07-12 14:31:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-12 14:31:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-12 14:31:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 14:31:06,371 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 14:31:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 14:31:06,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 14:31:07,181 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 14:31:07,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 14:31:07,479 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 14:31:10,429 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 14:31:10,444 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 14:31:10,444 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 14:31:10,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:10 BoogieIcfgContainer [2022-07-12 14:31:10,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 14:31:10,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 14:31:10,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 14:31:10,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 14:31:10,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:31:02" (1/3) ... [2022-07-12 14:31:10,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52539c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:10, skipping insertion in model container [2022-07-12 14:31:10,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:31:05" (2/3) ... [2022-07-12 14:31:10,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52539c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:31:10, skipping insertion in model container [2022-07-12 14:31:10,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:31:10" (3/3) ... [2022-07-12 14:31:10,456 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-12 14:31:10,469 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 14:31:10,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 14:31:10,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 14:31:10,543 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@731fadf6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c1bcad3 [2022-07-12 14:31:10,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 14:31:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) [2022-07-12 14:31:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 14:31:10,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:10,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:31:10,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 537382679, now seen corresponding path program 1 times [2022-07-12 14:31:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:10,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615453131] [2022-07-12 14:31:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 14:31:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 14:31:11,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:11,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615453131] [2022-07-12 14:31:11,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615453131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:11,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:11,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 14:31:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636850237] [2022-07-12 14:31:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:11,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 14:31:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:11,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 14:31:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 14:31:11,212 INFO L87 Difference]: Start difference. First operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 14:31:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:15,463 INFO L93 Difference]: Finished difference Result 3355 states and 5176 transitions. [2022-07-12 14:31:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 14:31:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-12 14:31:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:15,510 INFO L225 Difference]: With dead ends: 3355 [2022-07-12 14:31:15,511 INFO L226 Difference]: Without dead ends: 1818 [2022-07-12 14:31:15,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 14:31:15,535 INFO L413 NwaCegarLoop]: 2138 mSDtfsCounter, 1032 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:15,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 4148 Invalid, 2539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1160 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 14:31:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2022-07-12 14:31:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1510. [2022-07-12 14:31:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1035 states have (on average 1.3371980676328503) internal successors, (1384), 1068 states have internal predecessors, (1384), 398 states have call successors, (398), 77 states have call predecessors, (398), 76 states have return successors, (396), 386 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-12 14:31:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2178 transitions. [2022-07-12 14:31:15,751 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2178 transitions. Word has length 49 [2022-07-12 14:31:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:15,752 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 2178 transitions. [2022-07-12 14:31:15,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 14:31:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2178 transitions. [2022-07-12 14:31:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 14:31:15,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:15,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:31:15,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 14:31:15,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash -491976619, now seen corresponding path program 1 times [2022-07-12 14:31:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444128639] [2022-07-12 14:31:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 14:31:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 14:31:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:15,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444128639] [2022-07-12 14:31:15,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444128639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:15,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 14:31:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720594018] [2022-07-12 14:31:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 14:31:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 14:31:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 14:31:15,971 INFO L87 Difference]: Start difference. First operand 1510 states and 2178 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 14:31:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:22,010 INFO L93 Difference]: Finished difference Result 4855 states and 7262 transitions. [2022-07-12 14:31:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 14:31:22,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-12 14:31:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:22,034 INFO L225 Difference]: With dead ends: 4855 [2022-07-12 14:31:22,034 INFO L226 Difference]: Without dead ends: 3355 [2022-07-12 14:31:22,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 14:31:22,045 INFO L413 NwaCegarLoop]: 2636 mSDtfsCounter, 4548 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 3367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 5313 SdHoareTripleChecker+Invalid, 5573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3367 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:22,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 5313 Invalid, 5573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3367 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 14:31:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-07-12 14:31:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2745. [2022-07-12 14:31:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 1895 states have (on average 1.341424802110818) internal successors, (2542), 1952 states have internal predecessors, (2542), 710 states have call successors, (710), 140 states have call predecessors, (710), 139 states have return successors, (708), 689 states have call predecessors, (708), 708 states have call successors, (708) [2022-07-12 14:31:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3960 transitions. [2022-07-12 14:31:22,234 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3960 transitions. Word has length 49 [2022-07-12 14:31:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:22,235 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 3960 transitions. [2022-07-12 14:31:22,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 14:31:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3960 transitions. [2022-07-12 14:31:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 14:31:22,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:22,244 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 14:31:22,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 14:31:22,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash -305469456, now seen corresponding path program 1 times [2022-07-12 14:31:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:22,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461800455] [2022-07-12 14:31:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 14:31:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 14:31:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 14:31:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 14:31:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:22,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461800455] [2022-07-12 14:31:22,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461800455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:22,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:22,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 14:31:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931518119] [2022-07-12 14:31:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 14:31:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 14:31:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 14:31:22,578 INFO L87 Difference]: Start difference. First operand 2745 states and 3960 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:32,491 INFO L93 Difference]: Finished difference Result 9823 states and 14952 transitions. [2022-07-12 14:31:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 14:31:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-12 14:31:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:32,587 INFO L225 Difference]: With dead ends: 9823 [2022-07-12 14:31:32,588 INFO L226 Difference]: Without dead ends: 7088 [2022-07-12 14:31:32,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-12 14:31:32,614 INFO L413 NwaCegarLoop]: 2189 mSDtfsCounter, 5700 mSDsluCounter, 4686 mSDsCounter, 0 mSdLazyCounter, 5466 mSolverCounterSat, 4294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6074 SdHoareTripleChecker+Valid, 6875 SdHoareTripleChecker+Invalid, 9760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4294 IncrementalHoareTripleChecker+Valid, 5466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:32,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6074 Valid, 6875 Invalid, 9760 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4294 Valid, 5466 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-12 14:31:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-12 14:31:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5665. [2022-07-12 14:31:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 3946 states have (on average 1.3563101875316776) internal successors, (5352), 4067 states have internal predecessors, (5352), 1427 states have call successors, (1427), 279 states have call predecessors, (1427), 291 states have return successors, (1511), 1395 states have call predecessors, (1511), 1424 states have call successors, (1511) [2022-07-12 14:31:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8290 transitions. [2022-07-12 14:31:32,981 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8290 transitions. Word has length 69 [2022-07-12 14:31:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:32,982 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 8290 transitions. [2022-07-12 14:31:32,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8290 transitions. [2022-07-12 14:31:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 14:31:32,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:32,985 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 14:31:32,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 14:31:32,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1859013993, now seen corresponding path program 1 times [2022-07-12 14:31:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:32,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835146505] [2022-07-12 14:31:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 14:31:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 14:31:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 14:31:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 14:31:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:33,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835146505] [2022-07-12 14:31:33,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835146505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:33,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:33,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 14:31:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639924328] [2022-07-12 14:31:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:33,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 14:31:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 14:31:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 14:31:33,229 INFO L87 Difference]: Start difference. First operand 5665 states and 8290 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:40,988 INFO L93 Difference]: Finished difference Result 16267 states and 24830 transitions. [2022-07-12 14:31:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 14:31:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-07-12 14:31:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:41,066 INFO L225 Difference]: With dead ends: 16267 [2022-07-12 14:31:41,066 INFO L226 Difference]: Without dead ends: 10612 [2022-07-12 14:31:41,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-12 14:31:41,146 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 6251 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 4467 mSolverCounterSat, 4492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6628 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 8959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4492 IncrementalHoareTripleChecker+Valid, 4467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:41,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6628 Valid, 5966 Invalid, 8959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4492 Valid, 4467 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 14:31:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10612 states. [2022-07-12 14:31:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10612 to 8580. [2022-07-12 14:31:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8580 states, 5995 states have (on average 1.3609674728940784) internal successors, (8159), 6181 states have internal predecessors, (8159), 2141 states have call successors, (2141), 418 states have call predecessors, (2141), 443 states have return successors, (2333), 2097 states have call predecessors, (2333), 2137 states have call successors, (2333) [2022-07-12 14:31:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8580 states to 8580 states and 12633 transitions. [2022-07-12 14:31:41,637 INFO L78 Accepts]: Start accepts. Automaton has 8580 states and 12633 transitions. Word has length 70 [2022-07-12 14:31:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:41,638 INFO L495 AbstractCegarLoop]: Abstraction has 8580 states and 12633 transitions. [2022-07-12 14:31:41,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 8580 states and 12633 transitions. [2022-07-12 14:31:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 14:31:41,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:41,643 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 14:31:41,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 14:31:41,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1392904398, now seen corresponding path program 1 times [2022-07-12 14:31:41,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:41,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393300752] [2022-07-12 14:31:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 14:31:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 14:31:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 14:31:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 14:31:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:41,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393300752] [2022-07-12 14:31:41,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393300752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:41,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:41,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 14:31:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695686228] [2022-07-12 14:31:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:41,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 14:31:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:41,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 14:31:41,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 14:31:41,878 INFO L87 Difference]: Start difference. First operand 8580 states and 12633 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:49,796 INFO L93 Difference]: Finished difference Result 22507 states and 34306 transitions. [2022-07-12 14:31:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 14:31:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-07-12 14:31:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:49,875 INFO L225 Difference]: With dead ends: 22507 [2022-07-12 14:31:49,875 INFO L226 Difference]: Without dead ends: 13937 [2022-07-12 14:31:49,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-12 14:31:49,917 INFO L413 NwaCegarLoop]: 2302 mSDtfsCounter, 5360 mSDsluCounter, 3817 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 4234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5732 SdHoareTripleChecker+Valid, 6119 SdHoareTripleChecker+Invalid, 8739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4234 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:49,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5732 Valid, 6119 Invalid, 8739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4234 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-07-12 14:31:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2022-07-12 14:31:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 11447. [2022-07-12 14:31:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 8012 states have (on average 1.3635796305541688) internal successors, (10925), 8267 states have internal predecessors, (10925), 2843 states have call successors, (2843), 557 states have call predecessors, (2843), 591 states have return successors, (3148), 2777 states have call predecessors, (3148), 2838 states have call successors, (3148) [2022-07-12 14:31:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 16916 transitions. [2022-07-12 14:31:50,593 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 16916 transitions. Word has length 68 [2022-07-12 14:31:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:50,594 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 16916 transitions. [2022-07-12 14:31:50,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 16916 transitions. [2022-07-12 14:31:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 14:31:50,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:50,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 14:31:50,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 14:31:50,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1077150297, now seen corresponding path program 1 times [2022-07-12 14:31:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:50,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592954032] [2022-07-12 14:31:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:31:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 14:31:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 14:31:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 14:31:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592954032] [2022-07-12 14:31:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592954032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:50,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:50,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 14:31:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290626460] [2022-07-12 14:31:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:50,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 14:31:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 14:31:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 14:31:50,833 INFO L87 Difference]: Start difference. First operand 11447 states and 16916 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:31:58,166 INFO L93 Difference]: Finished difference Result 27908 states and 42487 transitions. [2022-07-12 14:31:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 14:31:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-12 14:31:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:31:58,275 INFO L225 Difference]: With dead ends: 27908 [2022-07-12 14:31:58,276 INFO L226 Difference]: Without dead ends: 16427 [2022-07-12 14:31:58,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-12 14:31:58,329 INFO L413 NwaCegarLoop]: 2308 mSDtfsCounter, 6799 mSDsluCounter, 3192 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 5651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7172 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 9230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5651 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-12 14:31:58,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7172 Valid, 5500 Invalid, 9230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5651 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-12 14:31:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16427 states. [2022-07-12 14:31:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16427 to 13502. [2022-07-12 14:31:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13502 states, 9434 states have (on average 1.3522365910536358) internal successors, (12757), 9706 states have internal predecessors, (12757), 3363 states have call successors, (3363), 669 states have call predecessors, (3363), 704 states have return successors, (3683), 3298 states have call predecessors, (3683), 3358 states have call successors, (3683) [2022-07-12 14:31:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 19803 transitions. [2022-07-12 14:31:59,223 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 19803 transitions. Word has length 71 [2022-07-12 14:31:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:31:59,224 INFO L495 AbstractCegarLoop]: Abstraction has 13502 states and 19803 transitions. [2022-07-12 14:31:59,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 14:31:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 19803 transitions. [2022-07-12 14:31:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 14:31:59,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:31:59,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:31:59,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 14:31:59,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:31:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:31:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1015390489, now seen corresponding path program 1 times [2022-07-12 14:31:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:31:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242367280] [2022-07-12 14:31:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:31:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:31:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:31:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:31:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:31:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:31:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:31:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:31:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:31:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 14:31:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:31:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242367280] [2022-07-12 14:31:59,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242367280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:31:59,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:31:59,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 14:31:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065101933] [2022-07-12 14:31:59,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:31:59,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 14:31:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:31:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 14:31:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 14:31:59,467 INFO L87 Difference]: Start difference. First operand 13502 states and 19803 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 14:32:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:32:04,137 INFO L93 Difference]: Finished difference Result 16802 states and 25517 transitions. [2022-07-12 14:32:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 14:32:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-07-12 14:32:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:32:04,246 INFO L225 Difference]: With dead ends: 16802 [2022-07-12 14:32:04,246 INFO L226 Difference]: Without dead ends: 16799 [2022-07-12 14:32:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 14:32:04,264 INFO L413 NwaCegarLoop]: 1998 mSDtfsCounter, 2927 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 1537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3142 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1537 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 14:32:04,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3142 Valid, 4815 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1537 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 14:32:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2022-07-12 14:32:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 13987. [2022-07-12 14:32:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13987 states, 9744 states have (on average 1.3473932676518883) internal successors, (13129), 10032 states have internal predecessors, (13129), 3467 states have call successors, (3467), 740 states have call predecessors, (3467), 775 states have return successors, (3787), 3402 states have call predecessors, (3787), 3462 states have call successors, (3787) [2022-07-12 14:32:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 20383 transitions. [2022-07-12 14:32:05,094 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 20383 transitions. Word has length 86 [2022-07-12 14:32:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:32:05,095 INFO L495 AbstractCegarLoop]: Abstraction has 13987 states and 20383 transitions. [2022-07-12 14:32:05,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 14:32:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 20383 transitions. [2022-07-12 14:32:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-12 14:32:05,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:32:05,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:32:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 14:32:05,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:32:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:32:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -565835672, now seen corresponding path program 1 times [2022-07-12 14:32:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:32:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127665401] [2022-07-12 14:32:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:32:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:32:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:32:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:32:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:32:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 14:32:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:32:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:32:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:32:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:32:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:32:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 14:32:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 14:32:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 14:32:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 14:32:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:32:05,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127665401] [2022-07-12 14:32:05,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127665401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:32:05,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:32:05,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 14:32:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017722639] [2022-07-12 14:32:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:32:05,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 14:32:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:32:05,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 14:32:05,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 14:32:05,510 INFO L87 Difference]: Start difference. First operand 13987 states and 20383 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 14:32:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:32:17,590 INFO L93 Difference]: Finished difference Result 40146 states and 60650 transitions. [2022-07-12 14:32:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 14:32:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 173 [2022-07-12 14:32:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:32:17,800 INFO L225 Difference]: With dead ends: 40146 [2022-07-12 14:32:17,800 INFO L226 Difference]: Without dead ends: 26169 [2022-07-12 14:32:17,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-12 14:32:17,867 INFO L413 NwaCegarLoop]: 3561 mSDtfsCounter, 4842 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 5701 mSolverCounterSat, 4060 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5196 SdHoareTripleChecker+Valid, 9455 SdHoareTripleChecker+Invalid, 9761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4060 IncrementalHoareTripleChecker+Valid, 5701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-12 14:32:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5196 Valid, 9455 Invalid, 9761 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4060 Valid, 5701 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-12 14:32:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2022-07-12 14:32:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 20775. [2022-07-12 14:32:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20775 states, 14493 states have (on average 1.3469951010832817) internal successors, (19522), 14905 states have internal predecessors, (19522), 5154 states have call successors, (5154), 1079 states have call predecessors, (5154), 1127 states have return successors, (5608), 5069 states have call predecessors, (5608), 5149 states have call successors, (5608) [2022-07-12 14:32:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20775 states to 20775 states and 30284 transitions. [2022-07-12 14:32:19,536 INFO L78 Accepts]: Start accepts. Automaton has 20775 states and 30284 transitions. Word has length 173 [2022-07-12 14:32:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:32:19,537 INFO L495 AbstractCegarLoop]: Abstraction has 20775 states and 30284 transitions. [2022-07-12 14:32:19,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 14:32:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 20775 states and 30284 transitions. [2022-07-12 14:32:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 14:32:19,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:32:19,556 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:32:19,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 14:32:19,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:32:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:32:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 684186662, now seen corresponding path program 1 times [2022-07-12 14:32:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:32:19,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121255586] [2022-07-12 14:32:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:32:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:32:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:32:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:32:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:32:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:32:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 14:32:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:32:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:32:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:32:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:32:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:32:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 14:32:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 14:32:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 14:32:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 14:32:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:32:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121255586] [2022-07-12 14:32:19,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121255586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:32:19,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:32:19,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 14:32:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577791828] [2022-07-12 14:32:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:32:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 14:32:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:32:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 14:32:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 14:32:19,955 INFO L87 Difference]: Start difference. First operand 20775 states and 30284 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 14:32:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:32:36,796 INFO L93 Difference]: Finished difference Result 61851 states and 93429 transitions. [2022-07-12 14:32:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 14:32:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 186 [2022-07-12 14:32:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:32:37,061 INFO L225 Difference]: With dead ends: 61851 [2022-07-12 14:32:37,061 INFO L226 Difference]: Without dead ends: 41086 [2022-07-12 14:32:37,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-07-12 14:32:37,158 INFO L413 NwaCegarLoop]: 2767 mSDtfsCounter, 8222 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 7780 mSolverCounterSat, 7605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8431 SdHoareTripleChecker+Valid, 8355 SdHoareTripleChecker+Invalid, 15385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7605 IncrementalHoareTripleChecker+Valid, 7780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-07-12 14:32:37,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8431 Valid, 8355 Invalid, 15385 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7605 Valid, 7780 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2022-07-12 14:32:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41086 states. [2022-07-12 14:32:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41086 to 32211. [2022-07-12 14:32:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-12 14:32:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-12 14:32:39,808 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 186 [2022-07-12 14:32:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:32:39,808 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-12 14:32:39,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 14:32:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-12 14:32:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-12 14:32:39,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:32:39,830 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:32:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 14:32:39,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:32:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:32:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1620364600, now seen corresponding path program 1 times [2022-07-12 14:32:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:32:39,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845597586] [2022-07-12 14:32:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:32:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:32:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:32:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:32:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:32:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:32:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 14:32:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 14:32:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:32:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:32:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:32:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:32:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:32:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:32:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:32:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 14:32:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 14:32:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 14:32:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:32:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 14:32:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:32:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845597586] [2022-07-12 14:32:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845597586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:32:40,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:32:40,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 14:32:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895504706] [2022-07-12 14:32:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:32:40,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 14:32:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:32:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 14:32:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 14:32:40,233 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 14:33:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:33:02,221 INFO L93 Difference]: Finished difference Result 92912 states and 143084 transitions. [2022-07-12 14:33:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 14:33:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 203 [2022-07-12 14:33:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:33:02,673 INFO L225 Difference]: With dead ends: 92912 [2022-07-12 14:33:02,673 INFO L226 Difference]: Without dead ends: 60711 [2022-07-12 14:33:02,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-07-12 14:33:02,800 INFO L413 NwaCegarLoop]: 2776 mSDtfsCounter, 6482 mSDsluCounter, 7650 mSDsCounter, 0 mSdLazyCounter, 11651 mSolverCounterSat, 4782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6712 SdHoareTripleChecker+Valid, 10426 SdHoareTripleChecker+Invalid, 16433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4782 IncrementalHoareTripleChecker+Valid, 11651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-07-12 14:33:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6712 Valid, 10426 Invalid, 16433 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4782 Valid, 11651 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2022-07-12 14:33:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60711 states. [2022-07-12 14:33:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60711 to 32211. [2022-07-12 14:33:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-12 14:33:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-12 14:33:05,839 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 203 [2022-07-12 14:33:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:33:05,840 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-12 14:33:05,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 14:33:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-12 14:33:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 14:33:05,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:33:05,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:33:05,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 14:33:05,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:33:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:33:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1718121921, now seen corresponding path program 1 times [2022-07-12 14:33:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:33:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776794700] [2022-07-12 14:33:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:33:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:33:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:33:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:33:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:33:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:33:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 14:33:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 14:33:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 14:33:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 14:33:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:33:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:33:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:33:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:33:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:33:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 14:33:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 14:33:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 14:33:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 14:33:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:33:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776794700] [2022-07-12 14:33:06,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776794700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 14:33:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518929901] [2022-07-12 14:33:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:33:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 14:33:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 14:33:06,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 14:33:06,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 14:33:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:07,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 14:33:07,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 14:33:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 14:33:07,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 14:33:07,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518929901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:33:07,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 14:33:07,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 14:33:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652629175] [2022-07-12 14:33:07,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:33:07,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 14:33:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:33:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 14:33:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 14:33:07,297 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 14:33:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:33:10,001 INFO L93 Difference]: Finished difference Result 71007 states and 103338 transitions. [2022-07-12 14:33:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 14:33:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 228 [2022-07-12 14:33:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:33:10,278 INFO L225 Difference]: With dead ends: 71007 [2022-07-12 14:33:10,278 INFO L226 Difference]: Without dead ends: 38806 [2022-07-12 14:33:10,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 14:33:10,347 INFO L413 NwaCegarLoop]: 2531 mSDtfsCounter, 2115 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 14:33:10,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 4372 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 14:33:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38806 states. [2022-07-12 14:33:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38806 to 38774. [2022-07-12 14:33:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38774 states, 26982 states have (on average 1.3472685494033059) internal successors, (36352), 27807 states have internal predecessors, (36352), 9606 states have call successors, (9606), 2090 states have call predecessors, (9606), 2185 states have return successors, (10463), 9430 states have call predecessors, (10463), 9597 states have call successors, (10463) [2022-07-12 14:33:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38774 states to 38774 states and 56421 transitions. [2022-07-12 14:33:13,047 INFO L78 Accepts]: Start accepts. Automaton has 38774 states and 56421 transitions. Word has length 228 [2022-07-12 14:33:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:33:13,048 INFO L495 AbstractCegarLoop]: Abstraction has 38774 states and 56421 transitions. [2022-07-12 14:33:13,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 14:33:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38774 states and 56421 transitions. [2022-07-12 14:33:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-12 14:33:13,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:33:13,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:33:13,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 14:33:13,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 14:33:13,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:33:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:33:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1883306169, now seen corresponding path program 1 times [2022-07-12 14:33:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:33:13,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316321029] [2022-07-12 14:33:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:33:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:33:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:33:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:33:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:33:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:33:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 14:33:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 14:33:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 14:33:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 14:33:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 14:33:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:33:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:33:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:33:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:33:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:33:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 14:33:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 14:33:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 14:33:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 14:33:13,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:33:13,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316321029] [2022-07-12 14:33:13,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316321029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:33:13,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:33:13,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 14:33:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281335265] [2022-07-12 14:33:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:33:13,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 14:33:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:33:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 14:33:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-12 14:33:13,843 INFO L87 Difference]: Start difference. First operand 38774 states and 56421 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 5 states have internal predecessors, (139), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 14:33:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:33:40,940 INFO L93 Difference]: Finished difference Result 108472 states and 166707 transitions. [2022-07-12 14:33:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 14:33:40,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 5 states have internal predecessors, (139), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 244 [2022-07-12 14:33:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:33:41,509 INFO L225 Difference]: With dead ends: 108472 [2022-07-12 14:33:41,509 INFO L226 Difference]: Without dead ends: 69708 [2022-07-12 14:33:41,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 14:33:41,649 INFO L413 NwaCegarLoop]: 3260 mSDtfsCounter, 9084 mSDsluCounter, 10933 mSDsCounter, 0 mSdLazyCounter, 14452 mSolverCounterSat, 8493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9310 SdHoareTripleChecker+Valid, 14193 SdHoareTripleChecker+Invalid, 22945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8493 IncrementalHoareTripleChecker+Valid, 14452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2022-07-12 14:33:41,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9310 Valid, 14193 Invalid, 22945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8493 Valid, 14452 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2022-07-12 14:33:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69708 states. [2022-07-12 14:33:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69708 to 38789. [2022-07-12 14:33:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38789 states, 26987 states have (on average 1.347204209434172) internal successors, (36357), 27807 states have internal predecessors, (36357), 9616 states have call successors, (9616), 2090 states have call predecessors, (9616), 2185 states have return successors, (10473), 9435 states have call predecessors, (10473), 9607 states have call successors, (10473) [2022-07-12 14:33:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38789 states to 38789 states and 56446 transitions. [2022-07-12 14:33:45,373 INFO L78 Accepts]: Start accepts. Automaton has 38789 states and 56446 transitions. Word has length 244 [2022-07-12 14:33:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:33:45,373 INFO L495 AbstractCegarLoop]: Abstraction has 38789 states and 56446 transitions. [2022-07-12 14:33:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 5 states have internal predecessors, (139), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 14:33:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38789 states and 56446 transitions. [2022-07-12 14:33:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-07-12 14:33:45,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:33:45,390 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:33:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 14:33:45,390 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:33:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:33:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -891727683, now seen corresponding path program 1 times [2022-07-12 14:33:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:33:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454518693] [2022-07-12 14:33:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:33:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:33:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:33:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:33:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 14:33:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 14:33:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 14:33:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:33:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 14:33:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 14:33:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 14:33:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 14:33:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 14:33:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 14:33:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 14:33:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 14:33:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 14:33:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 14:33:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 14:33:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 14:33:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 14:33:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 14:33:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:33:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:33:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 14:33:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 14:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 14:33:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 14:33:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 14:33:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:33:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 14:33:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:33:45,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454518693] [2022-07-12 14:33:45,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454518693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:33:45,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:33:45,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 14:33:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510470599] [2022-07-12 14:33:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:33:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 14:33:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:33:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 14:33:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 14:33:45,848 INFO L87 Difference]: Start difference. First operand 38789 states and 56446 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 14:34:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:34:06,997 INFO L93 Difference]: Finished difference Result 128490 states and 196599 transitions. [2022-07-12 14:34:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 14:34:06,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 259 [2022-07-12 14:34:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 14:34:07,667 INFO L225 Difference]: With dead ends: 128490 [2022-07-12 14:34:07,667 INFO L226 Difference]: Without dead ends: 89711 [2022-07-12 14:34:07,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-12 14:34:07,827 INFO L413 NwaCegarLoop]: 2015 mSDtfsCounter, 7535 mSDsluCounter, 5082 mSDsCounter, 0 mSdLazyCounter, 6686 mSolverCounterSat, 6135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7718 SdHoareTripleChecker+Valid, 7097 SdHoareTripleChecker+Invalid, 12821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6135 IncrementalHoareTripleChecker+Valid, 6686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-12 14:34:07,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7718 Valid, 7097 Invalid, 12821 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6135 Valid, 6686 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-12 14:34:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89711 states. [2022-07-12 14:34:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89711 to 71119. [2022-07-12 14:34:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71119 states, 49609 states have (on average 1.3663448164647545) internal successors, (67783), 51431 states have internal predecessors, (67783), 17065 states have call successors, (17065), 4023 states have call predecessors, (17065), 4444 states have return successors, (21669), 16776 states have call predecessors, (21669), 17048 states have call successors, (21669) [2022-07-12 14:34:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71119 states to 71119 states and 106517 transitions. [2022-07-12 14:34:14,278 INFO L78 Accepts]: Start accepts. Automaton has 71119 states and 106517 transitions. Word has length 259 [2022-07-12 14:34:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 14:34:14,279 INFO L495 AbstractCegarLoop]: Abstraction has 71119 states and 106517 transitions. [2022-07-12 14:34:14,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 14:34:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 71119 states and 106517 transitions. [2022-07-12 14:34:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-07-12 14:34:14,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 14:34:14,313 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 14:34:14,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 14:34:14,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 14:34:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 14:34:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1020658532, now seen corresponding path program 1 times [2022-07-12 14:34:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 14:34:14,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859340640] [2022-07-12 14:34:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 14:34:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 14:34:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 14:34:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:34:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 14:34:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 14:34:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:34:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 14:34:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 14:34:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:34:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 14:34:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:34:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 14:34:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 14:34:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 14:34:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 14:34:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 14:34:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 14:34:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 14:34:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 14:34:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 14:34:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 14:34:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 14:34:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 14:34:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 14:34:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 14:34:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 14:34:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 14:34:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 14:34:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 14:34:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 14:34:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 14:34:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 14:34:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-12 14:34:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 14:34:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 14:34:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-12 14:34:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 14:34:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 14:34:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 14:34:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 14:34:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 14:34:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 14:34:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 14:34:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 14:34:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 14:34:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-07-12 14:34:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-12 14:34:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 14:34:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-12 14:34:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 14:34:15,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859340640] [2022-07-12 14:34:15,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859340640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 14:34:15,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 14:34:15,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 14:34:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845522113] [2022-07-12 14:34:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 14:34:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 14:34:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 14:34:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 14:34:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 14:34:15,085 INFO L87 Difference]: Start difference. First operand 71119 states and 106517 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-12 14:34:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 14:34:37,033 INFO L93 Difference]: Finished difference Result 183219 states and 290006 transitions. [2022-07-12 14:34:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 14:34:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 351 [2022-07-12 14:34:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted.