./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 eb692b52 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-?-eb692b5 [2022-07-19 23:28:09,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:28:09,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:28:09,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:28:09,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:28:09,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:28:09,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:28:09,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:28:09,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:28:09,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:28:09,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:28:09,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:28:09,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:28:09,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:28:09,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:28:09,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:28:09,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:28:09,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:28:09,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:28:09,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:28:09,922 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:28:09,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:28:09,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:28:09,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:28:09,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:28:09,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:28:09,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:28:09,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:28:09,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:28:09,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:28:09,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:28:09,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:28:09,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:28:09,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:28:09,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:28:09,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:28:09,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:28:09,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:28:09,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:28:09,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:28:09,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:28:09,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:28:09,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:28:09,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:28:09,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:28:09,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:28:09,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:28:09,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:28:09,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:28:09,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:28:09,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:28:09,969 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:28:09,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:28:09,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:28:09,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:28:09,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:28:09,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:28:09,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:28:09,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:28:09,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:28:09,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:28:09,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:28:09,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:28:09,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:28:09,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:28:09,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:28:09,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:28:09,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:28:09,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:28:09,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:28:09,974 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:28:09,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:28:09,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:28:09,974 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-19 23:28:10,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:28:10,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:28:10,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:28:10,226 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:28:10,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:28:10,228 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-19 23:28:10,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31bc2323b/89a13a87117f4ca3ad775809e485992b/FLAG5ef8c312b [2022-07-19 23:28:10,864 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:28:10,865 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-19 23:28:10,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31bc2323b/89a13a87117f4ca3ad775809e485992b/FLAG5ef8c312b [2022-07-19 23:28:11,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31bc2323b/89a13a87117f4ca3ad775809e485992b [2022-07-19 23:28:11,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:28:11,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:28:11,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:28:11,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:28:11,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:28:11,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:28:11" (1/1) ... [2022-07-19 23:28:11,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6044478c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:11, skipping insertion in model container [2022-07-19 23:28:11,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:28:11" (1/1) ... [2022-07-19 23:28:11,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:28:11,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:28:11,653 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-19 23:28:11,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:28:12,012 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:28:12,108 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-19 23:28:12,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:28:12,257 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:28:12,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12 WrapperNode [2022-07-19 23:28:12,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:28:12,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:28:12,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:28:12,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:28:12,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,385 INFO L137 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1770 [2022-07-19 23:28:12,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:28:12,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:28:12,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:28:12,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:28:12,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:28:12,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:28:12,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:28:12,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:28:12,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (1/1) ... [2022-07-19 23:28:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:28:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:12,531 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-19 23:28:12,532 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-19 23:28:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-19 23:28:12,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-19 23:28:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:28:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-07-19 23:28:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-07-19 23:28:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-07-19 23:28:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-07-19 23:28:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-07-19 23:28:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:28:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-19 23:28:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-19 23:28:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-19 23:28:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-19 23:28:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-07-19 23:28:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-07-19 23:28:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-19 23:28:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-19 23:28:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-19 23:28:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-19 23:28:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:28:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 23:28:12,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 23:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:28:12,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-19 23:28:12,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-19 23:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-19 23:28:12,567 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-19 23:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:28:12,568 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-07-19 23:28:12,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-07-19 23:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-07-19 23:28:12,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-07-19 23:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:28:12,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:28:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:28:12,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:28:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:28:12,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:28:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-07-19 23:28:12,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-07-19 23:28:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-19 23:28:12,570 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-19 23:28:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:28:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-19 23:28:12,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-19 23:28:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:28:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-19 23:28:12,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-19 23:28:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-07-19 23:28:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-07-19 23:28:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:28:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:28:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 23:28:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-19 23:28:12,573 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-19 23:28:12,573 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-19 23:28:12,573 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:28:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:28:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-19 23:28:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-19 23:28:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-19 23:28:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-19 23:28:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-19 23:28:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-19 23:28:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-19 23:28:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-19 23:28:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:28:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-07-19 23:28:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-07-19 23:28:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:28:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:28:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:28:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-19 23:28:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-19 23:28:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:28:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:28:12,985 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:28:12,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:28:13,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:28:13,454 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-19 23:28:13,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:28:13,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:28:13,822 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 23:28:13,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:28:13 BoogieIcfgContainer [2022-07-19 23:28:13,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:28:13,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:28:13,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:28:13,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:28:13,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:28:11" (1/3) ... [2022-07-19 23:28:13,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa2e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:28:13, skipping insertion in model container [2022-07-19 23:28:13,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:28:12" (2/3) ... [2022-07-19 23:28:13,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa2e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:28:13, skipping insertion in model container [2022-07-19 23:28:13,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:28:13" (3/3) ... [2022-07-19 23:28:13,830 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-19 23:28:13,841 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:28:13,842 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:28:13,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:28:13,915 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@46547d41, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5da75262 [2022-07-19 23:28:13,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:28:13,921 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-19 23:28:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 23:28:13,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:13,968 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-19 23:28:13,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2022-07-19 23:28:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:13,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246656701] [2022-07-19 23:28:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:14,356 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-19 23:28:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246656701] [2022-07-19 23:28:14,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246656701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:14,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396324596] [2022-07-19 23:28:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:14,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:14,381 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-19 23:28:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:15,463 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2022-07-19 23:28:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:28:15,465 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-19 23:28:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:15,478 INFO L225 Difference]: With dead ends: 1626 [2022-07-19 23:28:15,478 INFO L226 Difference]: Without dead ends: 1080 [2022-07-19 23:28:15,482 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-19 23:28:15,484 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 966 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1467 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 23:28:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-07-19 23:28:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2022-07-19 23:28:15,555 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-19 23:28:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2022-07-19 23:28:15,560 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2022-07-19 23:28:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:15,561 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2022-07-19 23:28:15,561 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-19 23:28:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2022-07-19 23:28:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 23:28:15,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:15,563 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-19 23:28:15,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:28:15,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2022-07-19 23:28:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:15,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069945460] [2022-07-19 23:28:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:15,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:15,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:15,645 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-19 23:28:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069945460] [2022-07-19 23:28:15,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069945460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:15,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:15,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432584077] [2022-07-19 23:28:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:15,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:15,648 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-19 23:28:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:16,145 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2022-07-19 23:28:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:28:16,145 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-19 23:28:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:16,150 INFO L225 Difference]: With dead ends: 1106 [2022-07-19 23:28:16,150 INFO L226 Difference]: Without dead ends: 1093 [2022-07-19 23:28:16,151 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-19 23:28:16,152 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 799 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:16,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 933 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 23:28:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-07-19 23:28:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2022-07-19 23:28:16,182 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-19 23:28:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2022-07-19 23:28:16,185 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2022-07-19 23:28:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:16,186 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2022-07-19 23:28:16,186 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-19 23:28:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2022-07-19 23:28:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 23:28:16,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:16,188 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-19 23:28:16,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:28:16,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2022-07-19 23:28:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:16,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615014227] [2022-07-19 23:28:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:16,293 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-19 23:28:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:16,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615014227] [2022-07-19 23:28:16,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615014227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:16,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:16,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470961521] [2022-07-19 23:28:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:16,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:16,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:16,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:16,295 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-19 23:28:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:17,330 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2022-07-19 23:28:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:28:17,331 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-19 23:28:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:17,341 INFO L225 Difference]: With dead ends: 3133 [2022-07-19 23:28:17,341 INFO L226 Difference]: Without dead ends: 2150 [2022-07-19 23:28:17,344 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-19 23:28:17,345 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 970 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:17,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1473 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 23:28:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-07-19 23:28:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2022-07-19 23:28:17,411 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-19 23:28:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2022-07-19 23:28:17,421 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2022-07-19 23:28:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:17,421 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2022-07-19 23:28:17,421 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-19 23:28:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2022-07-19 23:28:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 23:28:17,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:17,423 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-19 23:28:17,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:28:17,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2022-07-19 23:28:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:17,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657680286] [2022-07-19 23:28:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:17,523 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-19 23:28:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657680286] [2022-07-19 23:28:17,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657680286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:17,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:17,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823495209] [2022-07-19 23:28:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:17,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:17,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:17,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:17,525 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-19 23:28:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:17,999 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2022-07-19 23:28:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:28:17,999 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-19 23:28:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:18,008 INFO L225 Difference]: With dead ends: 2142 [2022-07-19 23:28:18,008 INFO L226 Difference]: Without dead ends: 2139 [2022-07-19 23:28:18,009 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-19 23:28:18,010 INFO L413 NwaCegarLoop]: 623 mSDtfsCounter, 776 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:18,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 889 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 23:28:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-07-19 23:28:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2022-07-19 23:28:18,086 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-19 23:28:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2022-07-19 23:28:18,097 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2022-07-19 23:28:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:18,097 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2022-07-19 23:28:18,098 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-19 23:28:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2022-07-19 23:28:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 23:28:18,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:18,099 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-19 23:28:18,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:28:18,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2022-07-19 23:28:18,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:18,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901033880] [2022-07-19 23:28:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,237 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-19 23:28:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901033880] [2022-07-19 23:28:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901033880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:18,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:18,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728734628] [2022-07-19 23:28:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:18,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:18,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:18,239 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-19 23:28:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:18,688 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2022-07-19 23:28:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:28:18,688 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-19 23:28:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:18,697 INFO L225 Difference]: With dead ends: 2141 [2022-07-19 23:28:18,697 INFO L226 Difference]: Without dead ends: 2138 [2022-07-19 23:28:18,698 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-19 23:28:18,699 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 774 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:18,700 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.4s Time] [2022-07-19 23:28:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-07-19 23:28:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2022-07-19 23:28:18,762 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-19 23:28:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2022-07-19 23:28:18,770 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2022-07-19 23:28:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:18,770 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2022-07-19 23:28:18,770 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-19 23:28:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2022-07-19 23:28:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 23:28:18,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:18,772 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-19 23:28:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:28:18,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2022-07-19 23:28:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:18,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943202146] [2022-07-19 23:28:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:18,882 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-19 23:28:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:18,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943202146] [2022-07-19 23:28:18,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943202146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:18,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:18,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601464683] [2022-07-19 23:28:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:18,885 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-19 23:28:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:19,369 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2022-07-19 23:28:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:28:19,369 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-19 23:28:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:19,380 INFO L225 Difference]: With dead ends: 2140 [2022-07-19 23:28:19,382 INFO L226 Difference]: Without dead ends: 2137 [2022-07-19 23:28:19,383 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-19 23:28:19,385 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 771 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:19,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 880 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 23:28:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-07-19 23:28:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2022-07-19 23:28:19,448 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-19 23:28:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2022-07-19 23:28:19,460 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2022-07-19 23:28:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:19,461 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2022-07-19 23:28:19,461 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-19 23:28:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2022-07-19 23:28:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 23:28:19,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:19,463 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-19 23:28:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:28:19,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2022-07-19 23:28:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190715658] [2022-07-19 23:28:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:19,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:19,542 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-19 23:28:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:19,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190715658] [2022-07-19 23:28:19,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190715658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:19,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:19,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:28:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497028595] [2022-07-19 23:28:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:19,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:28:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:28:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:28:19,544 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-19 23:28:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:20,001 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2022-07-19 23:28:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:28:20,002 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-19 23:28:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:20,013 INFO L225 Difference]: With dead ends: 2139 [2022-07-19 23:28:20,014 INFO L226 Difference]: Without dead ends: 2127 [2022-07-19 23:28:20,016 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-19 23:28:20,017 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 767 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:20,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 880 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 23:28:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-07-19 23:28:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2022-07-19 23:28:20,106 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-19 23:28:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2022-07-19 23:28:20,113 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2022-07-19 23:28:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:20,113 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2022-07-19 23:28:20,113 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-19 23:28:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2022-07-19 23:28:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 23:28:20,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:20,118 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-19 23:28:20,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:28:20,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2022-07-19 23:28:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:20,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031173862] [2022-07-19 23:28:20,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:28:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:28:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 23:28:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:28:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 23:28:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 23:28:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 23:28:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:28:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 23:28:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 23:28:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:28:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:20,267 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-19 23:28:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031173862] [2022-07-19 23:28:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031173862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:20,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:28:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666328478] [2022-07-19 23:28:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:28:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:28:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:28:20,269 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-19 23:28:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:21,459 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2022-07-19 23:28:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:28:21,460 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-19 23:28:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:21,475 INFO L225 Difference]: With dead ends: 5900 [2022-07-19 23:28:21,476 INFO L226 Difference]: Without dead ends: 3922 [2022-07-19 23:28:21,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:28:21,482 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 1540 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:21,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1763 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 23:28:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-07-19 23:28:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2022-07-19 23:28:21,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-19 23:28:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2022-07-19 23:28:21,635 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2022-07-19 23:28:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:21,636 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2022-07-19 23:28:21,636 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-19 23:28:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2022-07-19 23:28:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 23:28:21,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:21,643 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-19 23:28:21,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:28:21,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2022-07-19 23:28:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:21,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256317746] [2022-07-19 23:28:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 23:28:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:28:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:28:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:28:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:28:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 23:28:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:28:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 23:28:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 23:28:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:21,826 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-19 23:28:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256317746] [2022-07-19 23:28:21,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256317746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:21,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:21,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:28:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464643787] [2022-07-19 23:28:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:28:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:28:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:28:21,828 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-19 23:28:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:22,637 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2022-07-19 23:28:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:28:22,638 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-19 23:28:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:22,652 INFO L225 Difference]: With dead ends: 7416 [2022-07-19 23:28:22,653 INFO L226 Difference]: Without dead ends: 3916 [2022-07-19 23:28:22,661 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-19 23:28:22,662 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 867 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:22,662 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.7s Time] [2022-07-19 23:28:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-07-19 23:28:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2022-07-19 23:28:22,772 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-19 23:28:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2022-07-19 23:28:22,782 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2022-07-19 23:28:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:22,782 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2022-07-19 23:28:22,783 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-19 23:28:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2022-07-19 23:28:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 23:28:22,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:22,789 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-19 23:28:22,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:28:22,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2022-07-19 23:28:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:22,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191986539] [2022-07-19 23:28:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 23:28:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:28:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:28:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:28:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:28:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 23:28:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:28:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 23:28:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 23:28:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,027 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-19 23:28:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191986539] [2022-07-19 23:28:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191986539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082903659] [2022-07-19 23:28:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:23,030 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-19 23:28:23,047 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-19 23:28:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:23,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 23:28:23,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:23,537 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-19 23:28:23,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:28:23,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082903659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:23,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:28:23,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-19 23:28:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670461075] [2022-07-19 23:28:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:23,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:28:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:28:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:28:23,540 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-19 23:28:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:23,829 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2022-07-19 23:28:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:28:23,830 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-19 23:28:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:23,856 INFO L225 Difference]: With dead ends: 9962 [2022-07-19 23:28:23,856 INFO L226 Difference]: Without dead ends: 6458 [2022-07-19 23:28:23,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:28:23,869 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:23,869 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.1s Time] [2022-07-19 23:28:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-07-19 23:28:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2022-07-19 23:28:24,030 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-19 23:28:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2022-07-19 23:28:24,040 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2022-07-19 23:28:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:24,041 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2022-07-19 23:28:24,041 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-19 23:28:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2022-07-19 23:28:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 23:28:24,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:24,068 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-19 23:28:24,091 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-19 23:28:24,283 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-19 23:28:24,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2022-07-19 23:28:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:24,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756585137] [2022-07-19 23:28:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 23:28:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:28:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:28:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:28:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:28:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 23:28:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:28:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:28:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:28:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 23:28:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,488 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-19 23:28:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756585137] [2022-07-19 23:28:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756585137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525820962] [2022-07-19 23:28:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:24,490 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-19 23:28:24,491 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-19 23:28:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:24,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 23:28:24,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:24,975 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-19 23:28:24,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:28:24,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525820962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:24,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:28:24,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-19 23:28:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751888290] [2022-07-19 23:28:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:24,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:28:24,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:24,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:28:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:28:24,977 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-19 23:28:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:25,883 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2022-07-19 23:28:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 23:28:25,886 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-19 23:28:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:25,936 INFO L225 Difference]: With dead ends: 14900 [2022-07-19 23:28:25,936 INFO L226 Difference]: Without dead ends: 11384 [2022-07-19 23:28:25,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-07-19 23:28:25,950 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-19 23:28:25,950 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-19 23:28:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2022-07-19 23:28:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2022-07-19 23:28:26,313 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-19 23:28:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2022-07-19 23:28:26,334 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2022-07-19 23:28:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:26,334 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2022-07-19 23:28:26,335 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-19 23:28:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2022-07-19 23:28:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 23:28:26,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:26,354 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-19 23:28:26,374 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-19 23:28:26,567 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-19 23:28:26,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2022-07-19 23:28:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010445007] [2022-07-19 23:28:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 23:28:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:28:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:28:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 23:28:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:28:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 23:28:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:28:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:28:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:28:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 23:28:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:26,831 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-19 23:28:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:26,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010445007] [2022-07-19 23:28:26,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010445007] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:26,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093691840] [2022-07-19 23:28:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:26,833 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-19 23:28:26,835 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-19 23:28:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:27,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 23:28:27,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:27,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:28:27,516 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-19 23:28:27,537 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-19 23:28:27,550 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-19 23:28:27,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:28:27,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093691840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:27,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:28:27,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2022-07-19 23:28:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856796183] [2022-07-19 23:28:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:27,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:28:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:28:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-19 23:28:27,551 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-19 23:28:30,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:30,227 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2022-07-19 23:28:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 23:28:30,230 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-19 23:28:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:30,259 INFO L225 Difference]: With dead ends: 16712 [2022-07-19 23:28:30,259 INFO L226 Difference]: Without dead ends: 9632 [2022-07-19 23:28:30,278 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-19 23:28:30,278 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 669 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:30,279 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.2s Time] [2022-07-19 23:28:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-07-19 23:28:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2022-07-19 23:28:30,718 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-19 23:28:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2022-07-19 23:28:30,743 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2022-07-19 23:28:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:30,743 INFO L495 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2022-07-19 23:28:30,744 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-19 23:28:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2022-07-19 23:28:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-19 23:28:30,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:30,759 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-19 23:28:30,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 23:28:30,975 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-19 23:28:30,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2022-07-19 23:28:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:30,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383159611] [2022-07-19 23:28:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 23:28:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:28:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 23:28:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:28:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:28:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:28:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 23:28:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:28:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 23:28:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 23:28:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,223 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-19 23:28:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383159611] [2022-07-19 23:28:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383159611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149811962] [2022-07-19 23:28:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:31,225 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-19 23:28:31,226 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-19 23:28:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:31,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 23:28:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:31,857 INFO L356 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-07-19 23:28:31,858 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-19 23:28:31,989 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-19 23:28:32,048 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 23:28:32,048 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-19 23:28:32,114 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-19 23:28:32,139 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-19 23:28:32,156 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-19 23:28:32,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:28:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149811962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:32,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:28:32,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2022-07-19 23:28:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539040283] [2022-07-19 23:28:32,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:28:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 23:28:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 23:28:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-07-19 23:28:32,389 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-19 23:28:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:37,289 INFO L93 Difference]: Finished difference Result 21557 states and 29035 transitions. [2022-07-19 23:28:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 23:28:37,289 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-19 23:28:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:37,333 INFO L225 Difference]: With dead ends: 21557 [2022-07-19 23:28:37,334 INFO L226 Difference]: Without dead ends: 13589 [2022-07-19 23:28:37,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2022-07-19 23:28:37,361 INFO L413 NwaCegarLoop]: 735 mSDtfsCounter, 2274 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 6567 mSolverCounterSat, 1408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 7975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 6567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:37,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7210 Invalid, 7975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1408 Valid, 6567 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 23:28:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2022-07-19 23:28:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 10664. [2022-07-19 23:28:37,927 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-19 23:28:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 14183 transitions. [2022-07-19 23:28:37,956 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 14183 transitions. Word has length 178 [2022-07-19 23:28:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:37,956 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 14183 transitions. [2022-07-19 23:28:37,956 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-19 23:28:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 14183 transitions. [2022-07-19 23:28:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-19 23:28:37,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:37,980 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-19 23:28:38,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 23:28:38,228 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-19 23:28:38,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2022-07-19 23:28:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:38,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463711021] [2022-07-19 23:28:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:28:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:28:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 23:28:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:28:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 23:28:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:28:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:28:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 23:28:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 23:28:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:28:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:38,529 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-19 23:28:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463711021] [2022-07-19 23:28:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463711021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410292573] [2022-07-19 23:28:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:38,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:38,532 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-19 23:28:38,533 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-19 23:28:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:39,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 23:28:39,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:39,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:28:39,188 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-19 23:28:39,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:28:39,222 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-19 23:28:39,274 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-19 23:28:39,291 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-19 23:28:39,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:28:39,376 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-19 23:28:39,405 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-19 23:28:39,415 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-19 23:28:39,431 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-19 23:28:39,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410292573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:39,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:28:39,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-19 23:28:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367020075] [2022-07-19 23:28:39,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:28:39,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 23:28:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 23:28:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=537, Unknown=4, NotChecked=196, Total=812 [2022-07-19 23:28:39,433 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-19 23:28:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:44,654 INFO L93 Difference]: Finished difference Result 21451 states and 29179 transitions. [2022-07-19 23:28:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 23:28:44,655 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-19 23:28:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:44,700 INFO L225 Difference]: With dead ends: 21451 [2022-07-19 23:28:44,701 INFO L226 Difference]: Without dead ends: 14327 [2022-07-19 23:28:44,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=1105, Unknown=4, NotChecked=284, Total=1560 [2022-07-19 23:28:44,722 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1677 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 7775 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 12917 SdHoareTripleChecker+Invalid, 8654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 7775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:44,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 12917 Invalid, 8654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 7775 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 23:28:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2022-07-19 23:28:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 10672. [2022-07-19 23:28:45,285 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-19 23:28:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 14189 transitions. [2022-07-19 23:28:45,312 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 14189 transitions. Word has length 180 [2022-07-19 23:28:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:45,312 INFO L495 AbstractCegarLoop]: Abstraction has 10672 states and 14189 transitions. [2022-07-19 23:28:45,312 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-19 23:28:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 14189 transitions. [2022-07-19 23:28:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-19 23:28:45,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:45,331 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-19 23:28:45,353 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-19 23:28:45,547 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-19 23:28:45,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104041, now seen corresponding path program 2 times [2022-07-19 23:28:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:45,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524936472] [2022-07-19 23:28:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:28:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:28:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 23:28:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 23:28:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 23:28:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 23:28:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:28:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 23:28:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:28:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:28:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:45,768 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-19 23:28:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524936472] [2022-07-19 23:28:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524936472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944149193] [2022-07-19 23:28:45,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:28:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:28:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:28:45,770 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-19 23:28:45,771 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-19 23:28:46,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:28:46,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:28:46,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 23:28:46,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:28:46,482 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-19 23:28:46,517 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-19 23:28:46,566 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-19 23:28:46,580 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-19 23:28:46,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:28:47,515 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-19 23:28:48,359 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-19 23:28:49,219 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-19 23:28:49,790 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-19 23:28:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944149193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:28:49,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:28:49,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-19 23:28:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938837030] [2022-07-19 23:28:49,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:28:49,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 23:28:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 23:28:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-07-19 23:28:49,793 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-19 23:28:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:55,715 INFO L93 Difference]: Finished difference Result 21705 states and 29574 transitions. [2022-07-19 23:28:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 23:28:55,716 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-19 23:28:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:55,760 INFO L225 Difference]: With dead ends: 21705 [2022-07-19 23:28:55,761 INFO L226 Difference]: Without dead ends: 14577 [2022-07-19 23:28:55,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=214, Invalid=1604, Unknown=4, NotChecked=340, Total=2162 [2022-07-19 23:28:55,781 INFO L413 NwaCegarLoop]: 1224 mSDtfsCounter, 1578 mSDsluCounter, 13558 mSDsCounter, 0 mSdLazyCounter, 8954 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 14782 SdHoareTripleChecker+Invalid, 9619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 8954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:28:55,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 14782 Invalid, 9619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 8954 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-19 23:28:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2022-07-19 23:28:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11553. [2022-07-19 23:28:56,428 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-19 23:28:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 15319 transitions. [2022-07-19 23:28:56,455 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 15319 transitions. Word has length 186 [2022-07-19 23:28:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:56,455 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 15319 transitions. [2022-07-19 23:28:56,455 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-19 23:28:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 15319 transitions. [2022-07-19 23:28:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 23:28:56,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:56,477 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-19 23:28:56,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 23:28:56,687 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-19 23:28:56,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1275845430, now seen corresponding path program 3 times [2022-07-19 23:28:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:56,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459736316] [2022-07-19 23:28:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:28:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 23:28:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:28:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:28:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:28:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:28:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 23:28:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 23:28:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:28:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:28:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:56,874 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-19 23:28:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:56,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459736316] [2022-07-19 23:28:56,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459736316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:56,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:56,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:28:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576023562] [2022-07-19 23:28:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:28:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:28:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:28:56,877 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-19 23:28:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:28:58,546 INFO L93 Difference]: Finished difference Result 22019 states and 30032 transitions. [2022-07-19 23:28:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:28:58,546 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-19 23:28:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:28:58,588 INFO L225 Difference]: With dead ends: 22019 [2022-07-19 23:28:58,588 INFO L226 Difference]: Without dead ends: 14867 [2022-07-19 23:28:58,605 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-19 23:28:58,606 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 901 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-19 23:28:58,606 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-19 23:28:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2022-07-19 23:28:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 11537. [2022-07-19 23:28:59,255 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-19 23:28:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 15283 transitions. [2022-07-19 23:28:59,283 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 15283 transitions. Word has length 194 [2022-07-19 23:28:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:28:59,283 INFO L495 AbstractCegarLoop]: Abstraction has 11537 states and 15283 transitions. [2022-07-19 23:28:59,283 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-19 23:28:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 15283 transitions. [2022-07-19 23:28:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 23:28:59,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:28:59,301 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-19 23:28:59,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 23:28:59,301 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:28:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:28:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -276664566, now seen corresponding path program 1 times [2022-07-19 23:28:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:28:59,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256236548] [2022-07-19 23:28:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:28:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:28:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:28:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:28:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:28:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:28:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:28:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 23:28:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:28:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:28:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:28:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:28:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:28:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 23:28:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 23:28:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:28:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:28:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:28:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:28:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:28:59,571 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-19 23:28:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:28:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256236548] [2022-07-19 23:28:59,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256236548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:28:59,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:28:59,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 23:28:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854962564] [2022-07-19 23:28:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:28:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:28:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:28:59,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:28:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:28:59,574 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-19 23:29:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:01,408 INFO L93 Difference]: Finished difference Result 19701 states and 26376 transitions. [2022-07-19 23:29:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:29:01,416 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-19 23:29:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:01,449 INFO L225 Difference]: With dead ends: 19701 [2022-07-19 23:29:01,449 INFO L226 Difference]: Without dead ends: 12565 [2022-07-19 23:29:01,466 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-19 23:29:01,466 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 858 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:01,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2369 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 23:29:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2022-07-19 23:29:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11557. [2022-07-19 23:29:02,059 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-19 23:29:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 15307 transitions. [2022-07-19 23:29:02,089 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 15307 transitions. Word has length 194 [2022-07-19 23:29:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:02,089 INFO L495 AbstractCegarLoop]: Abstraction has 11557 states and 15307 transitions. [2022-07-19 23:29:02,089 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-19 23:29:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 15307 transitions. [2022-07-19 23:29:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 23:29:02,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:02,108 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-19 23:29:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 23:29:02,108 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 454006962, now seen corresponding path program 2 times [2022-07-19 23:29:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772937927] [2022-07-19 23:29:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:29:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:29:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:29:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 23:29:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:29:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:29:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:29:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:29:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 23:29:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 23:29:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:29:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 23:29:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:02,374 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-19 23:29:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:02,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772937927] [2022-07-19 23:29:02,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772937927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596000946] [2022-07-19 23:29:02,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:29:02,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:29:02,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:29:02,377 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-19 23:29:02,378 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-19 23:29:02,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:29:02,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:29:02,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 23:29:02,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:29:03,078 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-19 23:29:03,078 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-19 23:29:03,182 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-19 23:29:03,231 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-19 23:29:03,231 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-19 23:29:03,303 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-19 23:29:03,349 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 23:29:03,349 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-19 23:29:03,408 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-19 23:29:03,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 23:29:03,488 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-19 23:29:03,591 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-19 23:29:03,610 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-19 23:29:03,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:29:03,716 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-19 23:29:03,720 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-19 23:29:03,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596000946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:03,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:29:03,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2022-07-19 23:29:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448852197] [2022-07-19 23:29:03,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:29:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 23:29:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 23:29:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1084, Unknown=11, NotChecked=134, Total=1332 [2022-07-19 23:29:03,871 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-19 23:29:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:11,305 INFO L93 Difference]: Finished difference Result 22741 states and 30552 transitions. [2022-07-19 23:29:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 23:29:11,305 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-19 23:29:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:11,344 INFO L225 Difference]: With dead ends: 22741 [2022-07-19 23:29:11,344 INFO L226 Difference]: Without dead ends: 15561 [2022-07-19 23:29:11,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=3497, Unknown=13, NotChecked=246, Total=4160 [2022-07-19 23:29:11,363 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 2382 mSDsluCounter, 13950 mSDsCounter, 0 mSdLazyCounter, 10042 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 14945 SdHoareTripleChecker+Invalid, 12079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 10042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:11,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 14945 Invalid, 12079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1187 Valid, 10042 Invalid, 0 Unknown, 850 Unchecked, 5.8s Time] [2022-07-19 23:29:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2022-07-19 23:29:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 13109. [2022-07-19 23:29:12,139 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-19 23:29:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 17312 transitions. [2022-07-19 23:29:12,172 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 17312 transitions. Word has length 200 [2022-07-19 23:29:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:12,172 INFO L495 AbstractCegarLoop]: Abstraction has 13109 states and 17312 transitions. [2022-07-19 23:29:12,173 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-19 23:29:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 17312 transitions. [2022-07-19 23:29:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-19 23:29:12,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:12,194 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-19 23:29:12,218 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-19 23:29:12,416 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-19 23:29:12,416 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1863810439, now seen corresponding path program 1 times [2022-07-19 23:29:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:12,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290923003] [2022-07-19 23:29:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:29:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:29:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:29:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:29:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:29:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:29:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:29:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:29:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:29:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:29:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 23:29:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 23:29:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 23:29:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:12,704 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-19 23:29:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290923003] [2022-07-19 23:29:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290923003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:29:12,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:29:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 23:29:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685250379] [2022-07-19 23:29:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:29:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:29:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:29:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:29:12,709 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-19 23:29:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:15,273 INFO L93 Difference]: Finished difference Result 23691 states and 32221 transitions. [2022-07-19 23:29:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:29:15,274 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-19 23:29:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:15,318 INFO L225 Difference]: With dead ends: 23691 [2022-07-19 23:29:15,319 INFO L226 Difference]: Without dead ends: 16503 [2022-07-19 23:29:15,337 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-19 23:29:15,338 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 917 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:15,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4355 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 23:29:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2022-07-19 23:29:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 13137. [2022-07-19 23:29:16,060 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-19 23:29:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 17376 transitions. [2022-07-19 23:29:16,095 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 17376 transitions. Word has length 211 [2022-07-19 23:29:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:16,095 INFO L495 AbstractCegarLoop]: Abstraction has 13137 states and 17376 transitions. [2022-07-19 23:29:16,096 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-19 23:29:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 17376 transitions. [2022-07-19 23:29:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-19 23:29:16,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:16,117 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-19 23:29:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 23:29:16,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1503128751, now seen corresponding path program 1 times [2022-07-19 23:29:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858125860] [2022-07-19 23:29:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:29:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:29:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:29:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:29:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:29:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:29:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:29:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:29:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:29:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:29:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 23:29:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 23:29:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 23:29:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,475 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-19 23:29:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858125860] [2022-07-19 23:29:16,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858125860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286669395] [2022-07-19 23:29:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:29:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:29:16,477 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-19 23:29:16,478 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-19 23:29:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:16,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 23:29:16,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:29:17,011 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-19 23:29:17,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:29:17,086 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-19 23:29:17,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286669395] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:17,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:29:17,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2022-07-19 23:29:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732878172] [2022-07-19 23:29:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:29:17,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:29:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:29:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:29:17,088 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-19 23:29:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:17,813 INFO L93 Difference]: Finished difference Result 20397 states and 27455 transitions. [2022-07-19 23:29:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:29:17,814 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-19 23:29:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:17,849 INFO L225 Difference]: With dead ends: 20397 [2022-07-19 23:29:17,850 INFO L226 Difference]: Without dead ends: 13181 [2022-07-19 23:29:17,867 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-19 23:29:17,868 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-19 23:29:17,868 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-19 23:29:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13181 states. [2022-07-19 23:29:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13181 to 13157. [2022-07-19 23:29:18,680 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-19 23:29:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 17400 transitions. [2022-07-19 23:29:18,712 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 17400 transitions. Word has length 212 [2022-07-19 23:29:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:18,713 INFO L495 AbstractCegarLoop]: Abstraction has 13157 states and 17400 transitions. [2022-07-19 23:29:18,713 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-19 23:29:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 17400 transitions. [2022-07-19 23:29:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-19 23:29:18,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:18,735 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-19 23:29:18,756 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-19 23:29:18,956 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-19 23:29:18,956 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash -361861751, now seen corresponding path program 1 times [2022-07-19 23:29:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:18,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415131709] [2022-07-19 23:29:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:29:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:29:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:29:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:29:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:29:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:29:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:29:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:29:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:29:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:29:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 23:29:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 23:29:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-19 23:29:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,240 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-19 23:29:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415131709] [2022-07-19 23:29:19,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415131709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861941654] [2022-07-19 23:29:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:29:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:29:19,242 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-19 23:29:19,243 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-19 23:29:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:19,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-19 23:29:19,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:29:19,909 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-19 23:29:19,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:29:19,942 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-19 23:29:20,131 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-19 23:29:20,159 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-19 23:29:20,211 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-19 23:29:20,226 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-19 23:29:20,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:29:21,222 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-19 23:29:22,114 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-19 23:29:22,997 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-19 23:29:23,565 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-19 23:29:23,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861941654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:23,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:29:23,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2022-07-19 23:29:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350448847] [2022-07-19 23:29:23,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:29:23,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 23:29:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:23,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 23:29:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=790, Unknown=4, NotChecked=236, Total=1122 [2022-07-19 23:29:23,568 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-19 23:29:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:30,595 INFO L93 Difference]: Finished difference Result 27093 states and 36763 transitions. [2022-07-19 23:29:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 23:29:30,596 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-19 23:29:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:30,650 INFO L225 Difference]: With dead ends: 27093 [2022-07-19 23:29:30,651 INFO L226 Difference]: Without dead ends: 19847 [2022-07-19 23:29:30,672 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-19 23:29:30,673 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2123 mSDsluCounter, 12716 mSDsCounter, 0 mSdLazyCounter, 8861 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 13965 SdHoareTripleChecker+Invalid, 10717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 8861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:30,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 13965 Invalid, 10717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 8861 Invalid, 0 Unknown, 712 Unchecked, 5.1s Time] [2022-07-19 23:29:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2022-07-19 23:29:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 13173. [2022-07-19 23:29:31,633 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-19 23:29:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 17424 transitions. [2022-07-19 23:29:31,664 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 17424 transitions. Word has length 213 [2022-07-19 23:29:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:31,665 INFO L495 AbstractCegarLoop]: Abstraction has 13173 states and 17424 transitions. [2022-07-19 23:29:31,665 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-19 23:29:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 17424 transitions. [2022-07-19 23:29:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-19 23:29:31,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:31,683 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-19 23:29:31,705 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-19 23:29:31,897 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-19 23:29:31,898 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 2 times [2022-07-19 23:29:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980985466] [2022-07-19 23:29:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:29:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 23:29:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:29:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:29:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:29:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:29:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:29:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:29:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:29:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:29:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:29:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:29:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 23:29:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-19 23:29:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:32,278 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-19 23:29:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:32,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980985466] [2022-07-19 23:29:32,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980985466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:32,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701285540] [2022-07-19 23:29:32,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:29:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:29:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:29:32,280 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-19 23:29:32,281 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-19 23:29:32,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:29:32,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:29:32,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-19 23:29:32,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:29:32,949 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-19 23:29:32,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:29:32,964 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-19 23:29:33,121 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-19 23:29:33,156 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-19 23:29:33,208 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-19 23:29:33,223 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-19 23:29:33,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:29:34,259 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-19 23:29:35,161 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-19 23:29:36,047 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-19 23:29:36,614 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-19 23:29:36,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701285540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:36,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:29:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2022-07-19 23:29:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858738658] [2022-07-19 23:29:36,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:29:36,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 23:29:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 23:29:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=907, Unknown=4, NotChecked=252, Total=1260 [2022-07-19 23:29:36,617 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-19 23:29:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:46,215 INFO L93 Difference]: Finished difference Result 30123 states and 40915 transitions. [2022-07-19 23:29:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 23:29:46,217 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-19 23:29:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:46,263 INFO L225 Difference]: With dead ends: 30123 [2022-07-19 23:29:46,263 INFO L226 Difference]: Without dead ends: 22861 [2022-07-19 23:29:46,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=530, Invalid=4174, Unknown=4, NotChecked=548, Total=5256 [2022-07-19 23:29:46,279 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2058 mSDsluCounter, 17594 mSDsCounter, 0 mSdLazyCounter, 12150 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 19048 SdHoareTripleChecker+Invalid, 14318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 12150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:46,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 19048 Invalid, 14318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 12150 Invalid, 0 Unknown, 1091 Unchecked, 7.4s Time] [2022-07-19 23:29:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2022-07-19 23:29:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 13187. [2022-07-19 23:29:47,079 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-19 23:29:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13187 states to 13187 states and 17448 transitions. [2022-07-19 23:29:47,109 INFO L78 Accepts]: Start accepts. Automaton has 13187 states and 17448 transitions. Word has length 214 [2022-07-19 23:29:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:47,109 INFO L495 AbstractCegarLoop]: Abstraction has 13187 states and 17448 transitions. [2022-07-19 23:29:47,109 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-19 23:29:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13187 states and 17448 transitions. [2022-07-19 23:29:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-19 23:29:47,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:47,127 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-19 23:29:47,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-19 23:29:47,330 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-19 23:29:47,331 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -266252569, now seen corresponding path program 1 times [2022-07-19 23:29:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:47,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475496048] [2022-07-19 23:29:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:29:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:29:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:29:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 23:29:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:29:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 23:29:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 23:29:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 23:29:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 23:29:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 23:29:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:29:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:29:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 23:29:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 23:29:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:47,779 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-19 23:29:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:29:47,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475496048] [2022-07-19 23:29:47,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475496048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:47,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789566614] [2022-07-19 23:29:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:47,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:29:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:29:47,796 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-19 23:29:47,797 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-19 23:29:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:48,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 23:29:48,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:29:48,591 INFO L356 Elim1Store]: treesize reduction 79, result has 32.5 percent of original size [2022-07-19 23:29:48,592 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-19 23:29:48,672 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-19 23:29:48,717 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-19 23:29:48,718 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-19 23:29:48,779 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-19 23:29:48,821 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 23:29:48,821 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-19 23:29:48,958 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-19 23:29:48,988 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-19 23:29:49,023 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-19 23:29:49,059 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-19 23:29:49,133 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-19 23:29:49,151 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-19 23:29:49,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:29:49,257 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-19 23:29:49,265 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-19 23:29:49,270 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-19 23:29:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789566614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:29:49,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:29:49,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2022-07-19 23:29:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405258130] [2022-07-19 23:29:49,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:29:49,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 23:29:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:29:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 23:29:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1229, Unknown=5, NotChecked=216, Total=1560 [2022-07-19 23:29:49,436 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-19 23:29:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:29:58,614 INFO L93 Difference]: Finished difference Result 25121 states and 34447 transitions. [2022-07-19 23:29:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 23:29:58,615 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-19 23:29:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:29:58,656 INFO L225 Difference]: With dead ends: 25121 [2022-07-19 23:29:58,657 INFO L226 Difference]: Without dead ends: 17861 [2022-07-19 23:29:58,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=3222, Unknown=5, NotChecked=354, Total=3906 [2022-07-19 23:29:58,672 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:29:58,672 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.3s Time] [2022-07-19 23:29:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2022-07-19 23:29:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 13433. [2022-07-19 23:29:59,476 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-19 23:29:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 17825 transitions. [2022-07-19 23:29:59,507 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 17825 transitions. Word has length 212 [2022-07-19 23:29:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:29:59,507 INFO L495 AbstractCegarLoop]: Abstraction has 13433 states and 17825 transitions. [2022-07-19 23:29:59,508 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-19 23:29:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 17825 transitions. [2022-07-19 23:29:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 23:29:59,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:29:59,526 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-19 23:29:59,547 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-19 23:29:59,726 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-19 23:29:59,726 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:29:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:29:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash 582910906, now seen corresponding path program 2 times [2022-07-19 23:29:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:29:59,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654683971] [2022-07-19 23:29:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:29:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:29:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:29:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:29:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:29:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:29:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:29:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:29:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:29:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:29:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:29:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:29:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 23:29:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:29:59,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:30:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 23:30:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 23:30:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:30:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:00,188 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-19 23:30:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:00,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654683971] [2022-07-19 23:30:00,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654683971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:00,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521259235] [2022-07-19 23:30:00,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:30:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:30:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:30:00,190 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-19 23:30:00,191 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-19 23:30:00,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 23:30:00,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:30:00,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-19 23:30:00,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:30:01,126 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-19 23:30:01,127 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-19 23:30:01,206 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-19 23:30:01,250 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-19 23:30:01,250 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-19 23:30:01,311 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-19 23:30:01,348 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 23:30:01,349 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-19 23:30:01,413 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-19 23:30:01,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:30:01,459 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-19 23:30:01,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:30:01,505 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-19 23:30:01,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:30:01,550 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-19 23:30:01,593 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-19 23:30:01,658 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-19 23:30:01,680 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-19 23:30:01,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:30:01,783 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-19 23:30:01,787 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-19 23:30:01,792 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-19 23:30:01,796 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-19 23:30:01,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521259235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:01,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:30:01,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2022-07-19 23:30:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668612817] [2022-07-19 23:30:01,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:30:01,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 23:30:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 23:30:01,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1358, Unknown=11, NotChecked=308, Total=1806 [2022-07-19 23:30:01,962 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-19 23:30:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:10,149 INFO L93 Difference]: Finished difference Result 26943 states and 37126 transitions. [2022-07-19 23:30:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 23:30:10,149 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-19 23:30:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:10,195 INFO L225 Difference]: With dead ends: 26943 [2022-07-19 23:30:10,195 INFO L226 Difference]: Without dead ends: 19675 [2022-07-19 23:30:10,213 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=4895, Unknown=13, NotChecked=588, Total=6006 [2022-07-19 23:30:10,214 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 3100 mSDsluCounter, 11239 mSDsCounter, 0 mSdLazyCounter, 8636 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3203 SdHoareTripleChecker+Valid, 12251 SdHoareTripleChecker+Invalid, 10835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 8636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:30:10,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3203 Valid, 12251 Invalid, 10835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 8636 Invalid, 0 Unknown, 528 Unchecked, 5.9s Time] [2022-07-19 23:30:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19675 states. [2022-07-19 23:30:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19675 to 13461. [2022-07-19 23:30:11,177 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-19 23:30:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 17863 transitions. [2022-07-19 23:30:11,205 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 17863 transitions. Word has length 215 [2022-07-19 23:30:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:30:11,205 INFO L495 AbstractCegarLoop]: Abstraction has 13461 states and 17863 transitions. [2022-07-19 23:30:11,205 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-19 23:30:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 17863 transitions. [2022-07-19 23:30:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-19 23:30:11,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:30:11,224 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:30:11,247 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-19 23:30:11,428 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-19 23:30:11,429 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:30:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:30:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 565303061, now seen corresponding path program 3 times [2022-07-19 23:30:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:30:11,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653899579] [2022-07-19 23:30:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:30:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:30:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:30:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:30:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:30:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:30:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:30:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:30:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:30:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:30:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:30:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:30:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 23:30:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 23:30:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 23:30:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-19 23:30:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:11,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653899579] [2022-07-19 23:30:11,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653899579] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:11,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064596145] [2022-07-19 23:30:11,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 23:30:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:30:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:30:11,964 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-19 23:30:11,965 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-19 23:30:12,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-19 23:30:12,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:30:12,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 23:30:12,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:30:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-07-19 23:30:12,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:30:12,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064596145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:30:12,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:30:12,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-07-19 23:30:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262991488] [2022-07-19 23:30:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:30:12,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:30:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:30:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-07-19 23:30:12,673 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-19 23:30:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:14,570 INFO L93 Difference]: Finished difference Result 26117 states and 35120 transitions. [2022-07-19 23:30:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:30:14,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 224 [2022-07-19 23:30:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:14,612 INFO L225 Difference]: With dead ends: 26117 [2022-07-19 23:30:14,612 INFO L226 Difference]: Without dead ends: 18831 [2022-07-19 23:30:14,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-19 23:30:14,629 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1049 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:30:14,630 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.6s Time] [2022-07-19 23:30:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2022-07-19 23:30:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 16595. [2022-07-19 23:30:15,836 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-19 23:30:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 21917 transitions. [2022-07-19 23:30:15,874 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 21917 transitions. Word has length 224 [2022-07-19 23:30:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:30:15,874 INFO L495 AbstractCegarLoop]: Abstraction has 16595 states and 21917 transitions. [2022-07-19 23:30:15,874 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-19 23:30:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 21917 transitions. [2022-07-19 23:30:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 23:30:15,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:30:15,896 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-19 23:30:15,916 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-19 23:30:16,096 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-19 23:30:16,097 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:30:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:30:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 95642230, now seen corresponding path program 1 times [2022-07-19 23:30:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:30:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654364527] [2022-07-19 23:30:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:30:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:30:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:30:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 23:30:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:30:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:30:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:30:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:30:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:30:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 23:30:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 23:30:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:30:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 23:30:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 23:30:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:30:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 23:30:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 23:30:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-19 23:30:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:16,590 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-19 23:30:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654364527] [2022-07-19 23:30:16,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654364527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:16,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964960963] [2022-07-19 23:30:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:30:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:30:16,592 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-19 23:30:16,593 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-19 23:30:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:17,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 3046 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 23:30:17,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:30:17,625 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-19 23:30:17,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:30:17,639 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-19 23:30:17,789 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-19 23:30:17,822 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-19 23:30:17,878 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-19 23:30:17,897 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-19 23:30:17,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:30:18,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7132 Int) (v_ArrVal_7135 Int) (v_ArrVal_7133 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_7133) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7132) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_7135)) 26) 1))) is different from false [2022-07-19 23:30:19,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7132 Int) (v_ArrVal_7135 Int) (v_ArrVal_7133 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_7133) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_7132) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_7135)) 26) 1))) is different from false [2022-07-19 23:30:20,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7132 Int) (v_ArrVal_7135 Int) (v_ArrVal_7133 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_7133) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_7132) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_7135)) 26) 1))) is different from false [2022-07-19 23:30:21,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7132 Int) (v_ArrVal_7135 Int) (v_ArrVal_7133 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_7133) 930 v_ArrVal_7132) 0 v_ArrVal_7135)) 26) 1))) is different from false [2022-07-19 23:30:21,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964960963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:21,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:30:21,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-07-19 23:30:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283919354] [2022-07-19 23:30:21,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:30:21,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 23:30:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 23:30:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1035, Unknown=4, NotChecked=268, Total=1406 [2022-07-19 23:30:21,106 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-19 23:30:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:33,100 INFO L93 Difference]: Finished difference Result 39231 states and 53620 transitions. [2022-07-19 23:30:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-19 23:30:33,100 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-19 23:30:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:33,185 INFO L225 Difference]: With dead ends: 39231 [2022-07-19 23:30:33,186 INFO L226 Difference]: Without dead ends: 28811 [2022-07-19 23:30:33,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=593, Invalid=5581, Unknown=4, NotChecked=628, Total=6806 [2022-07-19 23:30:33,214 INFO L413 NwaCegarLoop]: 1251 mSDtfsCounter, 1859 mSDsluCounter, 17294 mSDsCounter, 0 mSdLazyCounter, 12003 mSolverCounterSat, 849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 18545 SdHoareTripleChecker+Invalid, 13938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 849 IncrementalHoareTripleChecker+Valid, 12003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1086 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:30:33,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 18545 Invalid, 13938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [849 Valid, 12003 Invalid, 0 Unknown, 1086 Unchecked, 8.6s Time] [2022-07-19 23:30:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28811 states. [2022-07-19 23:30:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28811 to 17849. [2022-07-19 23:30:34,687 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-19 23:30:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17849 states to 17849 states and 23463 transitions. [2022-07-19 23:30:34,732 INFO L78 Accepts]: Start accepts. Automaton has 17849 states and 23463 transitions. Word has length 244 [2022-07-19 23:30:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:30:34,732 INFO L495 AbstractCegarLoop]: Abstraction has 17849 states and 23463 transitions. [2022-07-19 23:30:34,732 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-19 23:30:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 17849 states and 23463 transitions. [2022-07-19 23:30:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-19 23:30:34,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:30:34,757 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-19 23:30:34,780 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-19 23:30:34,965 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-19 23:30:34,966 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:30:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:30:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1223619748, now seen corresponding path program 2 times [2022-07-19 23:30:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:30:34,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610053933] [2022-07-19 23:30:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:30:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:30:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:30:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:30:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:30:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:30:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:30:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:30:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:30:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:30:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:30:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:30:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:30:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:30:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:30:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-19 23:30:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-19 23:30:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-19 23:30:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:35,577 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-19 23:30:35,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610053933] [2022-07-19 23:30:35,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610053933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142401744] [2022-07-19 23:30:35,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 23:30:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:30:35,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:30:35,580 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-19 23:30:35,581 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-19 23:30:36,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 23:30:36,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 23:30:36,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 23:30:36,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:30:36,413 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-19 23:30:36,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:30:36,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142401744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:30:36,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:30:36,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 24 [2022-07-19 23:30:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925572594] [2022-07-19 23:30:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:30:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:30:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:30:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-19 23:30:36,415 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-19 23:30:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:40,499 INFO L93 Difference]: Finished difference Result 36054 states and 47603 transitions. [2022-07-19 23:30:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 23:30:40,499 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-19 23:30:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:40,569 INFO L225 Difference]: With dead ends: 36054 [2022-07-19 23:30:40,569 INFO L226 Difference]: Without dead ends: 25707 [2022-07-19 23:30:40,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-07-19 23:30:40,599 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 2305 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:30:40,599 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.0s Time] [2022-07-19 23:30:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2022-07-19 23:30:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 21153. [2022-07-19 23:30:42,259 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-19 23:30:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21153 states to 21153 states and 27775 transitions. [2022-07-19 23:30:42,310 INFO L78 Accepts]: Start accepts. Automaton has 21153 states and 27775 transitions. Word has length 252 [2022-07-19 23:30:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:30:42,311 INFO L495 AbstractCegarLoop]: Abstraction has 21153 states and 27775 transitions. [2022-07-19 23:30:42,311 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-19 23:30:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21153 states and 27775 transitions. [2022-07-19 23:30:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-19 23:30:42,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:30:42,338 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-19 23:30:42,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-19 23:30:42,538 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-19 23:30:42,538 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:30:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:30:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1811935271, now seen corresponding path program 1 times [2022-07-19 23:30:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:30:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614367627] [2022-07-19 23:30:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:30:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:30:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:30:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:30:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:30:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:30:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:30:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:30:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:30:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:30:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:30:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:30:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:30:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:30:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:30:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-19 23:30:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-19 23:30:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-19 23:30:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-19 23:30:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:42,877 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-19 23:30:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:42,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614367627] [2022-07-19 23:30:42,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614367627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:30:42,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:30:42,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:30:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715163191] [2022-07-19 23:30:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:30:42,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:30:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:30:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:30:42,879 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-19 23:30:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:46,363 INFO L93 Difference]: Finished difference Result 40879 states and 54993 transitions. [2022-07-19 23:30:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:30:46,363 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-19 23:30:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:46,432 INFO L225 Difference]: With dead ends: 40879 [2022-07-19 23:30:46,432 INFO L226 Difference]: Without dead ends: 27233 [2022-07-19 23:30:46,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:30:46,461 INFO L413 NwaCegarLoop]: 903 mSDtfsCounter, 1187 mSDsluCounter, 3023 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:30:46,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 3926 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 23:30:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27233 states. [2022-07-19 23:30:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27233 to 21153. [2022-07-19 23:30:48,367 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-19 23:30:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21153 states to 21153 states and 27771 transitions. [2022-07-19 23:30:48,422 INFO L78 Accepts]: Start accepts. Automaton has 21153 states and 27771 transitions. Word has length 268 [2022-07-19 23:30:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:30:48,423 INFO L495 AbstractCegarLoop]: Abstraction has 21153 states and 27771 transitions. [2022-07-19 23:30:48,423 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-19 23:30:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 21153 states and 27771 transitions. [2022-07-19 23:30:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-19 23:30:48,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:30:48,447 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-19 23:30:48,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 23:30:48,447 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:30:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:30:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash 219750271, now seen corresponding path program 1 times [2022-07-19 23:30:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:30:48,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652008478] [2022-07-19 23:30:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:30:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:30:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:30:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:30:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:30:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:30:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:30:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:30:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:30:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:30:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:30:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:30:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:30:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:30:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:30:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:30:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:30:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:30:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-19 23:30:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-19 23:30:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:30:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 23:30:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-19 23:30:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:48,909 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-19 23:30:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:30:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652008478] [2022-07-19 23:30:48,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652008478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:30:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414668908] [2022-07-19 23:30:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:30:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:30:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:30:48,911 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-19 23:30:48,931 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-19 23:30:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:30:49,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 3443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 23:30:49,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:30:50,120 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-19 23:30:50,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:30:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414668908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:30:50,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:30:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-19 23:30:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590000108] [2022-07-19 23:30:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:30:50,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:30:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:30:50,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:30:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:30:50,121 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-19 23:30:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:30:54,829 INFO L93 Difference]: Finished difference Result 63381 states and 83212 transitions. [2022-07-19 23:30:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:30:54,830 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-19 23:30:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:30:55,007 INFO L225 Difference]: With dead ends: 63381 [2022-07-19 23:30:55,007 INFO L226 Difference]: Without dead ends: 63373 [2022-07-19 23:30:55,032 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-19 23:30:55,033 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-19 23:30:55,033 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-19 23:30:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63373 states. [2022-07-19 23:31:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63373 to 62393. [2022-07-19 23:31:00,341 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-19 23:31:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62393 states to 62393 states and 82149 transitions. [2022-07-19 23:31:00,518 INFO L78 Accepts]: Start accepts. Automaton has 62393 states and 82149 transitions. Word has length 271 [2022-07-19 23:31:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:31:00,518 INFO L495 AbstractCegarLoop]: Abstraction has 62393 states and 82149 transitions. [2022-07-19 23:31:00,519 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-19 23:31:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 62393 states and 82149 transitions. [2022-07-19 23:31:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-19 23:31:00,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:31:00,763 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-19 23:31:00,788 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-19 23:31:00,964 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-19 23:31:00,964 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:31:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:31:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -791366979, now seen corresponding path program 1 times [2022-07-19 23:31:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:31:00,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106282264] [2022-07-19 23:31:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:31:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:31:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:31:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:31:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:31:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:31:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:31:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:31:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:31:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:31:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:31:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:31:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:31:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:31:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:31:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:31:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:31:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:31:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:31:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-19 23:31:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-19 23:31:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-19 23:31:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-19 23:31:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:01,275 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-19 23:31:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:31:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106282264] [2022-07-19 23:31:01,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106282264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:31:01,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:31:01,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:31:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375168326] [2022-07-19 23:31:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:31:01,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:31:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:31:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:31:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:31:01,277 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-19 23:31:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:31:11,942 INFO L93 Difference]: Finished difference Result 146086 states and 199718 transitions. [2022-07-19 23:31:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 23:31:11,943 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-19 23:31:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:31:12,463 INFO L225 Difference]: With dead ends: 146086 [2022-07-19 23:31:12,463 INFO L226 Difference]: Without dead ends: 105212 [2022-07-19 23:31:12,554 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-19 23:31:12,554 INFO L413 NwaCegarLoop]: 818 mSDtfsCounter, 3144 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 1861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3219 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1861 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:31:12,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3219 Valid, 2957 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1861 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 23:31:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105212 states. [2022-07-19 23:31:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105212 to 82660. [2022-07-19 23:31:19,972 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-19 23:31:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82660 states to 82660 states and 108654 transitions. [2022-07-19 23:31:20,223 INFO L78 Accepts]: Start accepts. Automaton has 82660 states and 108654 transitions. Word has length 271 [2022-07-19 23:31:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:31:20,223 INFO L495 AbstractCegarLoop]: Abstraction has 82660 states and 108654 transitions. [2022-07-19 23:31:20,224 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-19 23:31:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 82660 states and 108654 transitions. [2022-07-19 23:31:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-19 23:31:20,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:31:20,334 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-19 23:31:20,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 23:31:20,334 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:31:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:31:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2140871754, now seen corresponding path program 1 times [2022-07-19 23:31:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:31:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274378642] [2022-07-19 23:31:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:31:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:31:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:31:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:31:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:31:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 23:31:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:31:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:31:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:31:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:31:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 23:31:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:31:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:31:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:31:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 23:31:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 23:31:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:31:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:31:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:31:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:31:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-19 23:31:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:31:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-19 23:31:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-19 23:31:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-19 23:31:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-19 23:31:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-07-19 23:31:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:31:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274378642] [2022-07-19 23:31:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274378642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:31:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939378357] [2022-07-19 23:31:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:31:21,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:31:21,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:31:21,523 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:31:21,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 23:31:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:31:22,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 3309 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 23:31:22,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:31:22,877 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-19 23:31:22,878 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-19 23:31:22,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:31:22,895 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-19 23:31:22,905 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 23:31:22,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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 23:31:22,993 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-19 23:31:23,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:31:23,008 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-19 23:31:23,175 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-19 23:31:23,212 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-19 23:31:23,271 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-19 23:31:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 127 proven. 12 refuted. 5 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 23:31:23,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:31:24,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12502 Int) (v_ArrVal_12499 Int) (v_ArrVal_12497 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_12499) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_12497) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_12502)) 26) 1))) is different from false [2022-07-19 23:31:25,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12502 Int) (v_ArrVal_12499 Int) (v_ArrVal_12497 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_12499) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_12497) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_12502)) 26) 1))) is different from false [2022-07-19 23:31:26,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12502 Int) (v_ArrVal_12499 Int) (v_ArrVal_12497 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_12499) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_12497) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_12502)) 26) 1))) is different from false [2022-07-19 23:31:26,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12502 Int) (v_ArrVal_12499 Int) (v_ArrVal_12497 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_12499) 930 v_ArrVal_12497) 0 v_ArrVal_12502)) 26) 1))) is different from false [2022-07-19 23:31:26,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939378357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:31:26,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:31:26,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2022-07-19 23:31:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401527627] [2022-07-19 23:31:26,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:31:26,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-19 23:31:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:31:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-19 23:31:26,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1375, Unknown=5, NotChecked=308, Total=1806 [2022-07-19 23:31:26,612 INFO L87 Difference]: Start difference. First operand 82660 states and 108654 transitions. Second operand has 35 states, 34 states have (on average 8.441176470588236) internal successors, (287), 27 states have internal predecessors, (287), 13 states have call successors, (55), 10 states have call predecessors, (55), 11 states have return successors, (54), 15 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-19 23:31:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:31:55,377 INFO L93 Difference]: Finished difference Result 241106 states and 323901 transitions. [2022-07-19 23:31:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-07-19 23:31:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 8.441176470588236) internal successors, (287), 27 states have internal predecessors, (287), 13 states have call successors, (55), 10 states have call predecessors, (55), 11 states have return successors, (54), 15 states have call predecessors, (54), 13 states have call successors, (54) Word has length 271 [2022-07-19 23:31:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:31:56,120 INFO L225 Difference]: With dead ends: 241106 [2022-07-19 23:31:56,120 INFO L226 Difference]: Without dead ends: 179881 [2022-07-19 23:31:56,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3023 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=888, Invalid=9425, Unknown=5, NotChecked=812, Total=11130 [2022-07-19 23:31:56,265 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 3429 mSDsluCounter, 23546 mSDsCounter, 0 mSdLazyCounter, 18216 mSolverCounterSat, 1954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3549 SdHoareTripleChecker+Valid, 25255 SdHoareTripleChecker+Invalid, 21298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1954 IncrementalHoareTripleChecker+Valid, 18216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1128 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:31:56,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3549 Valid, 25255 Invalid, 21298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1954 Valid, 18216 Invalid, 0 Unknown, 1128 Unchecked, 10.8s Time] [2022-07-19 23:31:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179881 states.