./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.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 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:26:00,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:26:00,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:26:00,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:26:00,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:26:00,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:26:00,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:26:00,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:26:00,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:26:00,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:26:00,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:26:00,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:26:00,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:26:00,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:26:00,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:26:00,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:26:00,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:26:00,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:26:00,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:26:00,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:26:00,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:26:00,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:26:00,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:26:00,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:26:00,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:26:00,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:26:00,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:26:00,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:26:00,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:26:00,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:26:00,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:26:00,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:26:00,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:26:00,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:26:00,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:26:00,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:26:00,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:26:00,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:26:00,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:26:00,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:26:00,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:26:00,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:26:00,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:26:00,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:26:00,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:26:00,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:26:00,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:26:00,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:26:00,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:26:00,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:26:00,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:26:00,229 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:26:00,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:26:00,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:26:00,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:26:00,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:26:00,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:26:00,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:26:00,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:26:00,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:26:00,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:26:00,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:26:00,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:26:00,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:26:00,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:00,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:26:00,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:26:00,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:26:00,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:26:00,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:26:00,232 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:26:00,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:26:00,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:26:00,233 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 -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2022-07-12 12:26:00,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:26:00,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:26:00,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:26:00,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:26:00,497 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:26:00,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-12 12:26:00,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3523c12/55f2b2867f4445138091dddcfd661c1e/FLAG156239fae [2022-07-12 12:26:01,161 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:26:01,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-12 12:26:01,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3523c12/55f2b2867f4445138091dddcfd661c1e/FLAG156239fae [2022-07-12 12:26:01,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3523c12/55f2b2867f4445138091dddcfd661c1e [2022-07-12 12:26:01,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:26:01,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:26:01,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:01,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:26:01,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:26:01,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:01" (1/1) ... [2022-07-12 12:26:01,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4220794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:01, skipping insertion in model container [2022-07-12 12:26:01,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:01" (1/1) ... [2022-07-12 12:26:01,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:26:01,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:26:02,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-07-12 12:26:02,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:02,537 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:26:02,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-07-12 12:26:02,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:02,839 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:26:02,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02 WrapperNode [2022-07-12 12:26:02,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:02,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:02,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:26:02,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:26:02,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:02,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,032 INFO L137 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1770 [2022-07-12 12:26:03,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:03,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:26:03,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:26:03,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:26:03,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:26:03,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:26:03,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:26:03,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:26:03,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (1/1) ... [2022-07-12 12:26:03,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:03,233 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 12:26:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-12 12:26:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-12 12:26:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:26:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-07-12 12:26:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-07-12 12:26:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-07-12 12:26:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-07-12 12:26:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-07-12 12:26:03,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-07-12 12:26:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:26:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:26:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:26:03,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:26:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:26:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 12:26:03,276 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 12:26:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:03,276 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-07-12 12:26:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-07-12 12:26:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 12:26:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 12:26:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:26:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:26:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:26:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:26:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:26:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:26:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:26:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:26:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:26:03,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:26:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:26:03,279 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:26:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:26:03,279 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:26:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-07-12 12:26:03,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-07-12 12:26:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-07-12 12:26:03,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-07-12 12:26:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:26:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:26:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:26:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:26:03,257 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 12:26:03,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:26:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:26:03,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:26:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-07-12 12:26:03,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-07-12 12:26:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 12:26:03,283 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 12:26:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:26:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:26:03,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:26:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:26:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:26:03,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:26:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-07-12 12:26:03,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-07-12 12:26:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:26:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:26:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:03,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 12:26:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 12:26:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-12 12:26:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-12 12:26:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:26:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 12:26:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 12:26:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:26:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:26:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-12 12:26:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-12 12:26:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 12:26:03,289 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 12:26:03,289 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 12:26:03,289 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 12:26:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:26:03,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:26:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:26:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-07-12 12:26:03,290 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-07-12 12:26:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:26:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:26:03,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:26:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-12 12:26:03,291 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-12 12:26:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:26:03,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:26:03,736 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:26:03,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:26:03,945 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:26:04,290 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:26:04,887 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:26:04,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:26:04,904 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 12:26:04,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:26:04 BoogieIcfgContainer [2022-07-12 12:26:04,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:26:04,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:26:04,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:26:04,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:26:04,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:26:01" (1/3) ... [2022-07-12 12:26:04,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2780f530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:26:04, skipping insertion in model container [2022-07-12 12:26:04,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:02" (2/3) ... [2022-07-12 12:26:04,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2780f530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:26:04, skipping insertion in model container [2022-07-12 12:26:04,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:26:04" (3/3) ... [2022-07-12 12:26:04,917 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-12 12:26:04,929 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:26:04,930 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:26:05,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:26:05,019 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@5f1518ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12dcc32e [2022-07-12 12:26:05,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:26:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-12 12:26:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 12:26:05,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:05,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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 12:26:05,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2022-07-12 12:26:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:05,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870020210] [2022-07-12 12:26:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:26:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870020210] [2022-07-12 12:26:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870020210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:05,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:05,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587011481] [2022-07-12 12:26:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:05,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:05,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:05,565 INFO L87 Difference]: Start difference. First operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:26:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:06,926 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2022-07-12 12:26:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:26:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-07-12 12:26:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:06,958 INFO L225 Difference]: With dead ends: 1626 [2022-07-12 12:26:06,958 INFO L226 Difference]: Without dead ends: 1080 [2022-07-12 12:26:06,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:06,969 INFO L413 NwaCegarLoop]: 714 mSDtfsCounter, 966 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:06,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1459 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 12:26:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-07-12 12:26:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2022-07-12 12:26:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2764227642276422) internal successors, (942), 754 states have internal predecessors, (942), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-07-12 12:26:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2022-07-12 12:26:07,089 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2022-07-12 12:26:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:07,089 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2022-07-12 12:26:07,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:26:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2022-07-12 12:26:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 12:26:07,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:07,093 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:07,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:26:07,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2022-07-12 12:26:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753980144] [2022-07-12 12:26:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:07,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753980144] [2022-07-12 12:26:07,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753980144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:07,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:07,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138621433] [2022-07-12 12:26:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:07,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:07,246 INFO L87 Difference]: Start difference. First operand 992 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:07,845 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2022-07-12 12:26:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:26:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 12:26:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:07,851 INFO L225 Difference]: With dead ends: 1106 [2022-07-12 12:26:07,852 INFO L226 Difference]: Without dead ends: 1093 [2022-07-12 12:26:07,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:07,854 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 800 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:07,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 930 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:26:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-07-12 12:26:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2022-07-12 12:26:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2750677506775068) internal successors, (941), 754 states have internal predecessors, (941), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-07-12 12:26:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2022-07-12 12:26:07,897 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2022-07-12 12:26:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:07,897 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2022-07-12 12:26:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2022-07-12 12:26:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 12:26:07,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:07,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:07,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:26:07,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:07,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2022-07-12 12:26:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:07,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721792750] [2022-07-12 12:26:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721792750] [2022-07-12 12:26:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721792750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:08,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429997624] [2022-07-12 12:26:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:08,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:08,059 INFO L87 Difference]: Start difference. First operand 992 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:09,345 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2022-07-12 12:26:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:26:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 12:26:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:09,356 INFO L225 Difference]: With dead ends: 3133 [2022-07-12 12:26:09,357 INFO L226 Difference]: Without dead ends: 2150 [2022-07-12 12:26:09,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:09,361 INFO L413 NwaCegarLoop]: 725 mSDtfsCounter, 970 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1464 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:26:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-07-12 12:26:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2022-07-12 12:26:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1487 states have (on average 1.2703429724277069) internal successors, (1889), 1519 states have internal predecessors, (1889), 366 states have call successors, (366), 137 states have call predecessors, (366), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-12 12:26:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2022-07-12 12:26:09,449 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2022-07-12 12:26:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:09,449 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2022-07-12 12:26:09,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2022-07-12 12:26:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 12:26:09,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:09,452 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:09,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:26:09,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2022-07-12 12:26:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:09,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004220080] [2022-07-12 12:26:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:09,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004220080] [2022-07-12 12:26:09,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004220080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:09,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:09,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635001022] [2022-07-12 12:26:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:09,575 INFO L87 Difference]: Start difference. First operand 2000 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:10,238 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2022-07-12 12:26:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:26:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-12 12:26:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:10,250 INFO L225 Difference]: With dead ends: 2142 [2022-07-12 12:26:10,251 INFO L226 Difference]: Without dead ends: 2139 [2022-07-12 12:26:10,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:10,253 INFO L413 NwaCegarLoop]: 623 mSDtfsCounter, 776 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:10,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 889 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 12:26:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-07-12 12:26:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2022-07-12 12:26:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1487 states have (on average 1.269670477471419) internal successors, (1888), 1518 states have internal predecessors, (1888), 365 states have call successors, (365), 137 states have call predecessors, (365), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-12 12:26:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2022-07-12 12:26:10,347 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2022-07-12 12:26:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:10,347 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2022-07-12 12:26:10,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2022-07-12 12:26:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 12:26:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:10,349 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:10,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:26:10,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2022-07-12 12:26:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642348800] [2022-07-12 12:26:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642348800] [2022-07-12 12:26:10,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642348800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:10,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:10,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767964622] [2022-07-12 12:26:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:10,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:10,484 INFO L87 Difference]: Start difference. First operand 1999 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:11,075 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2022-07-12 12:26:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:26:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-07-12 12:26:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:11,087 INFO L225 Difference]: With dead ends: 2141 [2022-07-12 12:26:11,087 INFO L226 Difference]: Without dead ends: 2138 [2022-07-12 12:26:11,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:11,090 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 774 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:11,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 883 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:26:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-07-12 12:26:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2022-07-12 12:26:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1487 states have (on average 1.2689979825151312) internal successors, (1887), 1517 states have internal predecessors, (1887), 364 states have call successors, (364), 137 states have call predecessors, (364), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-12 12:26:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2022-07-12 12:26:11,168 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2022-07-12 12:26:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:11,169 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2022-07-12 12:26:11,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2022-07-12 12:26:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 12:26:11,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:11,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:26:11,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2022-07-12 12:26:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:11,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077053047] [2022-07-12 12:26:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:11,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077053047] [2022-07-12 12:26:11,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077053047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:11,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:11,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:11,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229869171] [2022-07-12 12:26:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:11,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:11,307 INFO L87 Difference]: Start difference. First operand 1998 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:11,886 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2022-07-12 12:26:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:26:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-07-12 12:26:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:11,897 INFO L225 Difference]: With dead ends: 2140 [2022-07-12 12:26:11,897 INFO L226 Difference]: Without dead ends: 2137 [2022-07-12 12:26:11,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:11,899 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 770 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:11,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 883 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:26:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-07-12 12:26:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2022-07-12 12:26:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1487 states have (on average 1.2683254875588432) internal successors, (1886), 1516 states have internal predecessors, (1886), 363 states have call successors, (363), 137 states have call predecessors, (363), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-12 12:26:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2022-07-12 12:26:11,986 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2022-07-12 12:26:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:11,986 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2022-07-12 12:26:11,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2022-07-12 12:26:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 12:26:11,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:11,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:11,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:26:11,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2022-07-12 12:26:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:11,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686736231] [2022-07-12 12:26:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:26:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:12,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686736231] [2022-07-12 12:26:12,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686736231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:12,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:12,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:26:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807040346] [2022-07-12 12:26:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:12,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:26:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:26:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:26:12,097 INFO L87 Difference]: Start difference. First operand 1997 states and 2664 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:12,718 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2022-07-12 12:26:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:26:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-12 12:26:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:12,733 INFO L225 Difference]: With dead ends: 2139 [2022-07-12 12:26:12,734 INFO L226 Difference]: Without dead ends: 2127 [2022-07-12 12:26:12,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:12,737 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 767 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:12,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 880 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:26:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-07-12 12:26:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2022-07-12 12:26:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1478 states have (on average 1.2679296346414073) internal successors, (1874), 1506 states have internal predecessors, (1874), 362 states have call successors, (362), 137 states have call predecessors, (362), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-12 12:26:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2022-07-12 12:26:12,831 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2022-07-12 12:26:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:12,832 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2022-07-12 12:26:12,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:26:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2022-07-12 12:26:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 12:26:12,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:12,839 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:26:12,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:26:12,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2022-07-12 12:26:12,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:12,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182238915] [2022-07-12 12:26:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:26:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:26:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:26:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:26:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:26:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 12:26:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:26:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:26:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 12:26:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 12:26:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:26:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 12:26:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:13,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182238915] [2022-07-12 12:26:13,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182238915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:13,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:13,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:26:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575026082] [2022-07-12 12:26:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:13,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:26:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:26:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:26:13,072 INFO L87 Difference]: Start difference. First operand 1987 states and 2651 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:14,600 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2022-07-12 12:26:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:26:14,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2022-07-12 12:26:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:14,624 INFO L225 Difference]: With dead ends: 5900 [2022-07-12 12:26:14,624 INFO L226 Difference]: Without dead ends: 3922 [2022-07-12 12:26:14,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:26:14,633 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 1540 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:14,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1760 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 12:26:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-07-12 12:26:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2022-07-12 12:26:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2593 states have (on average 1.261473197069032) internal successors, (3271), 2651 states have internal predecessors, (3271), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-12 12:26:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2022-07-12 12:26:14,845 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2022-07-12 12:26:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:14,846 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2022-07-12 12:26:14,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2022-07-12 12:26:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:26:14,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:14,855 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:14,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:26:14,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2022-07-12 12:26:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:14,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305074005] [2022-07-12 12:26:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:26:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:26:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:26:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:26:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:26:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:26:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:26:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 12:26:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:26:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:15,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305074005] [2022-07-12 12:26:15,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305074005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:15,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:15,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:26:15,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422213498] [2022-07-12 12:26:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:15,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:26:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:26:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:26:15,102 INFO L87 Difference]: Start difference. First operand 3516 states and 4670 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:16,087 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2022-07-12 12:26:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:26:16,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-12 12:26:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:16,110 INFO L225 Difference]: With dead ends: 7416 [2022-07-12 12:26:16,111 INFO L226 Difference]: Without dead ends: 3916 [2022-07-12 12:26:16,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:26:16,122 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 867 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:16,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1379 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 12:26:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-07-12 12:26:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2022-07-12 12:26:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2597 states have (on average 1.261070465922218) internal successors, (3275), 2655 states have internal predecessors, (3275), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-12 12:26:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2022-07-12 12:26:16,302 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2022-07-12 12:26:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:16,303 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2022-07-12 12:26:16,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2022-07-12 12:26:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:26:16,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:16,313 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:16,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:26:16,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2022-07-12 12:26:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:16,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231613503] [2022-07-12 12:26:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:26:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:26:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:26:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:26:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:26:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:26:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:26:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 12:26:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:26:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:16,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231613503] [2022-07-12 12:26:16,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231613503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:16,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006977163] [2022-07-12 12:26:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:16,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:16,667 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 12:26:16,676 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 12:26:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:17,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:26:17,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 12:26:17,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:26:17,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006977163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:17,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:26:17,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-12 12:26:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445907414] [2022-07-12 12:26:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:17,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:17,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:17,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:26:17,291 INFO L87 Difference]: Start difference. First operand 3520 states and 4674 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:17,774 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2022-07-12 12:26:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:26:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-12 12:26:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:17,810 INFO L225 Difference]: With dead ends: 9962 [2022-07-12 12:26:17,810 INFO L226 Difference]: Without dead ends: 6458 [2022-07-12 12:26:17,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:26:17,823 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 852 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:17,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 3869 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:26:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-07-12 12:26:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2022-07-12 12:26:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2609 states have (on average 1.2598696818704485) internal successors, (3287), 2667 states have internal predecessors, (3287), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-12 12:26:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2022-07-12 12:26:18,062 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2022-07-12 12:26:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:18,062 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2022-07-12 12:26:18,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:26:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2022-07-12 12:26:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 12:26:18,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:18,072 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:18,103 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 12:26:18,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 12:26:18,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2022-07-12 12:26:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:18,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80620542] [2022-07-12 12:26:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:26:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:26:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:26:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:26:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:26:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:26:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:26:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:26:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 12:26:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:26:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80620542] [2022-07-12 12:26:18,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80620542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:18,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936336109] [2022-07-12 12:26:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:18,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:18,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:18,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:26:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:19,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 12:26:19,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:26:19,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:26:19,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936336109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:19,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:26:19,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-12 12:26:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138459971] [2022-07-12 12:26:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:19,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:26:19,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:19,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:26:19,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:26:19,265 INFO L87 Difference]: Start difference. First operand 3532 states and 4686 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:26:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:20,527 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2022-07-12 12:26:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:26:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-07-12 12:26:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:20,584 INFO L225 Difference]: With dead ends: 14900 [2022-07-12 12:26:20,584 INFO L226 Difference]: Without dead ends: 11384 [2022-07-12 12:26:20,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-07-12 12:26:20,598 INFO L413 NwaCegarLoop]: 1728 mSDtfsCounter, 1640 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:20,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 7178 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 12:26:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2022-07-12 12:26:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2022-07-12 12:26:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 5241 states have (on average 1.2577752337340202) internal successors, (6592), 5365 states have internal predecessors, (6592), 1261 states have call successors, (1261), 514 states have call predecessors, (1261), 593 states have return successors, (1560), 1256 states have call predecessors, (1560), 1260 states have call successors, (1560) [2022-07-12 12:26:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2022-07-12 12:26:21,131 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2022-07-12 12:26:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:21,131 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2022-07-12 12:26:21,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:26:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2022-07-12 12:26:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 12:26:21,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:21,147 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:21,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:21,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 12:26:21,356 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2022-07-12 12:26:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:21,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414148613] [2022-07-12 12:26:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:26:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:26:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:26:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:26:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:26:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:26:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:26:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:26:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 12:26:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 12:26:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:21,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414148613] [2022-07-12 12:26:21,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414148613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:21,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76346666] [2022-07-12 12:26:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:21,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:26:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:22,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 12:26:22,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:22,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:26:22,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:26:22,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:26:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:26:22,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:26:22,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76346666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:22,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:26:22,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2022-07-12 12:26:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976918350] [2022-07-12 12:26:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:26:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:22,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:26:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:26:22,497 INFO L87 Difference]: Start difference. First operand 7096 states and 9413 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:26:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:25,916 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2022-07-12 12:26:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:26:25,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-07-12 12:26:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:25,959 INFO L225 Difference]: With dead ends: 16712 [2022-07-12 12:26:25,959 INFO L226 Difference]: Without dead ends: 9632 [2022-07-12 12:26:25,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-07-12 12:26:25,984 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 669 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:25,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 5594 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-12 12:26:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-07-12 12:26:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2022-07-12 12:26:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8652 states, 6423 states have (on average 1.2665421142768176) internal successors, (8135), 6573 states have internal predecessors, (8135), 1497 states have call successors, (1497), 645 states have call predecessors, (1497), 731 states have return successors, (1863), 1473 states have call predecessors, (1863), 1496 states have call successors, (1863) [2022-07-12 12:26:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2022-07-12 12:26:26,546 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2022-07-12 12:26:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:26,546 INFO L495 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2022-07-12 12:26:26,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:26:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2022-07-12 12:26:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 12:26:26,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:26,570 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:26,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:26,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:26,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2022-07-12 12:26:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:26,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430565737] [2022-07-12 12:26:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:26:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:26:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:26:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:26:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:26:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:26:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:26:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:26:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 12:26:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 12:26:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 12:26:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:27,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430565737] [2022-07-12 12:26:27,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430565737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469975566] [2022-07-12 12:26:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:27,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:27,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:27,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:27,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:26:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:27,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 12:26:27,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:27,918 INFO L356 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-07-12 12:26:27,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2022-07-12 12:26:28,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 12:26:28,178 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 12:26:28,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 12:26:28,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:26:28,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:26:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:26:28,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:26:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469975566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:28,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:26:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2022-07-12 12:26:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567760014] [2022-07-12 12:26:28,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:26:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 12:26:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 12:26:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-07-12 12:26:28,701 INFO L87 Difference]: Start difference. First operand 8652 states and 11495 transitions. Second operand has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-12 12:26:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:34,380 INFO L93 Difference]: Finished difference Result 21557 states and 29035 transitions. [2022-07-12 12:26:34,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-12 12:26:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) Word has length 178 [2022-07-12 12:26:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:34,439 INFO L225 Difference]: With dead ends: 21557 [2022-07-12 12:26:34,440 INFO L226 Difference]: Without dead ends: 13589 [2022-07-12 12:26:34,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 12:26:34,474 INFO L413 NwaCegarLoop]: 735 mSDtfsCounter, 2274 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 6554 mSolverCounterSat, 1409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 7963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1409 IncrementalHoareTripleChecker+Valid, 6554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:34,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7210 Invalid, 7963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1409 Valid, 6554 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 12:26:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2022-07-12 12:26:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 10664. [2022-07-12 12:26:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10664 states, 7962 states have (on average 1.277945239889475) internal successors, (10175), 8147 states have internal predecessors, (10175), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1745 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-07-12 12:26:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 14183 transitions. [2022-07-12 12:26:35,251 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 14183 transitions. Word has length 178 [2022-07-12 12:26:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:35,252 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 14183 transitions. [2022-07-12 12:26:35,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-12 12:26:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 14183 transitions. [2022-07-12 12:26:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 12:26:35,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:35,287 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:35,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:35,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:35,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2022-07-12 12:26:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:35,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591373220] [2022-07-12 12:26:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:26:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:26:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 12:26:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:26:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:26:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:26:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:26:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:26:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 12:26:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 12:26:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:26:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:35,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591373220] [2022-07-12 12:26:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591373220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:35,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180558975] [2022-07-12 12:26:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:35,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:35,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:35,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:35,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:26:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:36,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 12:26:36,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:26:36,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:26:36,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:26:36,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:26:36,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:26:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:26:36,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:26:36,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1112) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-12 12:26:36,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.base|)) (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1))))) is different from false [2022-07-12 12:26:36,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-07-12 12:26:36,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-07-12 12:26:36,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180558975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:36,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:26:36,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-12 12:26:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086017089] [2022-07-12 12:26:36,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:26:36,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 12:26:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 12:26:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=537, Unknown=4, NotChecked=196, Total=812 [2022-07-12 12:26:36,949 INFO L87 Difference]: Start difference. First operand 10664 states and 14183 transitions. Second operand has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:26:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:42,797 INFO L93 Difference]: Finished difference Result 21451 states and 29179 transitions. [2022-07-12 12:26:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 12:26:42,798 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) Word has length 180 [2022-07-12 12:26:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:42,862 INFO L225 Difference]: With dead ends: 21451 [2022-07-12 12:26:42,862 INFO L226 Difference]: Without dead ends: 14327 [2022-07-12 12:26:42,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=1105, Unknown=4, NotChecked=284, Total=1560 [2022-07-12 12:26:42,893 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1677 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 7775 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 12917 SdHoareTripleChecker+Invalid, 8654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 7775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:42,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 12917 Invalid, 8654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 7775 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 12:26:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2022-07-12 12:26:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 10672. [2022-07-12 12:26:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10672 states, 7970 states have (on average 1.2774153074027603) internal successors, (10181), 8151 states have internal predecessors, (10181), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1749 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-07-12 12:26:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 14189 transitions. [2022-07-12 12:26:43,700 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 14189 transitions. Word has length 180 [2022-07-12 12:26:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:43,701 INFO L495 AbstractCegarLoop]: Abstraction has 10672 states and 14189 transitions. [2022-07-12 12:26:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:26:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 14189 transitions. [2022-07-12 12:26:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 12:26:43,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:43,731 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 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 12:26:43,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:43,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 12:26:43,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104041, now seen corresponding path program 2 times [2022-07-12 12:26:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:43,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620721727] [2022-07-12 12:26:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:26:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:26:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:26:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:26:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 12:26:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:26:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:26:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 12:26:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 12:26:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:26:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:26:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620721727] [2022-07-12 12:26:44,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620721727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415523879] [2022-07-12 12:26:44,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:26:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:26:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:44,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:26:44,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 12:26:44,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:26:44,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:26:44,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 12:26:44,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:26:44,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 12:26:45,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 12:26:45,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:26:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 12:26:45,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:26:46,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1316) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1318) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-12 12:26:47,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-12 12:26:47,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-12 12:26:48,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_1316) 930 v_ArrVal_1318) 0 v_ArrVal_1320)) 26) 1))) is different from false [2022-07-12 12:26:48,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415523879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:26:48,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:26:48,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-12 12:26:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268825274] [2022-07-12 12:26:48,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:26:48,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 12:26:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 12:26:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-07-12 12:26:48,407 INFO L87 Difference]: Start difference. First operand 10672 states and 14189 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-07-12 12:26:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:54,947 INFO L93 Difference]: Finished difference Result 21705 states and 29574 transitions. [2022-07-12 12:26:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 12:26:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) Word has length 186 [2022-07-12 12:26:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:55,001 INFO L225 Difference]: With dead ends: 21705 [2022-07-12 12:26:55,001 INFO L226 Difference]: Without dead ends: 14577 [2022-07-12 12:26:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=214, Invalid=1604, Unknown=4, NotChecked=340, Total=2162 [2022-07-12 12:26:55,021 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 1578 mSDsluCounter, 13575 mSDsCounter, 0 mSdLazyCounter, 8954 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 14800 SdHoareTripleChecker+Invalid, 9621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 8954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 14800 Invalid, 9621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [667 Valid, 8954 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 12:26:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2022-07-12 12:26:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11553. [2022-07-12 12:26:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11553 states, 8645 states have (on average 1.2766917293233082) internal successors, (11037), 8832 states have internal predecessors, (11037), 1938 states have call successors, (1938), 886 states have call predecessors, (1938), 969 states have return successors, (2344), 1874 states have call predecessors, (2344), 1937 states have call successors, (2344) [2022-07-12 12:26:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 15319 transitions. [2022-07-12 12:26:55,812 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 15319 transitions. Word has length 186 [2022-07-12 12:26:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:55,813 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 15319 transitions. [2022-07-12 12:26:55,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-07-12 12:26:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 15319 transitions. [2022-07-12 12:26:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 12:26:55,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:55,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:26:55,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 12:26:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 12:26:56,076 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1275845430, now seen corresponding path program 3 times [2022-07-12 12:26:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750427232] [2022-07-12 12:26:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:26:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:26:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:26:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:26:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:26:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:26:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:26:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:26:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:26:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:26:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 12:26:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750427232] [2022-07-12 12:26:56,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750427232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:56,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:56,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:26:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812431588] [2022-07-12 12:26:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:56,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:26:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:26:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:26:56,377 INFO L87 Difference]: Start difference. First operand 11553 states and 15319 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:26:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:26:58,336 INFO L93 Difference]: Finished difference Result 22019 states and 30032 transitions. [2022-07-12 12:26:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:26:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-07-12 12:26:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:26:58,390 INFO L225 Difference]: With dead ends: 22019 [2022-07-12 12:26:58,391 INFO L226 Difference]: Without dead ends: 14867 [2022-07-12 12:26:58,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:26:58,410 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 901 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:26:58,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2654 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:26:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2022-07-12 12:26:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 11537. [2022-07-12 12:26:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11537 states, 8637 states have (on average 1.2760217668171818) internal successors, (11021), 8824 states have internal predecessors, (11021), 1930 states have call successors, (1930), 886 states have call predecessors, (1930), 969 states have return successors, (2332), 1866 states have call predecessors, (2332), 1929 states have call successors, (2332) [2022-07-12 12:26:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 15283 transitions. [2022-07-12 12:26:59,256 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 15283 transitions. Word has length 194 [2022-07-12 12:26:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:26:59,257 INFO L495 AbstractCegarLoop]: Abstraction has 11537 states and 15283 transitions. [2022-07-12 12:26:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:26:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 15283 transitions. [2022-07-12 12:26:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 12:26:59,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:59,277 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:26:59,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 12:26:59,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -276664566, now seen corresponding path program 1 times [2022-07-12 12:26:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:59,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720947319] [2022-07-12 12:26:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:26:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:26:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:26:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:26:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:26:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:26:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:26:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:26:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:26:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:26:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:26:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:26:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:26:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:26:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:26:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:26:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 12:26:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:59,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720947319] [2022-07-12 12:26:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720947319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:26:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270907283] [2022-07-12 12:26:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:59,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:26:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:26:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:26:59,650 INFO L87 Difference]: Start difference. First operand 11537 states and 15283 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:27:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:01,762 INFO L93 Difference]: Finished difference Result 19701 states and 26376 transitions. [2022-07-12 12:27:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:27:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 194 [2022-07-12 12:27:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:01,824 INFO L225 Difference]: With dead ends: 19701 [2022-07-12 12:27:01,825 INFO L226 Difference]: Without dead ends: 12565 [2022-07-12 12:27:01,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:27:01,855 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 858 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:01,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2369 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 12:27:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2022-07-12 12:27:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11557. [2022-07-12 12:27:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11557 states, 8653 states have (on average 1.2755113833352594) internal successors, (11037), 8836 states have internal predecessors, (11037), 1934 states have call successors, (1934), 886 states have call predecessors, (1934), 969 states have return successors, (2336), 1874 states have call predecessors, (2336), 1933 states have call successors, (2336) [2022-07-12 12:27:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 15307 transitions. [2022-07-12 12:27:02,739 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 15307 transitions. Word has length 194 [2022-07-12 12:27:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:02,740 INFO L495 AbstractCegarLoop]: Abstraction has 11557 states and 15307 transitions. [2022-07-12 12:27:02,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:27:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 15307 transitions. [2022-07-12 12:27:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-12 12:27:02,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:02,756 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:02,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 12:27:02,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 454006962, now seen corresponding path program 2 times [2022-07-12 12:27:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:02,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174358522] [2022-07-12 12:27:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:27:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:27:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:27:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:27:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 12:27:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:27:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:27:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:27:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:27:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 12:27:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:27:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 12:27:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174358522] [2022-07-12 12:27:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174358522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551825168] [2022-07-12 12:27:03,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:27:03,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:03,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:27:03,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 12:27:03,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:27:03,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:27:03,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 2251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 12:27:03,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:03,873 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-12 12:27:03,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-07-12 12:27:03,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:27:04,039 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 12:27:04,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-12 12:27:04,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 12:27:04,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 12:27:04,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 12:27:04,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:04,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:04,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:04,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:27:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 12:27:04,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:04,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-12 12:27:04,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-12 12:27:04,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551825168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:04,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:27:04,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2022-07-12 12:27:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957184680] [2022-07-12 12:27:04,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:04,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 12:27:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:04,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 12:27:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1086, Unknown=9, NotChecked=134, Total=1332 [2022-07-12 12:27:04,733 INFO L87 Difference]: Start difference. First operand 11557 states and 15307 transitions. Second operand has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-07-12 12:27:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:13,509 INFO L93 Difference]: Finished difference Result 22741 states and 30552 transitions. [2022-07-12 12:27:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 12:27:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) Word has length 200 [2022-07-12 12:27:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:13,553 INFO L225 Difference]: With dead ends: 22741 [2022-07-12 12:27:13,553 INFO L226 Difference]: Without dead ends: 15561 [2022-07-12 12:27:13,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=404, Invalid=3499, Unknown=11, NotChecked=246, Total=4160 [2022-07-12 12:27:13,571 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 2382 mSDsluCounter, 13928 mSDsCounter, 0 mSdLazyCounter, 10041 mSolverCounterSat, 1189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 14922 SdHoareTripleChecker+Invalid, 12080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1189 IncrementalHoareTripleChecker+Valid, 10041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:13,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 14922 Invalid, 12080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1189 Valid, 10041 Invalid, 0 Unknown, 850 Unchecked, 6.9s Time] [2022-07-12 12:27:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2022-07-12 12:27:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 13109. [2022-07-12 12:27:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 9840 states have (on average 1.2760162601626017) internal successors, (12556), 10027 states have internal predecessors, (12556), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1100 states have return successors, (2588), 2092 states have call predecessors, (2588), 2167 states have call successors, (2588) [2022-07-12 12:27:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 17312 transitions. [2022-07-12 12:27:14,507 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 17312 transitions. Word has length 200 [2022-07-12 12:27:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:14,508 INFO L495 AbstractCegarLoop]: Abstraction has 13109 states and 17312 transitions. [2022-07-12 12:27:14,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-07-12 12:27:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 17312 transitions. [2022-07-12 12:27:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-12 12:27:14,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:14,533 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:14,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 12:27:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:14,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1863810439, now seen corresponding path program 1 times [2022-07-12 12:27:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139597537] [2022-07-12 12:27:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:27:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:27:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:27:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:27:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:27:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:27:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:27:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:27:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 12:27:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 12:27:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 12:27:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 12:27:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139597537] [2022-07-12 12:27:15,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139597537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:15,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:15,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:27:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271957285] [2022-07-12 12:27:15,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:15,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:27:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:27:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:27:15,171 INFO L87 Difference]: Start difference. First operand 13109 states and 17312 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 12:27:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:17,742 INFO L93 Difference]: Finished difference Result 23691 states and 32221 transitions. [2022-07-12 12:27:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:27:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 211 [2022-07-12 12:27:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:17,820 INFO L225 Difference]: With dead ends: 23691 [2022-07-12 12:27:17,821 INFO L226 Difference]: Without dead ends: 16503 [2022-07-12 12:27:17,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:27:17,855 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 917 mSDsluCounter, 3507 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:17,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4353 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 12:27:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2022-07-12 12:27:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 13137. [2022-07-12 12:27:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13137 states, 9860 states have (on average 1.2766734279918863) internal successors, (12588), 10055 states have internal predecessors, (12588), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-12 12:27:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 17376 transitions. [2022-07-12 12:27:18,833 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 17376 transitions. Word has length 211 [2022-07-12 12:27:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:18,834 INFO L495 AbstractCegarLoop]: Abstraction has 13137 states and 17376 transitions. [2022-07-12 12:27:18,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 12:27:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 17376 transitions. [2022-07-12 12:27:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 12:27:18,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:18,869 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:18,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 12:27:18,870 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1503128751, now seen corresponding path program 1 times [2022-07-12 12:27:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:18,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236947979] [2022-07-12 12:27:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:27:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:27:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:27:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:27:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:27:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:27:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:27:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:27:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 12:27:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 12:27:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:27:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 12:27:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:19,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236947979] [2022-07-12 12:27:19,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236947979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:19,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899585700] [2022-07-12 12:27:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:19,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:19,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:19,255 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:27:19,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 12:27:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 12:27:19,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-12 12:27:19,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 12:27:20,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899585700] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:20,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:27:20,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2022-07-12 12:27:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147488289] [2022-07-12 12:27:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:20,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:27:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:20,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:27:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:27:20,030 INFO L87 Difference]: Start difference. First operand 13137 states and 17376 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:27:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:20,923 INFO L93 Difference]: Finished difference Result 20397 states and 27455 transitions. [2022-07-12 12:27:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:27:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 212 [2022-07-12 12:27:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:20,963 INFO L225 Difference]: With dead ends: 20397 [2022-07-12 12:27:20,963 INFO L226 Difference]: Without dead ends: 13181 [2022-07-12 12:27:20,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 461 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:27:20,980 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 3 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:20,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1962 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:27:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13181 states. [2022-07-12 12:27:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13181 to 13157. [2022-07-12 12:27:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13157 states, 9880 states have (on average 1.2765182186234818) internal successors, (12612), 10075 states have internal predecessors, (12612), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-12 12:27:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 17400 transitions. [2022-07-12 12:27:21,787 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 17400 transitions. Word has length 212 [2022-07-12 12:27:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:21,788 INFO L495 AbstractCegarLoop]: Abstraction has 13157 states and 17400 transitions. [2022-07-12 12:27:21,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:27:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 17400 transitions. [2022-07-12 12:27:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 12:27:21,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:21,811 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:21,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 12:27:22,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:22,013 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash -361861751, now seen corresponding path program 1 times [2022-07-12 12:27:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:22,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202716835] [2022-07-12 12:27:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:27:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:27:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:27:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:27:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:27:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:27:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:27:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:27:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:27:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 12:27:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 12:27:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-12 12:27:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:22,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202716835] [2022-07-12 12:27:22,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202716835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:22,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919388918] [2022-07-12 12:27:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:22,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:22,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:27:22,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 12:27:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:23,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 12:27:23,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:23,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 12:27:23,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:27:23,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:23,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 12:27:23,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 12:27:23,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:27:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 91 proven. 19 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 12:27:23,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:24,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2721) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2720) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-12 12:27:25,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-12 12:27:26,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-12 12:27:26,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_2721) 930 v_ArrVal_2720) 0 v_ArrVal_2722)) 26) 1))) is different from false [2022-07-12 12:27:26,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919388918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:26,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:27:26,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2022-07-12 12:27:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625270168] [2022-07-12 12:27:26,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:26,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 12:27:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 12:27:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=790, Unknown=4, NotChecked=236, Total=1122 [2022-07-12 12:27:26,953 INFO L87 Difference]: Start difference. First operand 13157 states and 17400 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-12 12:27:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:34,604 INFO L93 Difference]: Finished difference Result 27093 states and 36763 transitions. [2022-07-12 12:27:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 12:27:34,605 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 213 [2022-07-12 12:27:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:34,657 INFO L225 Difference]: With dead ends: 27093 [2022-07-12 12:27:34,657 INFO L226 Difference]: Without dead ends: 19847 [2022-07-12 12:27:34,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=488, Invalid=3814, Unknown=4, NotChecked=524, Total=4830 [2022-07-12 12:27:34,680 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2123 mSDsluCounter, 12718 mSDsCounter, 0 mSdLazyCounter, 8862 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 13967 SdHoareTripleChecker+Invalid, 10716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 8862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:34,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 13967 Invalid, 10716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 8862 Invalid, 0 Unknown, 710 Unchecked, 5.5s Time] [2022-07-12 12:27:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2022-07-12 12:27:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 13173. [2022-07-12 12:27:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13173 states, 9896 states have (on average 1.276879547291835) internal successors, (12636), 10091 states have internal predecessors, (12636), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-12 12:27:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 17424 transitions. [2022-07-12 12:27:35,649 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 17424 transitions. Word has length 213 [2022-07-12 12:27:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:35,649 INFO L495 AbstractCegarLoop]: Abstraction has 13173 states and 17424 transitions. [2022-07-12 12:27:35,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-12 12:27:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 17424 transitions. [2022-07-12 12:27:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 12:27:35,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:35,669 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:35,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 12:27:35,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:35,869 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 2 times [2022-07-12 12:27:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706340290] [2022-07-12 12:27:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:27:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:27:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:27:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 12:27:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:27:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:27:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:27:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 12:27:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:27:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 12:27:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:27:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-12 12:27:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:36,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706340290] [2022-07-12 12:27:36,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706340290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:36,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909807691] [2022-07-12 12:27:36,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:27:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:36,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:27:36,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 12:27:37,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:27:37,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:27:37,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 12:27:37,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:37,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 12:27:37,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:27:37,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:37,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 12:27:37,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 12:27:37,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:27:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 12:27:37,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:38,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3299) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3301) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-12 12:27:39,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-12 12:27:40,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-12 12:27:40,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_3299) 930 v_ArrVal_3301) 0 v_ArrVal_3304)) 26) 1))) is different from false [2022-07-12 12:27:40,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909807691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:40,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:27:40,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2022-07-12 12:27:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916676712] [2022-07-12 12:27:40,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:40,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 12:27:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:40,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 12:27:40,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=907, Unknown=4, NotChecked=252, Total=1260 [2022-07-12 12:27:40,867 INFO L87 Difference]: Start difference. First operand 13173 states and 17424 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-12 12:27:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:51,230 INFO L93 Difference]: Finished difference Result 30123 states and 40915 transitions. [2022-07-12 12:27:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-12 12:27:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 214 [2022-07-12 12:27:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:51,296 INFO L225 Difference]: With dead ends: 30123 [2022-07-12 12:27:51,297 INFO L226 Difference]: Without dead ends: 22861 [2022-07-12 12:27:51,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=530, Invalid=4174, Unknown=4, NotChecked=548, Total=5256 [2022-07-12 12:27:51,323 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2058 mSDsluCounter, 17594 mSDsCounter, 0 mSdLazyCounter, 12132 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 19048 SdHoareTripleChecker+Invalid, 14301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 12132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:51,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 19048 Invalid, 14301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1078 Valid, 12132 Invalid, 0 Unknown, 1091 Unchecked, 8.0s Time] [2022-07-12 12:27:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2022-07-12 12:27:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 13187. [2022-07-12 12:27:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13187 states, 9908 states have (on average 1.2774525635849818) internal successors, (12657), 10103 states have internal predecessors, (12657), 2169 states have call successors, (2169), 1030 states have call predecessors, (2169), 1109 states have return successors, (2622), 2093 states have call predecessors, (2622), 2168 states have call successors, (2622) [2022-07-12 12:27:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13187 states to 13187 states and 17448 transitions. [2022-07-12 12:27:52,335 INFO L78 Accepts]: Start accepts. Automaton has 13187 states and 17448 transitions. Word has length 214 [2022-07-12 12:27:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:52,336 INFO L495 AbstractCegarLoop]: Abstraction has 13187 states and 17448 transitions. [2022-07-12 12:27:52,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-12 12:27:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13187 states and 17448 transitions. [2022-07-12 12:27:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 12:27:52,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:52,355 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:27:52,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 12:27:52,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 12:27:52,560 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -266252569, now seen corresponding path program 1 times [2022-07-12 12:27:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:52,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710439432] [2022-07-12 12:27:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:27:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:27:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:27:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:27:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:27:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:27:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 12:27:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:27:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:27:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 12:27:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 12:27:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:27:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-12 12:27:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:53,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710439432] [2022-07-12 12:27:53,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710439432] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:53,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453336874] [2022-07-12 12:27:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:53,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:53,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:27:53,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 12:27:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:53,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 12:27:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:54,146 INFO L356 Elim1Store]: treesize reduction 79, result has 32.5 percent of original size [2022-07-12 12:27:54,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 49 [2022-07-12 12:27:54,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:27:54,303 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 12:27:54,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-12 12:27:54,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 12:27:54,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 12:27:54,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 12:27:54,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:54,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:54,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:54,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:27:54,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:27:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 12:27:54,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:54,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)) 0))) is different from false [2022-07-12 12:27:54,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-07-12 12:27:54,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-07-12 12:27:54,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453336874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:54,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:27:54,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2022-07-12 12:27:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357462158] [2022-07-12 12:27:54,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 12:27:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 12:27:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1229, Unknown=5, NotChecked=216, Total=1560 [2022-07-12 12:27:54,982 INFO L87 Difference]: Start difference. First operand 13187 states and 17448 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-12 12:28:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:05,417 INFO L93 Difference]: Finished difference Result 25121 states and 34447 transitions. [2022-07-12 12:28:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 12:28:05,418 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 212 [2022-07-12 12:28:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:05,473 INFO L225 Difference]: With dead ends: 25121 [2022-07-12 12:28:05,473 INFO L226 Difference]: Without dead ends: 17861 [2022-07-12 12:28:05,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=3222, Unknown=5, NotChecked=354, Total=3906 [2022-07-12 12:28:05,496 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1474 mSDsluCounter, 15962 mSDsCounter, 0 mSdLazyCounter, 10129 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 17131 SdHoareTripleChecker+Invalid, 11463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 10129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:05,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 17131 Invalid, 11463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [646 Valid, 10129 Invalid, 0 Unknown, 688 Unchecked, 8.4s Time] [2022-07-12 12:28:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2022-07-12 12:28:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 13433. [2022-07-12 12:28:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13433 states, 10140 states have (on average 1.2837278106508876) internal successors, (13017), 10334 states have internal predecessors, (13017), 2176 states have call successors, (2176), 1037 states have call predecessors, (2176), 1116 states have return successors, (2632), 2101 states have call predecessors, (2632), 2175 states have call successors, (2632) [2022-07-12 12:28:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 17825 transitions. [2022-07-12 12:28:06,520 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 17825 transitions. Word has length 212 [2022-07-12 12:28:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:06,521 INFO L495 AbstractCegarLoop]: Abstraction has 13433 states and 17825 transitions. [2022-07-12 12:28:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-12 12:28:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 17825 transitions. [2022-07-12 12:28:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 12:28:06,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:06,553 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:06,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 12:28:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 12:28:06,760 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 582910906, now seen corresponding path program 2 times [2022-07-12 12:28:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827916472] [2022-07-12 12:28:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:28:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:28:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 12:28:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:28:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:28:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:28:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 12:28:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:28:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 12:28:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 12:28:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:28:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-12 12:28:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:07,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827916472] [2022-07-12 12:28:07,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827916472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:07,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722488197] [2022-07-12 12:28:07,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:28:07,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:07,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:07,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:28:07,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 12:28:08,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:28:08,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:28:08,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 12:28:08,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:08,446 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-12 12:28:08,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-07-12 12:28:08,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:28:08,609 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 12:28:08,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-12 12:28:08,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 12:28:08,722 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 12:28:08,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 12:28:08,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:08,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:08,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:08,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:08,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:09,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:09,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:28:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 67 proven. 24 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 12:28:09,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:28:09,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-12 12:28:09,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-12 12:28:09,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-12 12:28:09,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 4 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-12 12:28:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722488197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:09,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:28:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2022-07-12 12:28:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342695756] [2022-07-12 12:28:09,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:28:09,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 12:28:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 12:28:09,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1358, Unknown=11, NotChecked=308, Total=1806 [2022-07-12 12:28:09,458 INFO L87 Difference]: Start difference. First operand 13433 states and 17825 transitions. Second operand has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-12 12:28:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:19,041 INFO L93 Difference]: Finished difference Result 26943 states and 37126 transitions. [2022-07-12 12:28:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 12:28:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 215 [2022-07-12 12:28:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:19,112 INFO L225 Difference]: With dead ends: 26943 [2022-07-12 12:28:19,112 INFO L226 Difference]: Without dead ends: 19675 [2022-07-12 12:28:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=510, Invalid=4896, Unknown=12, NotChecked=588, Total=6006 [2022-07-12 12:28:19,134 INFO L413 NwaCegarLoop]: 1013 mSDtfsCounter, 3100 mSDsluCounter, 11241 mSDsCounter, 0 mSdLazyCounter, 8648 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3202 SdHoareTripleChecker+Valid, 12254 SdHoareTripleChecker+Invalid, 10847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 8648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:19,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3202 Valid, 12254 Invalid, 10847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 8648 Invalid, 0 Unknown, 528 Unchecked, 7.0s Time] [2022-07-12 12:28:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19675 states. [2022-07-12 12:28:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19675 to 13461. [2022-07-12 12:28:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13461 states, 10168 states have (on average 1.2839299763965382) internal successors, (13055), 10362 states have internal predecessors, (13055), 2176 states have call successors, (2176), 1037 states have call predecessors, (2176), 1116 states have return successors, (2632), 2101 states have call predecessors, (2632), 2175 states have call successors, (2632) [2022-07-12 12:28:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 17863 transitions. [2022-07-12 12:28:20,133 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 17863 transitions. Word has length 215 [2022-07-12 12:28:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:20,133 INFO L495 AbstractCegarLoop]: Abstraction has 13461 states and 17863 transitions. [2022-07-12 12:28:20,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-12 12:28:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 17863 transitions. [2022-07-12 12:28:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 12:28:20,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:20,160 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2022-07-12 12:28:20,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 12:28:20,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 12:28:20,388 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 565303061, now seen corresponding path program 3 times [2022-07-12 12:28:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:20,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894654795] [2022-07-12 12:28:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:28:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:28:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:28:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:28:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:28:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:28:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:28:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:28:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:28:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 12:28:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 12:28:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 12:28:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-12 12:28:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:21,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894654795] [2022-07-12 12:28:21,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894654795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174758456] [2022-07-12 12:28:21,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 12:28:21,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:21,116 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:28:21,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 12:28:21,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-12 12:28:21,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:28:21,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 12:28:21,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-07-12 12:28:22,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:22,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174758456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:22,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:22,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-07-12 12:28:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340162534] [2022-07-12 12:28:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:28:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:28:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:28:22,005 INFO L87 Difference]: Start difference. First operand 13461 states and 17863 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:28:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:24,540 INFO L93 Difference]: Finished difference Result 26117 states and 35120 transitions. [2022-07-12 12:28:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:28:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 224 [2022-07-12 12:28:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:24,593 INFO L225 Difference]: With dead ends: 26117 [2022-07-12 12:28:24,594 INFO L226 Difference]: Without dead ends: 18831 [2022-07-12 12:28:24,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-12 12:28:24,613 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1049 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:24,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 4211 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 12:28:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2022-07-12 12:28:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 16595. [2022-07-12 12:28:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16595 states, 12528 states have (on average 1.2802522349936143) internal successors, (16039), 12752 states have internal predecessors, (16039), 2698 states have call successors, (2698), 1281 states have call predecessors, (2698), 1368 states have return successors, (3180), 2617 states have call predecessors, (3180), 2697 states have call successors, (3180) [2022-07-12 12:28:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 21917 transitions. [2022-07-12 12:28:25,980 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 21917 transitions. Word has length 224 [2022-07-12 12:28:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:25,980 INFO L495 AbstractCegarLoop]: Abstraction has 16595 states and 21917 transitions. [2022-07-12 12:28:25,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:28:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 21917 transitions. [2022-07-12 12:28:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-12 12:28:26,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:26,004 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:26,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 12:28:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 12:28:26,216 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -935054258, now seen corresponding path program 1 times [2022-07-12 12:28:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:26,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819696471] [2022-07-12 12:28:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:28:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:28:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:28:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:28:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:28:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:28:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:28:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:28:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:28:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 12:28:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:28:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 12:28:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:28:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 12:28:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-12 12:28:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819696471] [2022-07-12 12:28:26,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819696471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118291252] [2022-07-12 12:28:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:26,979 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:28:26,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 12:28:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:27,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 12:28:27,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:28,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 12:28:28,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:28:28,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:28,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:28,054 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 12:28:28,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 12:28:28,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 12:28:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:28,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 12:28:28,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 12:28:28,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 12:28:28,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 12:28:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 119 proven. 12 refuted. 5 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 12:28:28,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:28:29,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7144) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7142) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-12 12:28:30,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_7144) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_7142) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-12 12:28:31,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_7144) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_7142) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-12 12:28:32,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_7144) 930 v_ArrVal_7142) 0 v_ArrVal_7145)) 26) 1))) is different from false [2022-07-12 12:28:32,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118291252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:32,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:28:32,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2022-07-12 12:28:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762299189] [2022-07-12 12:28:32,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:28:32,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 12:28:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 12:28:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1099, Unknown=5, NotChecked=276, Total=1482 [2022-07-12 12:28:32,005 INFO L87 Difference]: Start difference. First operand 16595 states and 21917 transitions. Second operand has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2022-07-12 12:28:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:46,003 INFO L93 Difference]: Finished difference Result 39231 states and 53618 transitions. [2022-07-12 12:28:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-12 12:28:46,004 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 251 [2022-07-12 12:28:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:46,114 INFO L225 Difference]: With dead ends: 39231 [2022-07-12 12:28:46,114 INFO L226 Difference]: Without dead ends: 28811 [2022-07-12 12:28:46,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=592, Invalid=5581, Unknown=5, NotChecked=628, Total=6806 [2022-07-12 12:28:46,147 INFO L413 NwaCegarLoop]: 1252 mSDtfsCounter, 2454 mSDsluCounter, 17620 mSDsCounter, 0 mSdLazyCounter, 12832 mSolverCounterSat, 1419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 18872 SdHoareTripleChecker+Invalid, 15080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1419 IncrementalHoareTripleChecker+Valid, 12832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 829 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:46,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 18872 Invalid, 15080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1419 Valid, 12832 Invalid, 0 Unknown, 829 Unchecked, 10.4s Time] [2022-07-12 12:28:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28811 states. [2022-07-12 12:28:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28811 to 17851. [2022-07-12 12:28:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17851 states, 13486 states have (on average 1.2846655791190864) internal successors, (17325), 13715 states have internal predecessors, (17325), 2896 states have call successors, (2896), 1391 states have call predecessors, (2896), 1468 states have return successors, (3244), 2800 states have call predecessors, (3244), 2895 states have call successors, (3244) [2022-07-12 12:28:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17851 states to 17851 states and 23465 transitions. [2022-07-12 12:28:47,815 INFO L78 Accepts]: Start accepts. Automaton has 17851 states and 23465 transitions. Word has length 251 [2022-07-12 12:28:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:47,815 INFO L495 AbstractCegarLoop]: Abstraction has 17851 states and 23465 transitions. [2022-07-12 12:28:47,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2022-07-12 12:28:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17851 states and 23465 transitions. [2022-07-12 12:28:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-12 12:28:47,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:47,842 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:47,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 12:28:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:48,043 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -853514858, now seen corresponding path program 2 times [2022-07-12 12:28:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289699729] [2022-07-12 12:28:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:28:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:28:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:28:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:28:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:28:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:28:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:28:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:28:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:28:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:28:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:28:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-12 12:28:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 12:28:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 12:28:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-07-12 12:28:48,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:48,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289699729] [2022-07-12 12:28:48,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289699729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:48,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716375171] [2022-07-12 12:28:48,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:28:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:48,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:28:48,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 12:28:49,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 12:28:49,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:28:49,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 12:28:49,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-12 12:28:49,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:49,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716375171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:49,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:49,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 24 [2022-07-12 12:28:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987132649] [2022-07-12 12:28:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:28:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:28:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-12 12:28:49,985 INFO L87 Difference]: Start difference. First operand 17851 states and 23465 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:28:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:54,373 INFO L93 Difference]: Finished difference Result 36056 states and 47605 transitions. [2022-07-12 12:28:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:28:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 252 [2022-07-12 12:28:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:54,447 INFO L225 Difference]: With dead ends: 36056 [2022-07-12 12:28:54,447 INFO L226 Difference]: Without dead ends: 25709 [2022-07-12 12:28:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:28:54,477 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 2305 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 3012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:54,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 4095 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 3012 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 12:28:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25709 states. [2022-07-12 12:28:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25709 to 21155. [2022-07-12 12:28:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21155 states, 15964 states have (on average 1.2816963167126034) internal successors, (20461), 16231 states have internal predecessors, (20461), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3354 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-12 12:28:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 27777 transitions. [2022-07-12 12:28:56,309 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 27777 transitions. Word has length 252 [2022-07-12 12:28:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:56,309 INFO L495 AbstractCegarLoop]: Abstraction has 21155 states and 27777 transitions. [2022-07-12 12:28:56,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:28:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 27777 transitions. [2022-07-12 12:28:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-12 12:28:56,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:56,341 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:56,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 12:28:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 12:28:56,542 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2103994783, now seen corresponding path program 1 times [2022-07-12 12:28:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831223836] [2022-07-12 12:28:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:28:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:28:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:28:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:28:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:28:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:28:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:28:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:28:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:28:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:28:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:28:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 12:28:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 12:28:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-12 12:28:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-12 12:28:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-12 12:28:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831223836] [2022-07-12 12:28:57,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831223836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:57,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:57,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:28:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154977274] [2022-07-12 12:28:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:57,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:28:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:28:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:28:57,100 INFO L87 Difference]: Start difference. First operand 21155 states and 27777 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:29:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:00,980 INFO L93 Difference]: Finished difference Result 40881 states and 54995 transitions. [2022-07-12 12:29:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:29:00,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 268 [2022-07-12 12:29:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:01,091 INFO L225 Difference]: With dead ends: 40881 [2022-07-12 12:29:01,091 INFO L226 Difference]: Without dead ends: 27235 [2022-07-12 12:29:01,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:29:01,134 INFO L413 NwaCegarLoop]: 903 mSDtfsCounter, 1632 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:01,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2919 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 12:29:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27235 states. [2022-07-12 12:29:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27235 to 21155. [2022-07-12 12:29:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21155 states, 15964 states have (on average 1.2814457529441243) internal successors, (20457), 16231 states have internal predecessors, (20457), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3354 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-12 12:29:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 27773 transitions. [2022-07-12 12:29:03,031 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 27773 transitions. Word has length 268 [2022-07-12 12:29:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:03,031 INFO L495 AbstractCegarLoop]: Abstraction has 21155 states and 27773 transitions. [2022-07-12 12:29:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:29:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 27773 transitions. [2022-07-12 12:29:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-12 12:29:03,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:03,057 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:03,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 12:29:03,058 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash 649205509, now seen corresponding path program 1 times [2022-07-12 12:29:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:03,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878844589] [2022-07-12 12:29:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:29:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:29:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:29:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:29:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:29:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:29:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:29:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:29:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:29:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:29:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:29:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:29:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 12:29:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 12:29:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 12:29:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-12 12:29:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 12:29:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:03,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878844589] [2022-07-12 12:29:03,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878844589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:29:03,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003957271] [2022-07-12 12:29:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:03,536 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:29:03,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 12:29:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:04,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 3443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:29:04,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-12 12:29:04,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:04,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003957271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:04,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:29:04,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-12 12:29:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518280094] [2022-07-12 12:29:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:04,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:29:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:29:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:29:04,990 INFO L87 Difference]: Start difference. First operand 21155 states and 27773 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 12:29:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:09,680 INFO L93 Difference]: Finished difference Result 63383 states and 83214 transitions. [2022-07-12 12:29:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:29:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 271 [2022-07-12 12:29:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:09,917 INFO L225 Difference]: With dead ends: 63383 [2022-07-12 12:29:09,917 INFO L226 Difference]: Without dead ends: 63375 [2022-07-12 12:29:09,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:29:09,953 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 1130 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:09,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2573 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:29:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63375 states. [2022-07-12 12:29:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63375 to 62395. [2022-07-12 12:29:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62395 states, 47152 states have (on average 1.2852265015269766) internal successors, (60601), 47967 states have internal predecessors, (60601), 10204 states have call successors, (10204), 4789 states have call predecessors, (10204), 5038 states have return successors, (11346), 9854 states have call predecessors, (11346), 10203 states have call successors, (11346) [2022-07-12 12:29:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62395 states to 62395 states and 82151 transitions. [2022-07-12 12:29:15,895 INFO L78 Accepts]: Start accepts. Automaton has 62395 states and 82151 transitions. Word has length 271 [2022-07-12 12:29:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:15,895 INFO L495 AbstractCegarLoop]: Abstraction has 62395 states and 82151 transitions. [2022-07-12 12:29:15,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 12:29:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 62395 states and 82151 transitions. [2022-07-12 12:29:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-12 12:29:15,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:15,975 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:16,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 12:29:16,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 12:29:16,176 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -361911741, now seen corresponding path program 1 times [2022-07-12 12:29:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:16,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042862744] [2022-07-12 12:29:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:29:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:29:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:29:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:29:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:29:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:29:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:29:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:29:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:29:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:29:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:29:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 12:29:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 12:29:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 12:29:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-12 12:29:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 12:29:16,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:16,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042862744] [2022-07-12 12:29:16,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042862744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:16,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:16,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:29:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479556597] [2022-07-12 12:29:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:16,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:29:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:29:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:16,717 INFO L87 Difference]: Start difference. First operand 62395 states and 82151 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 12:29:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:27,753 INFO L93 Difference]: Finished difference Result 146088 states and 199720 transitions. [2022-07-12 12:29:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 12:29:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 271 [2022-07-12 12:29:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:28,260 INFO L225 Difference]: With dead ends: 146088 [2022-07-12 12:29:28,260 INFO L226 Difference]: Without dead ends: 105214 [2022-07-12 12:29:28,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-07-12 12:29:28,354 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 3135 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 1868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1868 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:28,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3211 Valid, 2949 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1868 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 12:29:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105214 states. [2022-07-12 12:29:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105214 to 82662. [2022-07-12 12:29:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82662 states, 62259 states have (on average 1.2801683290769206) internal successors, (79702), 63364 states have internal predecessors, (79702), 13705 states have call successors, (13705), 6298 states have call predecessors, (13705), 6697 states have return successors, (15249), 13323 states have call predecessors, (15249), 13704 states have call successors, (15249) [2022-07-12 12:29:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82662 states to 82662 states and 108656 transitions. [2022-07-12 12:29:36,512 INFO L78 Accepts]: Start accepts. Automaton has 82662 states and 108656 transitions. Word has length 271 [2022-07-12 12:29:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:36,513 INFO L495 AbstractCegarLoop]: Abstraction has 82662 states and 108656 transitions. [2022-07-12 12:29:36,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 12:29:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 82662 states and 108656 transitions. [2022-07-12 12:29:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-12 12:29:36,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:36,608 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 12:29:36,608 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1711416516, now seen corresponding path program 1 times [2022-07-12 12:29:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57999215] [2022-07-12 12:29:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:29:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:29:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:29:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:29:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:29:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:29:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:29:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:29:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:29:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:29:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:29:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat