./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.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-?-3598765 [2022-07-21 10:59:44,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:59:44,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:59:44,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:59:44,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:59:44,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:59:44,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:59:44,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:59:44,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:59:44,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:59:44,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:59:44,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:59:44,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:59:44,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:59:44,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:59:44,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:59:44,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:59:44,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:59:44,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:59:44,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:59:44,451 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:59:44,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:59:44,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:59:44,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:59:44,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:59:44,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:59:44,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:59:44,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:59:44,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:59:44,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:59:44,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:59:44,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:59:44,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:59:44,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:59:44,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:59:44,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:59:44,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:59:44,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:59:44,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:59:44,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:59:44,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:59:44,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:59:44,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:59:44,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:59:44,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:59:44,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:59:44,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:59:44,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:59:44,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:59:44,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:59:44,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:59:44,490 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:59:44,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:59:44,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:59:44,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:59:44,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:59:44,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:59:44,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:59:44,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:59:44,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:59:44,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:59:44,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:59:44,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:59:44,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:59:44,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:59:44,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:59:44,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:59:44,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:59:44,494 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-21 10:59:44,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:59:44,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:59:44,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:59:44,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:59:44,815 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:59:44,817 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-21 10:59:44,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d417da63/a7fc3a7cfdb441d78018ce3bb7084490/FLAG7a340d3df [2022-07-21 10:59:45,586 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:59:45,586 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-21 10:59:45,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d417da63/a7fc3a7cfdb441d78018ce3bb7084490/FLAG7a340d3df [2022-07-21 10:59:45,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d417da63/a7fc3a7cfdb441d78018ce3bb7084490 [2022-07-21 10:59:45,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:59:45,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:59:45,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:59:45,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:59:45,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:59:45,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:59:45" (1/1) ... [2022-07-21 10:59:45,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b63b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45, skipping insertion in model container [2022-07-21 10:59:45,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:59:45" (1/1) ... [2022-07-21 10:59:45,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:59:45,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:59:46,700 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-21 10:59:47,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:59:47,083 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:59:47,206 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-21 10:59:47,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:59:47,391 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:59:47,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47 WrapperNode [2022-07-21 10:59:47,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:59:47,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:59:47,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:59:47,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:59:47,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,556 INFO L137 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1770 [2022-07-21 10:59:47,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:59:47,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:59:47,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:59:47,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:59:47,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:59:47,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:59:47,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:59:47,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:59:47,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (1/1) ... [2022-07-21 10:59:47,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:59:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:59:47,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 10:59:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 10:59:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-21 10:59:47,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-21 10:59:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 10:59:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-07-21 10:59:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-07-21 10:59:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-07-21 10:59:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-07-21 10:59:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-07-21 10:59:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-07-21 10:59:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 10:59:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 10:59:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 10:59:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 10:59:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:59:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 10:59:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 10:59:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-21 10:59:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-21 10:59:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-07-21 10:59:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-07-21 10:59:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 10:59:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 10:59:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-21 10:59:47,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-21 10:59:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 10:59:47,838 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 10:59:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 10:59:47,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 10:59:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:59:47,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:59:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-21 10:59:47,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-21 10:59:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 10:59:47,839 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 10:59:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:59:47,853 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-07-21 10:59:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-07-21 10:59:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 10:59:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:59:47,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:59:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 10:59:47,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 10:59:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-07-21 10:59:47,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-07-21 10:59:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 10:59:47,855 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 10:59:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:59:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-21 10:59:47,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-21 10:59:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:59:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 10:59:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 10:59:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-07-21 10:59:47,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-07-21 10:59:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:59:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:59:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:59:47,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:59:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-21 10:59:47,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-21 10:59:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-21 10:59:47,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-21 10:59:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:59:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-21 10:59:47,860 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-21 10:59:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:59:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:59:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-21 10:59:47,861 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-21 10:59:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 10:59:47,861 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 10:59:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 10:59:47,861 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 10:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-21 10:59:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-21 10:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-07-21 10:59:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-07-21 10:59:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 10:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 10:59:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 10:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-21 10:59:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-21 10:59:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:59:47,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:59:48,351 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:59:48,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:59:48,497 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 10:59:48,820 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-21 10:59:49,355 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:59:49,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:59:49,372 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 10:59:49,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:59:49 BoogieIcfgContainer [2022-07-21 10:59:49,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:59:49,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:59:49,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:59:49,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:59:49,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:59:45" (1/3) ... [2022-07-21 10:59:49,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a97971a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:59:49, skipping insertion in model container [2022-07-21 10:59:49,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:47" (2/3) ... [2022-07-21 10:59:49,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a97971a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:59:49, skipping insertion in model container [2022-07-21 10:59:49,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:59:49" (3/3) ... [2022-07-21 10:59:49,394 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-21 10:59:49,408 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:59:49,408 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:59:49,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:59:49,502 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@745db850, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b6be260 [2022-07-21 10:59:49,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:59:49,510 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-21 10:59:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 10:59:49,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:49,525 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-21 10:59:49,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2022-07-21 10:59:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:49,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674991598] [2022-07-21 10:59:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:49,999 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-21 10:59:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674991598] [2022-07-21 10:59:50,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674991598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:50,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:50,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799326580] [2022-07-21 10:59:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:50,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:50,044 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-21 10:59:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:51,430 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2022-07-21 10:59:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:59:51,437 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-21 10:59:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:51,470 INFO L225 Difference]: With dead ends: 1626 [2022-07-21 10:59:51,472 INFO L226 Difference]: Without dead ends: 1080 [2022-07-21 10:59:51,480 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-21 10:59:51,486 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 966 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1469 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-21 10:59:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1469 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 10:59:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-07-21 10:59:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2022-07-21 10:59:51,622 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-21 10:59:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2022-07-21 10:59:51,632 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2022-07-21 10:59:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:51,633 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2022-07-21 10:59:51,634 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-21 10:59:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2022-07-21 10:59:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 10:59:51,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:51,642 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-21 10:59:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:59:51,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2022-07-21 10:59:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450168125] [2022-07-21 10:59:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:51,807 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-21 10:59:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450168125] [2022-07-21 10:59:51,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450168125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:51,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:51,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93928641] [2022-07-21 10:59:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:51,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:51,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:51,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:51,811 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-21 10:59:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:52,449 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2022-07-21 10:59:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:59:52,450 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-21 10:59:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:52,457 INFO L225 Difference]: With dead ends: 1106 [2022-07-21 10:59:52,457 INFO L226 Difference]: Without dead ends: 1093 [2022-07-21 10:59:52,458 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-21 10:59:52,459 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 800 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 932 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:52,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 932 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 10:59:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-07-21 10:59:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2022-07-21 10:59:52,500 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-21 10:59:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2022-07-21 10:59:52,505 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2022-07-21 10:59:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:52,506 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2022-07-21 10:59:52,506 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-21 10:59:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2022-07-21 10:59:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 10:59:52,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:52,508 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-21 10:59:52,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:59:52,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2022-07-21 10:59:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:52,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024649832] [2022-07-21 10:59:52,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:52,695 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-21 10:59:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:52,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024649832] [2022-07-21 10:59:52,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024649832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6828450] [2022-07-21 10:59:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:52,699 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-21 10:59:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:54,014 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2022-07-21 10:59:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:59:54,014 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-21 10:59:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:54,026 INFO L225 Difference]: With dead ends: 3133 [2022-07-21 10:59:54,026 INFO L226 Difference]: Without dead ends: 2150 [2022-07-21 10:59:54,029 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-21 10:59:54,030 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 969 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:54,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1471 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 10:59:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-07-21 10:59:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2022-07-21 10:59:54,130 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-21 10:59:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2022-07-21 10:59:54,142 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2022-07-21 10:59:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:54,143 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2022-07-21 10:59:54,143 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-21 10:59:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2022-07-21 10:59:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 10:59:54,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:54,146 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-21 10:59:54,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:59:54,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2022-07-21 10:59:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:54,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165020865] [2022-07-21 10:59:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:54,323 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-21 10:59:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:54,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165020865] [2022-07-21 10:59:54,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165020865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:54,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:54,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431101244] [2022-07-21 10:59:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:54,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:54,326 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-21 10:59:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:54,972 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2022-07-21 10:59:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:59:54,973 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-21 10:59:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:54,984 INFO L225 Difference]: With dead ends: 2142 [2022-07-21 10:59:54,984 INFO L226 Difference]: Without dead ends: 2139 [2022-07-21 10:59:54,988 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-21 10:59:54,991 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 777 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:54,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 886 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 10:59:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-07-21 10:59:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2022-07-21 10:59:55,068 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-21 10:59:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2022-07-21 10:59:55,077 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2022-07-21 10:59:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:55,078 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2022-07-21 10:59:55,078 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-21 10:59:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2022-07-21 10:59:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 10:59:55,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:55,079 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-21 10:59:55,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:59:55,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2022-07-21 10:59:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:55,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313699068] [2022-07-21 10:59:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:55,238 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-21 10:59:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:55,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313699068] [2022-07-21 10:59:55,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313699068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:55,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:55,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128557568] [2022-07-21 10:59:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:55,241 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-21 10:59:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:55,838 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2022-07-21 10:59:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:59:55,839 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-21 10:59:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:55,850 INFO L225 Difference]: With dead ends: 2141 [2022-07-21 10:59:55,850 INFO L226 Difference]: Without dead ends: 2138 [2022-07-21 10:59:55,852 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-21 10:59:55,853 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-21 10:59:55,854 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-21 10:59:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-07-21 10:59:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2022-07-21 10:59:55,928 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-21 10:59:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2022-07-21 10:59:55,940 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2022-07-21 10:59:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:55,940 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2022-07-21 10:59:55,940 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-21 10:59:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2022-07-21 10:59:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 10:59:55,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:55,944 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-21 10:59:55,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:59:55,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2022-07-21 10:59:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:55,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278036286] [2022-07-21 10:59:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,105 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-21 10:59:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278036286] [2022-07-21 10:59:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278036286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:56,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:56,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260198394] [2022-07-21 10:59:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:56,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:56,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:56,108 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-21 10:59:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:56,713 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2022-07-21 10:59:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:59:56,714 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-21 10:59:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:56,725 INFO L225 Difference]: With dead ends: 2140 [2022-07-21 10:59:56,725 INFO L226 Difference]: Without dead ends: 2137 [2022-07-21 10:59:56,727 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-21 10:59:56,727 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-21 10:59:56,728 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-21 10:59:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-07-21 10:59:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2022-07-21 10:59:56,805 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-21 10:59:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2022-07-21 10:59:56,815 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2022-07-21 10:59:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:56,816 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2022-07-21 10:59:56,816 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-21 10:59:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2022-07-21 10:59:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 10:59:56,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:56,817 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-21 10:59:56,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:59:56,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2022-07-21 10:59:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:56,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337706919] [2022-07-21 10:59:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:56,964 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-21 10:59:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337706919] [2022-07-21 10:59:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337706919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:56,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:59:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060808275] [2022-07-21 10:59:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:59:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:59:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:59:56,967 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-21 10:59:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:57,552 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2022-07-21 10:59:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:59:57,553 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-21 10:59:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:57,565 INFO L225 Difference]: With dead ends: 2139 [2022-07-21 10:59:57,565 INFO L226 Difference]: Without dead ends: 2127 [2022-07-21 10:59:57,567 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-21 10:59:57,567 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 767 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:57,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 882 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 10:59:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-07-21 10:59:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2022-07-21 10:59:57,646 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-21 10:59:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2022-07-21 10:59:57,653 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2022-07-21 10:59:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:57,654 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2022-07-21 10:59:57,655 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-21 10:59:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2022-07-21 10:59:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 10:59:57,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:57,666 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-21 10:59:57,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:59:57,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2022-07-21 10:59:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798450832] [2022-07-21 10:59:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:59:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 10:59:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:59:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:59:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 10:59:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 10:59:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 10:59:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 10:59:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:59:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 10:59:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 10:59:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 10:59:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 10:59:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798450832] [2022-07-21 10:59:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798450832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:59:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312557668] [2022-07-21 10:59:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:57,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:59:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:59:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:59:57,921 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-21 10:59:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:59:59,438 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2022-07-21 10:59:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:59:59,439 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-21 10:59:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:59:59,459 INFO L225 Difference]: With dead ends: 5900 [2022-07-21 10:59:59,459 INFO L226 Difference]: Without dead ends: 3922 [2022-07-21 10:59:59,466 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-21 10:59:59,467 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 1540 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 849 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:59:59,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1763 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [849 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 10:59:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-07-21 10:59:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2022-07-21 10:59:59,624 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-21 10:59:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2022-07-21 10:59:59,637 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2022-07-21 10:59:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:59:59,637 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2022-07-21 10:59:59,637 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-21 10:59:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2022-07-21 10:59:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 10:59:59,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:59:59,652 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-21 10:59:59,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:59:59,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:59:59,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:59:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2022-07-21 10:59:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:59:59,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89759448] [2022-07-21 10:59:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:59:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:59:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:59:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:59:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:59:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:59:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 10:59:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 10:59:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 10:59:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 10:59:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 10:59:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 10:59:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 10:59:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 10:59:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:59:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:59:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 10:59:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 10:59:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:59:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 10:59:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:59:59,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89759448] [2022-07-21 10:59:59,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89759448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:59:59,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:59:59,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:59:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598635646] [2022-07-21 10:59:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:59:59,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:59:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:59:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:59:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:59:59,920 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-21 11:00:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:00,973 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2022-07-21 11:00:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:00:00,973 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-21 11:00:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:00,996 INFO L225 Difference]: With dead ends: 7416 [2022-07-21 11:00:00,996 INFO L226 Difference]: Without dead ends: 3916 [2022-07-21 11:00:01,010 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-21 11:00:01,011 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:01,012 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.9s Time] [2022-07-21 11:00:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-07-21 11:00:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2022-07-21 11:00:01,193 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-21 11:00:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2022-07-21 11:00:01,205 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2022-07-21 11:00:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:01,205 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2022-07-21 11:00:01,206 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-21 11:00:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2022-07-21 11:00:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 11:00:01,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:01,216 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-21 11:00:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:00:01,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2022-07-21 11:00:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700535082] [2022-07-21 11:00:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:00:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 11:00:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:00:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:00:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:00:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 11:00:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:00:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:00:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 11:00:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:00:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700535082] [2022-07-21 11:00:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700535082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821606180] [2022-07-21 11:00:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:01,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:01,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:01,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 11:00:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:02,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:00:02,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:02,163 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-21 11:00:02,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:00:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821606180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:02,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:00:02,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-21 11:00:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632631218] [2022-07-21 11:00:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:02,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:00:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:02,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:00:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:00:02,166 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-21 11:00:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:02,656 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2022-07-21 11:00:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:00:02,656 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-21 11:00:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:02,697 INFO L225 Difference]: With dead ends: 9962 [2022-07-21 11:00:02,697 INFO L226 Difference]: Without dead ends: 6458 [2022-07-21 11:00:02,711 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-21 11:00:02,712 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-21 11:00:02,713 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-21 11:00:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-07-21 11:00:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2022-07-21 11:00:02,958 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-21 11:00:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2022-07-21 11:00:02,970 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2022-07-21 11:00:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:02,970 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2022-07-21 11:00:02,971 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-21 11:00:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2022-07-21 11:00:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 11:00:02,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:02,981 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-21 11:00:03,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 11:00:03,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 11:00:03,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2022-07-21 11:00:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561181939] [2022-07-21 11:00:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:00:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 11:00:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:00:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:00:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:00:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 11:00:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:00:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:00:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:00:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:00:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:03,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561181939] [2022-07-21 11:00:03,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561181939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:03,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728884114] [2022-07-21 11:00:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:03,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:03,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:03,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 11:00:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:04,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 11:00:04,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 11:00:04,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:00:04,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728884114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:04,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:00:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-21 11:00:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020661576] [2022-07-21 11:00:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:04,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:00:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:04,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:00:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:00:04,181 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-21 11:00:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:05,384 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2022-07-21 11:00:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 11:00:05,385 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-21 11:00:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:05,438 INFO L225 Difference]: With dead ends: 14900 [2022-07-21 11:00:05,438 INFO L226 Difference]: Without dead ends: 11384 [2022-07-21 11:00:05,453 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-21 11:00:05,454 INFO L413 NwaCegarLoop]: 1728 mSDtfsCounter, 1640 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 11:00:05,455 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-21 11:00:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2022-07-21 11:00:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2022-07-21 11:00:05,974 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-21 11:00:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2022-07-21 11:00:05,996 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2022-07-21 11:00:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:05,998 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2022-07-21 11:00:05,998 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-21 11:00:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2022-07-21 11:00:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 11:00:06,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:06,014 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-21 11:00:06,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 11:00:06,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 11:00:06,236 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2022-07-21 11:00:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:06,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152848019] [2022-07-21 11:00:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:00:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 11:00:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:00:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:00:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:00:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 11:00:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 11:00:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:00:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:00:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 11:00:06,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:06,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152848019] [2022-07-21 11:00:06,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152848019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:06,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951163807] [2022-07-21 11:00:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:06,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:06,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:06,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 11:00:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:07,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 11:00:07,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:07,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:00:07,358 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-21 11:00:07,388 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-21 11:00:07,407 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-21 11:00:07,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:00:07,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951163807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:07,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:00:07,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2022-07-21 11:00:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278407419] [2022-07-21 11:00:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:07,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 11:00:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 11:00:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:00:07,410 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-21 11:00:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:10,624 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2022-07-21 11:00:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 11:00:10,625 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-21 11:00:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:10,662 INFO L225 Difference]: With dead ends: 16712 [2022-07-21 11:00:10,662 INFO L226 Difference]: Without dead ends: 9632 [2022-07-21 11:00:10,690 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-21 11:00:10,691 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 669 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:10,691 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.6s Time] [2022-07-21 11:00:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-07-21 11:00:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2022-07-21 11:00:11,201 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-21 11:00:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2022-07-21 11:00:11,228 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2022-07-21 11:00:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:11,229 INFO L495 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2022-07-21 11:00:11,229 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-21 11:00:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2022-07-21 11:00:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-21 11:00:11,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:11,254 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-21 11:00:11,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 11:00:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:11,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2022-07-21 11:00:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779221703] [2022-07-21 11:00:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:00:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:00:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 11:00:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:00:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 11:00:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 11:00:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:00:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:00:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 11:00:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 11:00:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 11:00:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:11,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779221703] [2022-07-21 11:00:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779221703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252505206] [2022-07-21 11:00:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:11,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:11,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 11:00:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:12,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 11:00:12,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:12,594 INFO L356 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-07-21 11:00:12,595 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-21 11:00:12,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:00:12,896 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:00:12,896 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-21 11:00:12,976 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-21 11:00:13,008 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-21 11:00:13,029 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-21 11:00:13,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:00:13,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252505206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:13,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:00:13,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2022-07-21 11:00:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224988211] [2022-07-21 11:00:13,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:00:13,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 11:00:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 11:00:13,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-07-21 11:00:13,321 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-21 11:00:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:18,897 INFO L93 Difference]: Finished difference Result 21557 states and 29035 transitions. [2022-07-21 11:00:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-21 11:00:18,898 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-21 11:00:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:18,953 INFO L225 Difference]: With dead ends: 21557 [2022-07-21 11:00:18,953 INFO L226 Difference]: Without dead ends: 13589 [2022-07-21 11:00:18,986 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-21 11:00:18,987 INFO L413 NwaCegarLoop]: 735 mSDtfsCounter, 2274 mSDsluCounter, 6477 mSDsCounter, 0 mSdLazyCounter, 6568 mSolverCounterSat, 1408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7212 SdHoareTripleChecker+Invalid, 7976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 6568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:18,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7212 Invalid, 7976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1408 Valid, 6568 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 11:00:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2022-07-21 11:00:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 10664. [2022-07-21 11:00:19,664 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-21 11:00:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 14183 transitions. [2022-07-21 11:00:19,695 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 14183 transitions. Word has length 178 [2022-07-21 11:00:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:19,696 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 14183 transitions. [2022-07-21 11:00:19,696 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-21 11:00:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 14183 transitions. [2022-07-21 11:00:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-21 11:00:19,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:19,722 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-21 11:00:19,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 11:00:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:19,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2022-07-21 11:00:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820327065] [2022-07-21 11:00:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:00:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 11:00:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 11:00:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 11:00:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 11:00:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 11:00:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 11:00:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 11:00:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 11:00:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,268 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-21 11:00:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820327065] [2022-07-21 11:00:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820327065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96530806] [2022-07-21 11:00:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:20,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:20,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 11:00:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:20,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 11:00:20,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:21,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:00:21,021 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-21 11:00:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:00:21,057 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-21 11:00:21,117 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-21 11:00:21,134 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-21 11:00:21,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:00:21,222 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-21 11:00:21,259 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-21 11:00:21,274 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-21 11:00:21,288 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-21 11:00:21,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96530806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:21,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:00:21,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-21 11:00:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961317832] [2022-07-21 11:00:21,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:00:21,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 11:00:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 11:00:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=537, Unknown=4, NotChecked=196, Total=812 [2022-07-21 11:00:21,292 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-21 11:00:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:26,790 INFO L93 Difference]: Finished difference Result 21451 states and 29179 transitions. [2022-07-21 11:00:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 11:00:26,790 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-21 11:00:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:26,849 INFO L225 Difference]: With dead ends: 21451 [2022-07-21 11:00:26,849 INFO L226 Difference]: Without dead ends: 14327 [2022-07-21 11:00:26,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1105, Unknown=4, NotChecked=284, Total=1560 [2022-07-21 11:00:26,876 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1677 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 7759 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 12917 SdHoareTripleChecker+Invalid, 8640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 7759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:26,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 12917 Invalid, 8640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 7759 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 11:00:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2022-07-21 11:00:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 10672. [2022-07-21 11:00:27,469 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-21 11:00:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 14189 transitions. [2022-07-21 11:00:27,502 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 14189 transitions. Word has length 180 [2022-07-21 11:00:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:27,502 INFO L495 AbstractCegarLoop]: Abstraction has 10672 states and 14189 transitions. [2022-07-21 11:00:27,503 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-21 11:00:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 14189 transitions. [2022-07-21 11:00:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-21 11:00:27,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:27,528 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-21 11:00:27,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 11:00:27,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 11:00:27,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104041, now seen corresponding path program 2 times [2022-07-21 11:00:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:27,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033240542] [2022-07-21 11:00:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:00:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 11:00:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 11:00:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 11:00:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 11:00:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:00:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:00:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 11:00:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 11:00:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:00:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:28,040 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-21 11:00:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033240542] [2022-07-21 11:00:28,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033240542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276568344] [2022-07-21 11:00:28,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:00:28,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:28,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:28,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:28,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 11:00:28,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:00:28,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:00:28,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-21 11:00:28,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:28,812 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-21 11:00:28,851 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-21 11:00:28,909 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-21 11:00:28,924 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-21 11:00:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:00:29,980 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-21 11:00:30,772 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-21 11:00:31,625 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-21 11:00:32,208 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-21 11:00:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276568344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:32,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:00:32,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-21 11:00:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336609530] [2022-07-21 11:00:32,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:00:32,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 11:00:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:32,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 11:00:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-07-21 11:00:32,211 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-21 11:00:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:38,280 INFO L93 Difference]: Finished difference Result 21705 states and 29574 transitions. [2022-07-21 11:00:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 11:00:38,281 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-21 11:00:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:38,339 INFO L225 Difference]: With dead ends: 21705 [2022-07-21 11:00:38,339 INFO L226 Difference]: Without dead ends: 14577 [2022-07-21 11:00:38,361 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-21 11:00:38,361 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 1578 mSDsluCounter, 13570 mSDsCounter, 0 mSdLazyCounter, 8952 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 14795 SdHoareTripleChecker+Invalid, 9617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 8952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:38,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 14795 Invalid, 9617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 8952 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 11:00:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2022-07-21 11:00:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11553. [2022-07-21 11:00:39,181 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-21 11:00:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 15319 transitions. [2022-07-21 11:00:39,210 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 15319 transitions. Word has length 186 [2022-07-21 11:00:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:39,210 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 15319 transitions. [2022-07-21 11:00:39,210 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-21 11:00:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 15319 transitions. [2022-07-21 11:00:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 11:00:39,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:39,239 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-21 11:00:39,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 11:00:39,466 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-21 11:00:39,467 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1275845430, now seen corresponding path program 3 times [2022-07-21 11:00:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:39,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255524117] [2022-07-21 11:00:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:00:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:00:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:00:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:00:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:00:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 11:00:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:00:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:00:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 11:00:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:39,704 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-21 11:00:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:39,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255524117] [2022-07-21 11:00:39,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255524117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:39,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:00:39,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:00:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177682562] [2022-07-21 11:00:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:39,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:00:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:00:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:00:39,707 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-21 11:00:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:41,443 INFO L93 Difference]: Finished difference Result 22019 states and 30032 transitions. [2022-07-21 11:00:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:00:41,444 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-21 11:00:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:41,494 INFO L225 Difference]: With dead ends: 22019 [2022-07-21 11:00:41,495 INFO L226 Difference]: Without dead ends: 14867 [2022-07-21 11:00:41,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:00:41,519 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 901 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:41,519 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.0s Time] [2022-07-21 11:00:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2022-07-21 11:00:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 11537. [2022-07-21 11:00:42,415 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-21 11:00:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 15283 transitions. [2022-07-21 11:00:42,441 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 15283 transitions. Word has length 194 [2022-07-21 11:00:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:42,441 INFO L495 AbstractCegarLoop]: Abstraction has 11537 states and 15283 transitions. [2022-07-21 11:00:42,441 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-21 11:00:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 15283 transitions. [2022-07-21 11:00:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 11:00:42,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:42,459 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-21 11:00:42,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 11:00:42,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -276664566, now seen corresponding path program 1 times [2022-07-21 11:00:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:42,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730365406] [2022-07-21 11:00:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:00:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:00:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:00:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:00:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:00:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 11:00:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:00:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:00:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:00:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 11:00:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:42,787 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-21 11:00:42,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:42,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730365406] [2022-07-21 11:00:42,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730365406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:42,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:00:42,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 11:00:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558531476] [2022-07-21 11:00:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:42,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 11:00:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 11:00:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:00:42,793 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-21 11:00:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:44,599 INFO L93 Difference]: Finished difference Result 19701 states and 26376 transitions. [2022-07-21 11:00:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:00:44,600 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-21 11:00:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:44,649 INFO L225 Difference]: With dead ends: 19701 [2022-07-21 11:00:44,649 INFO L226 Difference]: Without dead ends: 12565 [2022-07-21 11:00:44,670 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-21 11:00:44,671 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 858 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:44,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2367 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 11:00:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2022-07-21 11:00:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11557. [2022-07-21 11:00:45,523 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-21 11:00:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 15307 transitions. [2022-07-21 11:00:45,558 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 15307 transitions. Word has length 194 [2022-07-21 11:00:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:45,559 INFO L495 AbstractCegarLoop]: Abstraction has 11557 states and 15307 transitions. [2022-07-21 11:00:45,559 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-21 11:00:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 15307 transitions. [2022-07-21 11:00:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-21 11:00:45,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:45,577 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-21 11:00:45,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 11:00:45,578 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash 454006962, now seen corresponding path program 2 times [2022-07-21 11:00:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:45,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935462969] [2022-07-21 11:00:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:00:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:00:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:00:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:00:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:00:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 11:00:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:00:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:00:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 11:00:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:00:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:00:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 11:00:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 11:00:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:45,946 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-21 11:00:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935462969] [2022-07-21 11:00:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935462969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:45,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623661074] [2022-07-21 11:00:45,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:00:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:00:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:00:45,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:00:45,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 11:00:46,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:00:46,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:00:46,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 11:00:46,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:00:46,746 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-21 11:00:46,747 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-21 11:00:46,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:00:46,885 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-21 11:00:46,885 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-21 11:00:46,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:00:47,014 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:00:47,014 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-21 11:00:47,093 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-21 11:00:47,133 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-21 11:00:47,179 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-21 11:00:47,244 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-21 11:00:47,264 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-21 11:00:47,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:00:47,367 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-21 11:00:47,370 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-21 11:00:47,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623661074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:00:47,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:00:47,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2022-07-21 11:00:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373903247] [2022-07-21 11:00:47,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:00:47,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 11:00:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 11:00:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1084, Unknown=11, NotChecked=134, Total=1332 [2022-07-21 11:00:47,581 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-21 11:00:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:55,507 INFO L93 Difference]: Finished difference Result 22741 states and 30552 transitions. [2022-07-21 11:00:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 11:00:55,507 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-21 11:00:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:55,553 INFO L225 Difference]: With dead ends: 22741 [2022-07-21 11:00:55,553 INFO L226 Difference]: Without dead ends: 15561 [2022-07-21 11:00:55,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=3497, Unknown=13, NotChecked=246, Total=4160 [2022-07-21 11:00:55,574 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 2382 mSDsluCounter, 13928 mSDsCounter, 0 mSdLazyCounter, 10062 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 14922 SdHoareTripleChecker+Invalid, 12096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 10062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:55,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 14922 Invalid, 12096 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1184 Valid, 10062 Invalid, 0 Unknown, 850 Unchecked, 6.2s Time] [2022-07-21 11:00:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2022-07-21 11:00:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 13109. [2022-07-21 11:00:56,289 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-21 11:00:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 17312 transitions. [2022-07-21 11:00:56,421 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 17312 transitions. Word has length 200 [2022-07-21 11:00:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:00:56,421 INFO L495 AbstractCegarLoop]: Abstraction has 13109 states and 17312 transitions. [2022-07-21 11:00:56,421 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-21 11:00:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 17312 transitions. [2022-07-21 11:00:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-21 11:00:56,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:00:56,442 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-21 11:00:56,473 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-21 11:00:56,662 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-21 11:00:56,662 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:00:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:00:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1863810439, now seen corresponding path program 1 times [2022-07-21 11:00:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:00:56,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666762813] [2022-07-21 11:00:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:00:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:00:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:00:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:00:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:00:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:00:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:00:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:00:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:00:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:00:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:00:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:00:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:00:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:00:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 11:00:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:00:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:00:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:00:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 11:00:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 11:00:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:00:56,982 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-21 11:00:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:00:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666762813] [2022-07-21 11:00:56,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666762813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:00:56,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:00:56,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 11:00:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065980998] [2022-07-21 11:00:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:00:56,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 11:00:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:00:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 11:00:56,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:00:56,987 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-21 11:00:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:00:59,628 INFO L93 Difference]: Finished difference Result 23691 states and 32221 transitions. [2022-07-21 11:00:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:00:59,628 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-21 11:00:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:00:59,691 INFO L225 Difference]: With dead ends: 23691 [2022-07-21 11:00:59,692 INFO L226 Difference]: Without dead ends: 16503 [2022-07-21 11:00:59,715 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-21 11:00:59,716 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 917 mSDsluCounter, 3507 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:00:59,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4353 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 11:00:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2022-07-21 11:01:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 13137. [2022-07-21 11:01:00,476 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-21 11:01:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 17376 transitions. [2022-07-21 11:01:00,507 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 17376 transitions. Word has length 211 [2022-07-21 11:01:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:00,512 INFO L495 AbstractCegarLoop]: Abstraction has 13137 states and 17376 transitions. [2022-07-21 11:01:00,512 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-21 11:01:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 17376 transitions. [2022-07-21 11:01:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-21 11:01:00,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:00,538 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-21 11:01:00,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 11:01:00,539 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1503128751, now seen corresponding path program 1 times [2022-07-21 11:01:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:00,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915968817] [2022-07-21 11:01:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:01:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:01:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:01:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:01:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:01:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:01:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:01:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:01:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:01:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:01:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:01:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:01:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 11:01:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:01:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:00,954 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-21 11:01:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915968817] [2022-07-21 11:01:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915968817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601528348] [2022-07-21 11:01:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:00,956 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-21 11:01:00,958 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-21 11:01:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:01,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 11:01:01,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:01:01,698 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-21 11:01:01,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:01:01,795 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-21 11:01:01,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601528348] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:01,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:01:01,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2022-07-21 11:01:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893091060] [2022-07-21 11:01:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:01:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:01:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:01:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:01:01,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:01:01,797 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-21 11:01:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:01:02,716 INFO L93 Difference]: Finished difference Result 20397 states and 27455 transitions. [2022-07-21 11:01:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:01:02,719 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-21 11:01:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:01:02,760 INFO L225 Difference]: With dead ends: 20397 [2022-07-21 11:01:02,760 INFO L226 Difference]: Without dead ends: 13181 [2022-07-21 11:01:02,782 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-21 11:01:02,783 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-21 11:01:02,783 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-21 11:01:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13181 states. [2022-07-21 11:01:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13181 to 13157. [2022-07-21 11:01:03,576 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-21 11:01:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 17400 transitions. [2022-07-21 11:01:03,604 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 17400 transitions. Word has length 212 [2022-07-21 11:01:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:03,604 INFO L495 AbstractCegarLoop]: Abstraction has 13157 states and 17400 transitions. [2022-07-21 11:01:03,604 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-21 11:01:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 17400 transitions. [2022-07-21 11:01:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-21 11:01:03,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:03,622 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-21 11:01:03,644 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-21 11:01:03,823 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-21 11:01:03,823 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -361861751, now seen corresponding path program 1 times [2022-07-21 11:01:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:03,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500114287] [2022-07-21 11:01:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:01:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:01:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:01:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:01:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:01:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:01:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:01:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:01:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:01:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:01:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:01:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:01:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 11:01:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 11:01:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,237 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-21 11:01:04,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:04,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500114287] [2022-07-21 11:01:04,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500114287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:04,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526588869] [2022-07-21 11:01:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:04,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:04,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:04,239 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-21 11:01:04,240 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-21 11:01:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:04,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 11:01:04,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:01:04,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:01:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:01:05,006 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-21 11:01:05,220 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-21 11:01:05,250 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-21 11:01:05,310 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-21 11:01:05,327 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-21 11:01:05,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:01:06,320 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-21 11:01:07,207 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-21 11:01:08,012 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-21 11:01:08,582 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-21 11:01:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526588869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:08,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:01:08,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2022-07-21 11:01:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170596248] [2022-07-21 11:01:08,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:01:08,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 11:01:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:01:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 11:01:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=790, Unknown=4, NotChecked=236, Total=1122 [2022-07-21 11:01:08,586 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-21 11:01:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:01:15,979 INFO L93 Difference]: Finished difference Result 27093 states and 36763 transitions. [2022-07-21 11:01:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 11:01:15,980 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-21 11:01:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:01:16,036 INFO L225 Difference]: With dead ends: 27093 [2022-07-21 11:01:16,037 INFO L226 Difference]: Without dead ends: 19847 [2022-07-21 11:01:16,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=488, Invalid=3814, Unknown=4, NotChecked=524, Total=4830 [2022-07-21 11:01:16,061 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2123 mSDsluCounter, 12718 mSDsCounter, 0 mSdLazyCounter, 8848 mSolverCounterSat, 1146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 13967 SdHoareTripleChecker+Invalid, 10703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1146 IncrementalHoareTripleChecker+Valid, 8848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:01:16,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 13967 Invalid, 10703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1146 Valid, 8848 Invalid, 0 Unknown, 709 Unchecked, 5.5s Time] [2022-07-21 11:01:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2022-07-21 11:01:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 13173. [2022-07-21 11:01:17,054 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-21 11:01:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 17424 transitions. [2022-07-21 11:01:17,085 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 17424 transitions. Word has length 213 [2022-07-21 11:01:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:17,085 INFO L495 AbstractCegarLoop]: Abstraction has 13173 states and 17424 transitions. [2022-07-21 11:01:17,085 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-21 11:01:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 17424 transitions. [2022-07-21 11:01:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 11:01:17,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:17,104 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-21 11:01:17,127 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-21 11:01:17,304 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-21 11:01:17,305 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 2 times [2022-07-21 11:01:17,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321246005] [2022-07-21 11:01:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:01:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 11:01:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:01:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:01:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:01:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:01:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:01:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:01:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:01:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:01:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:01:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:01:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:01:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 11:01:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:17,756 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-21 11:01:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321246005] [2022-07-21 11:01:17,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321246005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318928437] [2022-07-21 11:01:17,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:01:17,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:17,760 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-21 11:01:17,763 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-21 11:01:18,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:01:18,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:01:18,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 11:01:18,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:01:18,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:01:18,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:01:18,627 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-21 11:01:18,835 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-21 11:01:18,873 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-21 11:01:18,925 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-21 11:01:18,941 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-21 11:01:18,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:01:19,931 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-21 11:01:20,728 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-21 11:01:21,606 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-21 11:01:22,177 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-21 11:01:22,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318928437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:22,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:01:22,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2022-07-21 11:01:22,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301578176] [2022-07-21 11:01:22,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:01:22,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 11:01:22,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:01:22,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 11:01:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=907, Unknown=4, NotChecked=252, Total=1260 [2022-07-21 11:01:22,181 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-21 11:01:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:01:32,192 INFO L93 Difference]: Finished difference Result 30123 states and 40915 transitions. [2022-07-21 11:01:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-21 11:01:32,193 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-21 11:01:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:01:32,243 INFO L225 Difference]: With dead ends: 30123 [2022-07-21 11:01:32,243 INFO L226 Difference]: Without dead ends: 22861 [2022-07-21 11:01:32,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=530, Invalid=4174, Unknown=4, NotChecked=548, Total=5256 [2022-07-21 11:01:32,260 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2058 mSDsluCounter, 17594 mSDsCounter, 0 mSdLazyCounter, 12132 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 19048 SdHoareTripleChecker+Invalid, 14301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 12132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:01:32,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 19048 Invalid, 14301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 12132 Invalid, 0 Unknown, 1091 Unchecked, 7.8s Time] [2022-07-21 11:01:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2022-07-21 11:01:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 13187. [2022-07-21 11:01:33,030 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-21 11:01:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13187 states to 13187 states and 17448 transitions. [2022-07-21 11:01:33,059 INFO L78 Accepts]: Start accepts. Automaton has 13187 states and 17448 transitions. Word has length 214 [2022-07-21 11:01:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:33,059 INFO L495 AbstractCegarLoop]: Abstraction has 13187 states and 17448 transitions. [2022-07-21 11:01:33,059 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-21 11:01:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13187 states and 17448 transitions. [2022-07-21 11:01:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-21 11:01:33,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:33,077 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-21 11:01:33,099 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-21 11:01:33,279 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-21 11:01:33,279 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash -266252569, now seen corresponding path program 1 times [2022-07-21 11:01:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:33,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994934307] [2022-07-21 11:01:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:01:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:01:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:01:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:01:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 11:01:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 11:01:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 11:01:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 11:01:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 11:01:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:01:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:01:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 11:01:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:01:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:33,976 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-21 11:01:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994934307] [2022-07-21 11:01:33,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994934307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462474922] [2022-07-21 11:01:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:33,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:33,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:33,978 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-21 11:01:33,979 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-21 11:01:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:34,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 11:01:34,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:01:34,904 INFO L356 Elim1Store]: treesize reduction 79, result has 32.5 percent of original size [2022-07-21 11:01:34,905 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-21 11:01:35,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:01:35,050 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-21 11:01:35,050 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-21 11:01:35,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-21 11:01:35,180 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:01:35,180 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-21 11:01:35,270 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-21 11:01:35,309 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-21 11:01:35,359 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-21 11:01:35,407 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-21 11:01:35,481 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-21 11:01:35,504 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-21 11:01:35,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:01:35,629 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-21 11:01:35,634 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-21 11:01:35,641 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-21 11:01:35,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462474922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:35,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:01:35,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2022-07-21 11:01:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84884777] [2022-07-21 11:01:35,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:01:35,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 11:01:35,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:01:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 11:01:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1229, Unknown=5, NotChecked=216, Total=1560 [2022-07-21 11:01:35,797 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-21 11:01:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:01:44,965 INFO L93 Difference]: Finished difference Result 25121 states and 34447 transitions. [2022-07-21 11:01:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 11:01:44,966 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-21 11:01:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:01:45,006 INFO L225 Difference]: With dead ends: 25121 [2022-07-21 11:01:45,007 INFO L226 Difference]: Without dead ends: 17861 [2022-07-21 11:01:45,022 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-21 11:01:45,022 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1474 mSDsluCounter, 15962 mSDsCounter, 0 mSdLazyCounter, 10110 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 17131 SdHoareTripleChecker+Invalid, 11446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 10110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:01:45,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 17131 Invalid, 11446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 10110 Invalid, 0 Unknown, 689 Unchecked, 7.4s Time] [2022-07-21 11:01:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2022-07-21 11:01:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 13433. [2022-07-21 11:01:45,772 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-21 11:01:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 17825 transitions. [2022-07-21 11:01:45,801 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 17825 transitions. Word has length 212 [2022-07-21 11:01:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:45,801 INFO L495 AbstractCegarLoop]: Abstraction has 13433 states and 17825 transitions. [2022-07-21 11:01:45,801 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-21 11:01:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 17825 transitions. [2022-07-21 11:01:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-21 11:01:45,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:45,819 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-21 11:01:45,841 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-21 11:01:46,019 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-21 11:01:46,020 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 582910906, now seen corresponding path program 2 times [2022-07-21 11:01:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:46,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019830617] [2022-07-21 11:01:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:01:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:01:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:01:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 11:01:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 11:01:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 11:01:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:01:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:01:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 11:01:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:01:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 11:01:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:01:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:01:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:46,678 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-21 11:01:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019830617] [2022-07-21 11:01:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019830617] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223368724] [2022-07-21 11:01:46,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:01:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:46,680 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-21 11:01:46,681 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-21 11:01:47,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:01:47,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:01:47,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 11:01:47,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:01:47,678 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-21 11:01:47,678 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-21 11:01:47,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:01:47,827 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-21 11:01:47,828 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-21 11:01:47,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:01:47,943 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:01:47,943 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-21 11:01:48,018 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-21 11:01:48,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:01:48,058 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-21 11:01:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:01:48,105 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-21 11:01:48,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:01:48,148 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-21 11:01:48,191 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-21 11:01:48,259 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-21 11:01:48,283 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-21 11:01:48,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:01:48,400 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-21 11:01:48,404 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-21 11:01:48,409 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-21 11:01:48,421 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-21 11:01:48,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223368724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:48,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:01:48,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2022-07-21 11:01:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113340799] [2022-07-21 11:01:48,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:01:48,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 11:01:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:01:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 11:01:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1359, Unknown=10, NotChecked=308, Total=1806 [2022-07-21 11:01:48,609 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-21 11:01:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:01:57,163 INFO L93 Difference]: Finished difference Result 26943 states and 37126 transitions. [2022-07-21 11:01:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 11:01:57,164 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-21 11:01:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:01:57,213 INFO L225 Difference]: With dead ends: 26943 [2022-07-21 11:01:57,213 INFO L226 Difference]: Without dead ends: 19675 [2022-07-21 11:01:57,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=510, Invalid=4897, Unknown=11, NotChecked=588, Total=6006 [2022-07-21 11:01:57,234 INFO L413 NwaCegarLoop]: 1013 mSDtfsCounter, 3100 mSDsluCounter, 11239 mSDsCounter, 0 mSdLazyCounter, 8635 mSolverCounterSat, 1672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3202 SdHoareTripleChecker+Valid, 12252 SdHoareTripleChecker+Invalid, 10835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1672 IncrementalHoareTripleChecker+Valid, 8635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:01:57,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3202 Valid, 12252 Invalid, 10835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1672 Valid, 8635 Invalid, 0 Unknown, 528 Unchecked, 6.3s Time] [2022-07-21 11:01:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19675 states. [2022-07-21 11:01:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19675 to 13461. [2022-07-21 11:01:58,221 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-21 11:01:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 17863 transitions. [2022-07-21 11:01:58,250 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 17863 transitions. Word has length 215 [2022-07-21 11:01:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:01:58,251 INFO L495 AbstractCegarLoop]: Abstraction has 13461 states and 17863 transitions. [2022-07-21 11:01:58,251 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-21 11:01:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 17863 transitions. [2022-07-21 11:01:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-21 11:01:58,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:01:58,276 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 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-21 11:01:58,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 11:01:58,491 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-21 11:01:58,492 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:01:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:01:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1282580973, now seen corresponding path program 3 times [2022-07-21 11:01:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:01:58,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686463095] [2022-07-21 11:01:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:01:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:01:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:01:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:01:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:01:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:01:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:01:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:01:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:01:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:01:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:01:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:01:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:01:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:01:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 11:01:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:01:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:01:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:01:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 11:01:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 11:01:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:01:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 11:01:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:01:59,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686463095] [2022-07-21 11:01:59,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686463095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:01:59,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429667121] [2022-07-21 11:01:59,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 11:01:59,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:01:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:01:59,196 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-21 11:01:59,197 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-21 11:01:59,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-21 11:01:59,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:02:00,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 11:02:00,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:02:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-21 11:02:00,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:02:00,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429667121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:02:00,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:02:00,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-07-21 11:02:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975171395] [2022-07-21 11:02:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:02:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:02:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:02:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-07-21 11:02:00,165 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-21 11:02:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:02:02,350 INFO L93 Difference]: Finished difference Result 26117 states and 35120 transitions. [2022-07-21 11:02:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:02:02,351 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 217 [2022-07-21 11:02:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:02:02,399 INFO L225 Difference]: With dead ends: 26117 [2022-07-21 11:02:02,399 INFO L226 Difference]: Without dead ends: 18831 [2022-07-21 11:02:02,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 254 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-21 11:02:02,419 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-21 11:02:02,419 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-21 11:02:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2022-07-21 11:02:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 16595. [2022-07-21 11:02:03,587 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-21 11:02:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 21917 transitions. [2022-07-21 11:02:03,622 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 21917 transitions. Word has length 217 [2022-07-21 11:02:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:02:03,623 INFO L495 AbstractCegarLoop]: Abstraction has 16595 states and 21917 transitions. [2022-07-21 11:02:03,623 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-21 11:02:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 21917 transitions. [2022-07-21 11:02:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-21 11:02:03,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:02:03,643 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-21 11:02:03,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 11:02:03,871 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-21 11:02:03,872 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:02:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:02:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 95642230, now seen corresponding path program 1 times [2022-07-21 11:02:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:02:03,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192714961] [2022-07-21 11:02:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:02:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:02:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:02:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:02:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 11:02:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:02:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 11:02:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 11:02:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:02:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 11:02:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:02:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:02:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 11:02:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:02:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 11:02:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:02:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 11:02:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 11:02:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 11:02:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-21 11:02:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:02:04,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192714961] [2022-07-21 11:02:04,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192714961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:02:04,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539055073] [2022-07-21 11:02:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:04,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:02:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:02:04,614 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-21 11:02:04,615 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-21 11:02:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:05,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 3046 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-21 11:02:05,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:02:05,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:02:05,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:02:05,790 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-21 11:02:05,954 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-21 11:02:05,991 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-21 11:02:06,049 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-21 11:02:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 99 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-21 11:02:06,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:02:07,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7126 Int) (v_ArrVal_7124 Int) (v_ArrVal_7123 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_7123) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7124) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_7126)) 26) 1))) is different from false [2022-07-21 11:02:08,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7126 Int) (v_ArrVal_7124 Int) (v_ArrVal_7123 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_7123) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_7124) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_7126)) 26) 1))) is different from false [2022-07-21 11:02:08,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7126 Int) (v_ArrVal_7124 Int) (v_ArrVal_7123 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_7123) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_7124) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_7126)) 26) 1))) is different from false [2022-07-21 11:02:09,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7126 Int) (v_ArrVal_7124 Int) (v_ArrVal_7123 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_7123) 930 v_ArrVal_7124) 0 v_ArrVal_7126)) 26) 1))) is different from false [2022-07-21 11:02:09,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539055073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:02:09,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:02:09,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-07-21 11:02:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357035359] [2022-07-21 11:02:09,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:02:09,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 11:02:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 11:02:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1035, Unknown=4, NotChecked=268, Total=1406 [2022-07-21 11:02:09,484 INFO L87 Difference]: Start difference. First operand 16595 states and 21917 transitions. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 23 states have internal predecessors, (248), 7 states have call successors, (45), 10 states have call predecessors, (45), 7 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2022-07-21 11:02:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:02:23,676 INFO L93 Difference]: Finished difference Result 39229 states and 53616 transitions. [2022-07-21 11:02:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-21 11:02:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 23 states have internal predecessors, (248), 7 states have call successors, (45), 10 states have call predecessors, (45), 7 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) Word has length 244 [2022-07-21 11:02:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:02:23,751 INFO L225 Difference]: With dead ends: 39229 [2022-07-21 11:02:23,752 INFO L226 Difference]: Without dead ends: 28809 [2022-07-21 11:02:23,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=587, Invalid=5431, Unknown=4, NotChecked=620, Total=6642 [2022-07-21 11:02:23,774 INFO L413 NwaCegarLoop]: 1251 mSDtfsCounter, 1971 mSDsluCounter, 18692 mSDsCounter, 0 mSdLazyCounter, 13870 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 19943 SdHoareTripleChecker+Invalid, 16068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 13870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1178 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:02:23,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2088 Valid, 19943 Invalid, 16068 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1020 Valid, 13870 Invalid, 0 Unknown, 1178 Unchecked, 10.7s Time] [2022-07-21 11:02:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28809 states. [2022-07-21 11:02:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28809 to 17849. [2022-07-21 11:02:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17849 states, 13484 states have (on average 1.2847078018392168) internal successors, (17323), 13714 states have internal predecessors, (17323), 2896 states have call successors, (2896), 1391 states have call predecessors, (2896), 1468 states have return successors, (3244), 2799 states have call predecessors, (3244), 2895 states have call successors, (3244) [2022-07-21 11:02:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17849 states to 17849 states and 23463 transitions. [2022-07-21 11:02:25,280 INFO L78 Accepts]: Start accepts. Automaton has 17849 states and 23463 transitions. Word has length 244 [2022-07-21 11:02:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:02:25,281 INFO L495 AbstractCegarLoop]: Abstraction has 17849 states and 23463 transitions. [2022-07-21 11:02:25,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 23 states have internal predecessors, (248), 7 states have call successors, (45), 10 states have call predecessors, (45), 7 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2022-07-21 11:02:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17849 states and 23463 transitions. [2022-07-21 11:02:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-21 11:02:25,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:02:25,307 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-21 11:02:25,331 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-21 11:02:25,507 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-21 11:02:25,508 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:02:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:02:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1223619748, now seen corresponding path program 2 times [2022-07-21 11:02:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:02:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989970093] [2022-07-21 11:02:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:02:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:02:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:02:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:02:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 11:02:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:02:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:02:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:02:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:02:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:02:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:02:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:02:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:02:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:02:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:02:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:02:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 11:02:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 11:02:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-21 11:02:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:26,499 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-21 11:02:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:02:26,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989970093] [2022-07-21 11:02:26,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989970093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:02:26,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661472658] [2022-07-21 11:02:26,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:02:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:02:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:02:26,502 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-21 11:02:26,505 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-21 11:02:27,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 11:02:27,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:02:27,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 11:02:27,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:02:27,472 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-21 11:02:27,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:02:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661472658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:02:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:02:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 24 [2022-07-21 11:02:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517527396] [2022-07-21 11:02:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:02:27,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:02:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:27,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:02:27,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-21 11:02:27,475 INFO L87 Difference]: Start difference. First operand 17849 states and 23463 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-21 11:02:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:02:31,510 INFO L93 Difference]: Finished difference Result 36054 states and 47603 transitions. [2022-07-21 11:02:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 11:02:31,510 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-21 11:02:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:02:31,582 INFO L225 Difference]: With dead ends: 36054 [2022-07-21 11:02:31,582 INFO L226 Difference]: Without dead ends: 25707 [2022-07-21 11:02:31,612 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-21 11:02:31,612 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 2305 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:02:31,613 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.1s Time] [2022-07-21 11:02:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2022-07-21 11:02:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 21153. [2022-07-21 11:02:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21153 states, 15962 states have (on average 1.2817316125798772) internal successors, (20459), 16230 states have internal predecessors, (20459), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3353 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-21 11:02:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21153 states to 21153 states and 27775 transitions. [2022-07-21 11:02:33,265 INFO L78 Accepts]: Start accepts. Automaton has 21153 states and 27775 transitions. Word has length 252 [2022-07-21 11:02:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:02:33,266 INFO L495 AbstractCegarLoop]: Abstraction has 21153 states and 27775 transitions. [2022-07-21 11:02:33,266 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-21 11:02:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 21153 states and 27775 transitions. [2022-07-21 11:02:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-21 11:02:33,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:02:33,293 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-21 11:02:33,315 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-21 11:02:33,493 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-21 11:02:33,494 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:02:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:02:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1811935271, now seen corresponding path program 1 times [2022-07-21 11:02:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:02:33,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500451558] [2022-07-21 11:02:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:33,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:02:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:02:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:02:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:02:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 11:02:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:02:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:02:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:02:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:02:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:02:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:02:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:02:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:02:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:02:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:02:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:02:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 11:02:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 11:02:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-21 11:02:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-21 11:02:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:34,002 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-21 11:02:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:02:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500451558] [2022-07-21 11:02:34,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500451558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:02:34,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:02:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:02:34,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996718285] [2022-07-21 11:02:34,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:02:34,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:02:34,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:02:34,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:02:34,004 INFO L87 Difference]: Start difference. First operand 21153 states and 27775 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-21 11:02:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:02:37,532 INFO L93 Difference]: Finished difference Result 40879 states and 54993 transitions. [2022-07-21 11:02:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:02:37,535 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-21 11:02:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:02:37,623 INFO L225 Difference]: With dead ends: 40879 [2022-07-21 11:02:37,623 INFO L226 Difference]: Without dead ends: 27233 [2022-07-21 11:02:37,656 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-21 11:02:37,657 INFO L413 NwaCegarLoop]: 905 mSDtfsCounter, 1405 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:02:37,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 3433 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 11:02:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27233 states. [2022-07-21 11:02:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27233 to 21153. [2022-07-21 11:02:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21153 states, 15962 states have (on average 1.2814810174163638) internal successors, (20455), 16230 states have internal predecessors, (20455), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3353 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-21 11:02:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21153 states to 21153 states and 27771 transitions. [2022-07-21 11:02:39,369 INFO L78 Accepts]: Start accepts. Automaton has 21153 states and 27771 transitions. Word has length 268 [2022-07-21 11:02:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:02:39,369 INFO L495 AbstractCegarLoop]: Abstraction has 21153 states and 27771 transitions. [2022-07-21 11:02:39,370 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-21 11:02:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21153 states and 27771 transitions. [2022-07-21 11:02:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-21 11:02:39,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:02:39,395 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-21 11:02:39,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 11:02:39,395 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:02:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:02:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash 219750271, now seen corresponding path program 1 times [2022-07-21 11:02:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:02:39,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162554635] [2022-07-21 11:02:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:02:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:02:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:02:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:02:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 11:02:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:02:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:02:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:02:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:02:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:02:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:02:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:02:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:02:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:02:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:02:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:02:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 11:02:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 11:02:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 11:02:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-21 11:02:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:39,819 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-21 11:02:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:02:39,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162554635] [2022-07-21 11:02:39,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162554635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:02:39,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466592971] [2022-07-21 11:02:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:39,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:02:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:02:39,822 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-21 11:02:39,850 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-21 11:02:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:40,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 3443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:02:40,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:02:41,249 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-21 11:02:41,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:02:41,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466592971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:02:41,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:02:41,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-21 11:02:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846756460] [2022-07-21 11:02:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:02:41,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:02:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:02:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:02:41,251 INFO L87 Difference]: Start difference. First operand 21153 states and 27771 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-21 11:02:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:02:45,637 INFO L93 Difference]: Finished difference Result 63381 states and 83212 transitions. [2022-07-21 11:02:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:02:45,638 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-21 11:02:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:02:45,816 INFO L225 Difference]: With dead ends: 63381 [2022-07-21 11:02:45,816 INFO L226 Difference]: Without dead ends: 63373 [2022-07-21 11:02:45,847 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-21 11:02:45,848 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-21 11:02:45,848 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-21 11:02:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63373 states. [2022-07-21 11:02:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63373 to 62393. [2022-07-21 11:02:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62393 states, 47150 states have (on average 1.285238600212089) internal successors, (60599), 47966 states have internal predecessors, (60599), 10204 states have call successors, (10204), 4789 states have call predecessors, (10204), 5038 states have return successors, (11346), 9853 states have call predecessors, (11346), 10203 states have call successors, (11346) [2022-07-21 11:02:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62393 states to 62393 states and 82149 transitions. [2022-07-21 11:02:51,351 INFO L78 Accepts]: Start accepts. Automaton has 62393 states and 82149 transitions. Word has length 271 [2022-07-21 11:02:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:02:51,352 INFO L495 AbstractCegarLoop]: Abstraction has 62393 states and 82149 transitions. [2022-07-21 11:02:51,352 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-21 11:02:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 62393 states and 82149 transitions. [2022-07-21 11:02:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-21 11:02:51,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:02:51,433 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-21 11:02:51,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-21 11:02:51,633 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-21 11:02:51,634 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:02:51,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:02:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash -791366979, now seen corresponding path program 1 times [2022-07-21 11:02:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:02:51,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503525187] [2022-07-21 11:02:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:02:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:02:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:02:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:02:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 11:02:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 11:02:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 11:02:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:02:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 11:02:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 11:02:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:02:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 11:02:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:02:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 11:02:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:02:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:02:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 11:02:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 11:02:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:02:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 11:02:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 11:02:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:02:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 11:02:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-21 11:02:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:02:52,145 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-21 11:02:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:02:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503525187] [2022-07-21 11:02:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503525187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:02:52,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:02:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:02:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981397801] [2022-07-21 11:02:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:02:52,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:02:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:02:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:02:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:02:52,148 INFO L87 Difference]: Start difference. First operand 62393 states and 82149 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-21 11:03:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:03:03,026 INFO L93 Difference]: Finished difference Result 146086 states and 199718 transitions. [2022-07-21 11:03:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 11:03:03,027 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-21 11:03:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:03:03,536 INFO L225 Difference]: With dead ends: 146086 [2022-07-21 11:03:03,536 INFO L226 Difference]: Without dead ends: 105212 [2022-07-21 11:03:03,627 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-21 11:03:03,628 INFO L413 NwaCegarLoop]: 814 mSDtfsCounter, 2752 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 1598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1598 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:03:03,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2829 Valid, 3311 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1598 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 11:03:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105212 states. [2022-07-21 11:03:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105212 to 82660. [2022-07-21 11:03:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82660 states, 62257 states have (on average 1.2801773294569285) internal successors, (79700), 63363 states have internal predecessors, (79700), 13705 states have call successors, (13705), 6298 states have call predecessors, (13705), 6697 states have return successors, (15249), 13322 states have call predecessors, (15249), 13704 states have call successors, (15249) [2022-07-21 11:03:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82660 states to 82660 states and 108654 transitions. [2022-07-21 11:03:11,559 INFO L78 Accepts]: Start accepts. Automaton has 82660 states and 108654 transitions. Word has length 271 [2022-07-21 11:03:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:03:11,559 INFO L495 AbstractCegarLoop]: Abstraction has 82660 states and 108654 transitions. [2022-07-21 11:03:11,560 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-21 11:03:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 82660 states and 108654 transitions. [2022-07-21 11:03:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-21 11:03:11,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:03:11,646 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-21 11:03:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 11:03:11,646 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:03:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:03:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2140871754, now seen corresponding path program 1 times [2022-07-21 11:03:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:03:11,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044662509] [2022-07-21 11:03:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:03:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms