./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.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 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:38:18,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:38:18,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:38:18,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:38:18,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:38:18,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:38:18,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:38:18,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:38:18,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:38:18,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:38:18,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:38:18,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:38:18,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:38:18,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:38:18,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:38:18,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:38:18,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:38:18,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:38:18,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:38:18,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:38:18,491 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:38:18,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:38:18,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:38:18,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:38:18,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:38:18,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:38:18,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:38:18,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:38:18,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:38:18,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:38:18,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:38:18,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:38:18,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:38:18,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:38:18,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:38:18,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:38:18,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:38:18,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:38:18,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:38:18,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:38:18,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:38:18,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:38:18,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:38:18,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:38:18,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:38:18,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:38:18,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:38:18,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:38:18,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:38:18,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:38:18,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:38:18,529 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:38:18,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:38:18,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:38:18,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:38:18,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:38:18,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:38:18,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:38:18,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:38:18,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:38:18,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:38:18,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:38:18,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:38:18,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:38:18,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:38:18,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:38:18,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:38:18,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:38:18,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:38:18,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:38:18,534 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:38:18,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:38:18,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:38:18,535 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 -> 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d [2022-07-12 12:38:18,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:38:18,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:38:18,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:38:18,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:38:18,784 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:38:18,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:38:18,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e496b659/71a56e47afed4ea88731e2d6eaba5cd2/FLAG96e5cce17 [2022-07-12 12:38:19,476 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:38:19,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:38:19,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e496b659/71a56e47afed4ea88731e2d6eaba5cd2/FLAG96e5cce17 [2022-07-12 12:38:19,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e496b659/71a56e47afed4ea88731e2d6eaba5cd2 [2022-07-12 12:38:19,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:38:19,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:38:19,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:38:19,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:38:19,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:38:19,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:38:19" (1/1) ... [2022-07-12 12:38:19,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce36ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:19, skipping insertion in model container [2022-07-12 12:38:19,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:38:19" (1/1) ... [2022-07-12 12:38:19,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:38:19,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:38:20,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2022-07-12 12:38:21,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:38:21,093 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:38:21,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2022-07-12 12:38:21,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:38:21,481 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:38:21,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21 WrapperNode [2022-07-12 12:38:21,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:38:21,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:38:21,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:38:21,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:38:21,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,642 INFO L137 Inliner]: procedures = 180, calls = 1285, calls flagged for inlining = 87, calls inlined = 41, statements flattened = 1748 [2022-07-12 12:38:21,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:38:21,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:38:21,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:38:21,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:38:21,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:38:21,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:38:21,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:38:21,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:38:21,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (1/1) ... [2022-07-12 12:38:21,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:38:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:21,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:38:21,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:38:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-12 12:38:21,872 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-12 12:38:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-12 12:38:21,872 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-12 12:38:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 12:38:21,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 12:38:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 12:38:21,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 12:38:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 12:38:21,873 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 12:38:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:38:21,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:38:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:38:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:38:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:38:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:38:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:38:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:38:21,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:38:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:38:21,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:38:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:38:21,876 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:38:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-12 12:38:21,876 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-12 12:38:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-12 12:38:21,876 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-12 12:38:21,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:38:21,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:38:21,877 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:38:21,877 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:38:21,877 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-12 12:38:21,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-12 12:38:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:38:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 12:38:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 12:38:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:38:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:38:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-12 12:38:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-12 12:38:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:38:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:38:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:38:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:38:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:38:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-12 12:38:21,880 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-12 12:38:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-12 12:38:21,880 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-12 12:38:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:38:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-12 12:38:21,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-12 12:38:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:38:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:38:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 12:38:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:38:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:38:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:38:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 12:38:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 12:38:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-12 12:38:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-12 12:38:21,884 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 12:38:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 12:38:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:38:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:38:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-12 12:38:21,885 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-12 12:38:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:38:21,886 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:38:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-12 12:38:21,886 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-12 12:38:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 12:38:21,887 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 12:38:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:38:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:38:21,887 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:38:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 12:38:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 12:38:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:38:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:38:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:38:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:38:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-12 12:38:21,889 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-12 12:38:22,387 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:38:22,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:38:22,780 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:38:23,718 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:38:23,734 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:38:23,737 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:38:23,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:38:23 BoogieIcfgContainer [2022-07-12 12:38:23,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:38:23,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:38:23,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:38:23,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:38:23,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:38:19" (1/3) ... [2022-07-12 12:38:23,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5488cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:38:23, skipping insertion in model container [2022-07-12 12:38:23,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:38:21" (2/3) ... [2022-07-12 12:38:23,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5488cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:38:23, skipping insertion in model container [2022-07-12 12:38:23,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:38:23" (3/3) ... [2022-07-12 12:38:23,753 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:38:23,765 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:38:23,766 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:38:23,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:38:23,835 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@41a04a5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e89dd0c [2022-07-12 12:38:23,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:38:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 385 states have (on average 1.361038961038961) internal successors, (524), 399 states have internal predecessors, (524), 101 states have call successors, (101), 36 states have call predecessors, (101), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-12 12:38:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 12:38:23,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:23,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:23,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 404224410, now seen corresponding path program 1 times [2022-07-12 12:38:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:23,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686829594] [2022-07-12 12:38:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 12:38:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:24,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686829594] [2022-07-12 12:38:24,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686829594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:24,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:24,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:38:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528490787] [2022-07-12 12:38:24,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:38:24,435 INFO L87 Difference]: Start difference. First operand has 523 states, 385 states have (on average 1.361038961038961) internal successors, (524), 399 states have internal predecessors, (524), 101 states have call successors, (101), 36 states have call predecessors, (101), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 12:38:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:26,574 INFO L93 Difference]: Finished difference Result 1646 states and 2326 transitions. [2022-07-12 12:38:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-12 12:38:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:26,598 INFO L225 Difference]: With dead ends: 1646 [2022-07-12 12:38:26,598 INFO L226 Difference]: Without dead ends: 1112 [2022-07-12 12:38:26,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:26,608 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 1300 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:26,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1861 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 12:38:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-12 12:38:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 995. [2022-07-12 12:38:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 737 states have (on average 1.3351424694708276) internal successors, (984), 753 states have internal predecessors, (984), 190 states have call successors, (190), 68 states have call predecessors, (190), 67 states have return successors, (189), 183 states have call predecessors, (189), 189 states have call successors, (189) [2022-07-12 12:38:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1363 transitions. [2022-07-12 12:38:26,727 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1363 transitions. Word has length 31 [2022-07-12 12:38:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:26,727 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1363 transitions. [2022-07-12 12:38:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 12:38:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1363 transitions. [2022-07-12 12:38:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 12:38:26,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:26,731 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:38:26,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:38:26,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1978920525, now seen corresponding path program 1 times [2022-07-12 12:38:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:26,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790095804] [2022-07-12 12:38:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:38:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790095804] [2022-07-12 12:38:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790095804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:26,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:26,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:38:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101922726] [2022-07-12 12:38:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:38:26,936 INFO L87 Difference]: Start difference. First operand 995 states and 1363 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:38:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:27,956 INFO L93 Difference]: Finished difference Result 1124 states and 1531 transitions. [2022-07-12 12:38:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:38:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 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 41 [2022-07-12 12:38:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:27,963 INFO L225 Difference]: With dead ends: 1124 [2022-07-12 12:38:27,963 INFO L226 Difference]: Without dead ends: 1118 [2022-07-12 12:38:27,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:27,965 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 983 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:27,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1283 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 12:38:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-07-12 12:38:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 995. [2022-07-12 12:38:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 737 states have (on average 1.333785617367707) internal successors, (983), 753 states have internal predecessors, (983), 190 states have call successors, (190), 68 states have call predecessors, (190), 67 states have return successors, (189), 183 states have call predecessors, (189), 189 states have call successors, (189) [2022-07-12 12:38:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1362 transitions. [2022-07-12 12:38:28,018 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1362 transitions. Word has length 41 [2022-07-12 12:38:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:28,019 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1362 transitions. [2022-07-12 12:38:28,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:38:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1362 transitions. [2022-07-12 12:38:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 12:38:28,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:28,021 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:38:28,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:38:28,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash -203913163, now seen corresponding path program 1 times [2022-07-12 12:38:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:28,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856925417] [2022-07-12 12:38:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 12:38:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856925417] [2022-07-12 12:38:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856925417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:28,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:28,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532542430] [2022-07-12 12:38:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:28,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:28,292 INFO L87 Difference]: Start difference. First operand 995 states and 1362 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 12:38:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:30,458 INFO L93 Difference]: Finished difference Result 3179 states and 4385 transitions. [2022-07-12 12:38:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:38:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-12 12:38:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:30,478 INFO L225 Difference]: With dead ends: 3179 [2022-07-12 12:38:30,479 INFO L226 Difference]: Without dead ends: 2191 [2022-07-12 12:38:30,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:38:30,494 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 1293 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:30,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 2828 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 12:38:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2022-07-12 12:38:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2022. [2022-07-12 12:38:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1499 states have (on average 1.3328885923949298) internal successors, (1998), 1533 states have internal predecessors, (1998), 379 states have call successors, (379), 134 states have call predecessors, (379), 143 states have return successors, (405), 374 states have call predecessors, (405), 378 states have call successors, (405) [2022-07-12 12:38:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2782 transitions. [2022-07-12 12:38:30,597 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2782 transitions. Word has length 41 [2022-07-12 12:38:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:30,599 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2782 transitions. [2022-07-12 12:38:30,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 12:38:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2782 transitions. [2022-07-12 12:38:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 12:38:30,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:30,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-12 12:38:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:38:30,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 79979308, now seen corresponding path program 1 times [2022-07-12 12:38:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:30,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816516720] [2022-07-12 12:38:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:38:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:38:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816516720] [2022-07-12 12:38:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816516720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:30,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:30,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490603072] [2022-07-12 12:38:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:30,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:30,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:30,863 INFO L87 Difference]: Start difference. First operand 2022 states and 2782 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:38:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:32,088 INFO L93 Difference]: Finished difference Result 4446 states and 6148 transitions. [2022-07-12 12:38:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:32,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-07-12 12:38:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:32,103 INFO L225 Difference]: With dead ends: 4446 [2022-07-12 12:38:32,104 INFO L226 Difference]: Without dead ends: 2437 [2022-07-12 12:38:32,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:32,114 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 528 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:32,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1712 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:38:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-12 12:38:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2255. [2022-07-12 12:38:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1689 states have (on average 1.3510953226761397) internal successors, (2282), 1741 states have internal predecessors, (2282), 404 states have call successors, (404), 148 states have call predecessors, (404), 161 states have return successors, (434), 389 states have call predecessors, (434), 403 states have call successors, (434) [2022-07-12 12:38:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3120 transitions. [2022-07-12 12:38:32,219 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3120 transitions. Word has length 94 [2022-07-12 12:38:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:32,220 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3120 transitions. [2022-07-12 12:38:32,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:38:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3120 transitions. [2022-07-12 12:38:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 12:38:32,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:32,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-12 12:38:32,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:38:32,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash 278080431, now seen corresponding path program 1 times [2022-07-12 12:38:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:32,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799436004] [2022-07-12 12:38:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:38:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:38:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799436004] [2022-07-12 12:38:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799436004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:32,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:32,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:38:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114903606] [2022-07-12 12:38:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:32,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:38:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:38:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:38:32,573 INFO L87 Difference]: Start difference. First operand 2255 states and 3120 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 12:38:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:34,124 INFO L93 Difference]: Finished difference Result 5212 states and 7184 transitions. [2022-07-12 12:38:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:38:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2022-07-12 12:38:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:34,140 INFO L225 Difference]: With dead ends: 5212 [2022-07-12 12:38:34,140 INFO L226 Difference]: Without dead ends: 2981 [2022-07-12 12:38:34,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:38:34,149 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 793 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:34,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1694 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 12:38:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2022-07-12 12:38:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2779. [2022-07-12 12:38:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2097 states have (on average 1.3471626132570338) internal successors, (2825), 2165 states have internal predecessors, (2825), 458 states have call successors, (458), 210 states have call predecessors, (458), 223 states have return successors, (487), 431 states have call predecessors, (487), 457 states have call successors, (487) [2022-07-12 12:38:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3770 transitions. [2022-07-12 12:38:34,288 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3770 transitions. Word has length 106 [2022-07-12 12:38:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:34,289 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 3770 transitions. [2022-07-12 12:38:34,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 12:38:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3770 transitions. [2022-07-12 12:38:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 12:38:34,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:34,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:34,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:38:34,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:34,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash 954173882, now seen corresponding path program 1 times [2022-07-12 12:38:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:34,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728322450] [2022-07-12 12:38:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 12:38:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 12:38:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728322450] [2022-07-12 12:38:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728322450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:34,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519730745] [2022-07-12 12:38:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:34,599 INFO L87 Difference]: Start difference. First operand 2779 states and 3770 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, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:38:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:36,281 INFO L93 Difference]: Finished difference Result 6440 states and 8808 transitions. [2022-07-12 12:38:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:38:36,282 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, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 132 [2022-07-12 12:38:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:36,301 INFO L225 Difference]: With dead ends: 6440 [2022-07-12 12:38:36,301 INFO L226 Difference]: Without dead ends: 3685 [2022-07-12 12:38:36,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:38:36,312 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 820 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:36,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 2157 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 12:38:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-07-12 12:38:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3329. [2022-07-12 12:38:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2519 states have (on average 1.349741961095673) internal successors, (3400), 2607 states have internal predecessors, (3400), 538 states have call successors, (538), 258 states have call predecessors, (538), 271 states have return successors, (567), 499 states have call predecessors, (567), 537 states have call successors, (567) [2022-07-12 12:38:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4505 transitions. [2022-07-12 12:38:36,441 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4505 transitions. Word has length 132 [2022-07-12 12:38:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:36,442 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4505 transitions. [2022-07-12 12:38:36,442 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, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:38:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4505 transitions. [2022-07-12 12:38:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 12:38:36,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:36,450 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:38:36,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash -984455087, now seen corresponding path program 1 times [2022-07-12 12:38:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:36,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720354605] [2022-07-12 12:38:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:38:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:38:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720354605] [2022-07-12 12:38:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720354605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:36,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:36,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:38:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393397734] [2022-07-12 12:38:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:36,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:38:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:38:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:38:36,901 INFO L87 Difference]: Start difference. First operand 3329 states and 4505 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 12:38:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:38,737 INFO L93 Difference]: Finished difference Result 6957 states and 9512 transitions. [2022-07-12 12:38:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:38:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 155 [2022-07-12 12:38:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:38,755 INFO L225 Difference]: With dead ends: 6957 [2022-07-12 12:38:38,755 INFO L226 Difference]: Without dead ends: 3652 [2022-07-12 12:38:38,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:38:38,765 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 734 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:38,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2465 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 12:38:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2022-07-12 12:38:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3329. [2022-07-12 12:38:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2515 states have (on average 1.347117296222664) internal successors, (3388), 2605 states have internal predecessors, (3388), 538 states have call successors, (538), 258 states have call predecessors, (538), 275 states have return successors, (571), 501 states have call predecessors, (571), 537 states have call successors, (571) [2022-07-12 12:38:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4497 transitions. [2022-07-12 12:38:38,902 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4497 transitions. Word has length 155 [2022-07-12 12:38:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:38,904 INFO L495 AbstractCegarLoop]: Abstraction has 3329 states and 4497 transitions. [2022-07-12 12:38:38,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 12:38:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4497 transitions. [2022-07-12 12:38:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:38:38,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:38,912 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:38,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:38:38,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash -273480105, now seen corresponding path program 1 times [2022-07-12 12:38:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:38,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432542173] [2022-07-12 12:38:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 12:38:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 12:38:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:39,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432542173] [2022-07-12 12:38:39,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432542173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193325595] [2022-07-12 12:38:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:39,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:38:39,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:38:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:38:39,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:38:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:38:39,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:38:39,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193325595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:39,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:38:39,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-12 12:38:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100993608] [2022-07-12 12:38:39,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:39,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:39,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:39,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:39,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:38:39,932 INFO L87 Difference]: Start difference. First operand 3329 states and 4497 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 12:38:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:40,267 INFO L93 Difference]: Finished difference Result 8063 states and 10904 transitions. [2022-07-12 12:38:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 162 [2022-07-12 12:38:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:40,293 INFO L225 Difference]: With dead ends: 8063 [2022-07-12 12:38:40,293 INFO L226 Difference]: Without dead ends: 4758 [2022-07-12 12:38:40,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:38:40,305 INFO L413 NwaCegarLoop]: 1145 mSDtfsCounter, 725 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:40,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3698 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:38:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2022-07-12 12:38:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 3353. [2022-07-12 12:38:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 2531 states have (on average 1.3449229553536153) internal successors, (3404), 2617 states have internal predecessors, (3404), 546 states have call successors, (546), 258 states have call predecessors, (546), 275 states have return successors, (579), 509 states have call predecessors, (579), 545 states have call successors, (579) [2022-07-12 12:38:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4529 transitions. [2022-07-12 12:38:40,505 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4529 transitions. Word has length 162 [2022-07-12 12:38:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:40,506 INFO L495 AbstractCegarLoop]: Abstraction has 3353 states and 4529 transitions. [2022-07-12 12:38:40,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 12:38:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4529 transitions. [2022-07-12 12:38:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-12 12:38:40,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:40,516 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:40,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 12:38:40,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:40,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1352328716, now seen corresponding path program 1 times [2022-07-12 12:38:40,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:40,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025321962] [2022-07-12 12:38:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-12 12:38:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:41,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025321962] [2022-07-12 12:38:41,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025321962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:41,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:41,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473424101] [2022-07-12 12:38:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:41,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:41,079 INFO L87 Difference]: Start difference. First operand 3353 states and 4529 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:38:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:42,497 INFO L93 Difference]: Finished difference Result 7005 states and 9528 transitions. [2022-07-12 12:38:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 231 [2022-07-12 12:38:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:42,515 INFO L225 Difference]: With dead ends: 7005 [2022-07-12 12:38:42,516 INFO L226 Difference]: Without dead ends: 3676 [2022-07-12 12:38:42,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:42,527 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 410 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:42,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1931 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 12:38:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-07-12 12:38:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3357. [2022-07-12 12:38:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2535 states have (on average 1.344378698224852) internal successors, (3408), 2621 states have internal predecessors, (3408), 546 states have call successors, (546), 258 states have call predecessors, (546), 275 states have return successors, (579), 509 states have call predecessors, (579), 545 states have call successors, (579) [2022-07-12 12:38:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4533 transitions. [2022-07-12 12:38:42,686 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4533 transitions. Word has length 231 [2022-07-12 12:38:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:42,686 INFO L495 AbstractCegarLoop]: Abstraction has 3357 states and 4533 transitions. [2022-07-12 12:38:42,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:38:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4533 transitions. [2022-07-12 12:38:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-12 12:38:42,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:42,708 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:42,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:38:42,709 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 51540470, now seen corresponding path program 1 times [2022-07-12 12:38:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133965839] [2022-07-12 12:38:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-12 12:38:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133965839] [2022-07-12 12:38:43,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133965839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249550450] [2022-07-12 12:38:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:43,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:43,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:43,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:38:43,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:38:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:43,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 3318 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:38:43,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:38:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 12:38:44,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:38:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249550450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:44,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:38:44,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 12:38:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584581862] [2022-07-12 12:38:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:38:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:38:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:38:44,203 INFO L87 Difference]: Start difference. First operand 3357 states and 4533 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 12:38:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:44,620 INFO L93 Difference]: Finished difference Result 4833 states and 6532 transitions. [2022-07-12 12:38:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:38:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 231 [2022-07-12 12:38:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:44,648 INFO L225 Difference]: With dead ends: 4833 [2022-07-12 12:38:44,648 INFO L226 Difference]: Without dead ends: 4824 [2022-07-12 12:38:44,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:38:44,652 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 1052 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:44,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1535 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:38:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2022-07-12 12:38:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4061. [2022-07-12 12:38:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 3060 states have (on average 1.3395424836601306) internal successors, (4099), 3158 states have internal predecessors, (4099), 676 states have call successors, (676), 307 states have call predecessors, (676), 324 states have return successors, (709), 633 states have call predecessors, (709), 675 states have call successors, (709) [2022-07-12 12:38:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5484 transitions. [2022-07-12 12:38:44,849 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5484 transitions. Word has length 231 [2022-07-12 12:38:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:44,849 INFO L495 AbstractCegarLoop]: Abstraction has 4061 states and 5484 transitions. [2022-07-12 12:38:44,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 4 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 12:38:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5484 transitions. [2022-07-12 12:38:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-12 12:38:44,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:44,861 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:44,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:38:45,075 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,SelfDestructingSolverStorable9 [2022-07-12 12:38:45,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1538441839, now seen corresponding path program 1 times [2022-07-12 12:38:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414844785] [2022-07-12 12:38:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 12:38:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-12 12:38:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:45,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414844785] [2022-07-12 12:38:45,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414844785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:45,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421799926] [2022-07-12 12:38:45,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:45,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:45,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:38:45,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:38:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:46,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:38:46,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:38:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 12:38:46,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:38:46,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421799926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:46,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:38:46,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-12 12:38:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719081921] [2022-07-12 12:38:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:38:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:38:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:38:46,518 INFO L87 Difference]: Start difference. First operand 4061 states and 5484 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:38:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:46,708 INFO L93 Difference]: Finished difference Result 8098 states and 10942 transitions. [2022-07-12 12:38:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:38:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 241 [2022-07-12 12:38:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:46,727 INFO L225 Difference]: With dead ends: 8098 [2022-07-12 12:38:46,727 INFO L226 Difference]: Without dead ends: 3953 [2022-07-12 12:38:46,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:38:46,740 INFO L413 NwaCegarLoop]: 869 mSDtfsCounter, 520 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:46,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1555 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:38:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-07-12 12:38:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3953. [2022-07-12 12:38:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 2970 states have (on average 1.3282828282828283) internal successors, (3945), 3060 states have internal predecessors, (3945), 664 states have call successors, (664), 301 states have call predecessors, (664), 318 states have return successors, (697), 627 states have call predecessors, (697), 663 states have call successors, (697) [2022-07-12 12:38:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5306 transitions. [2022-07-12 12:38:46,951 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5306 transitions. Word has length 241 [2022-07-12 12:38:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:46,952 INFO L495 AbstractCegarLoop]: Abstraction has 3953 states and 5306 transitions. [2022-07-12 12:38:46,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:38:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5306 transitions. [2022-07-12 12:38:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-12 12:38:46,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:46,962 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:46,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 12:38:47,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:47,176 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2035606035, now seen corresponding path program 1 times [2022-07-12 12:38:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:47,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997626782] [2022-07-12 12:38:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 12:38:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:38:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:47,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997626782] [2022-07-12 12:38:47,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997626782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:47,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:47,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:38:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201825429] [2022-07-12 12:38:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:47,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:38:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:38:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:38:47,485 INFO L87 Difference]: Start difference. First operand 3953 states and 5306 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:38:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:49,069 INFO L93 Difference]: Finished difference Result 6097 states and 8211 transitions. [2022-07-12 12:38:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:49,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 241 [2022-07-12 12:38:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:49,084 INFO L225 Difference]: With dead ends: 6097 [2022-07-12 12:38:49,085 INFO L226 Difference]: Without dead ends: 2167 [2022-07-12 12:38:49,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:38:49,095 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 247 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:49,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2202 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 12:38:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2022-07-12 12:38:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1991. [2022-07-12 12:38:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1496 states have (on average 1.3241978609625669) internal successors, (1981), 1541 states have internal predecessors, (1981), 333 states have call successors, (333), 153 states have call predecessors, (333), 161 states have return successors, (349), 314 states have call predecessors, (349), 332 states have call successors, (349) [2022-07-12 12:38:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2663 transitions. [2022-07-12 12:38:49,184 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2663 transitions. Word has length 241 [2022-07-12 12:38:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:49,184 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2663 transitions. [2022-07-12 12:38:49,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:38:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2663 transitions. [2022-07-12 12:38:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-12 12:38:49,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:49,194 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:49,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:38:49,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2082821067, now seen corresponding path program 1 times [2022-07-12 12:38:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:49,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491733091] [2022-07-12 12:38:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:38:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-12 12:38:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:38:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:38:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:38:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:38:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-12 12:38:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:49,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491733091] [2022-07-12 12:38:49,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491733091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:49,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:38:49,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:38:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570083393] [2022-07-12 12:38:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:49,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:38:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:38:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:38:49,699 INFO L87 Difference]: Start difference. First operand 1991 states and 2663 transitions. Second operand has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 12:38:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:52,384 INFO L93 Difference]: Finished difference Result 5156 states and 6960 transitions. [2022-07-12 12:38:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:38:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 299 [2022-07-12 12:38:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:52,397 INFO L225 Difference]: With dead ends: 5156 [2022-07-12 12:38:52,398 INFO L226 Difference]: Without dead ends: 3262 [2022-07-12 12:38:52,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:38:52,405 INFO L413 NwaCegarLoop]: 1083 mSDtfsCounter, 1623 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:52,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3975 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 12:38:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-07-12 12:38:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2007. [2022-07-12 12:38:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1510 states have (on average 1.323841059602649) internal successors, (1999), 1555 states have internal predecessors, (1999), 335 states have call successors, (335), 153 states have call predecessors, (335), 161 states have return successors, (351), 316 states have call predecessors, (351), 334 states have call successors, (351) [2022-07-12 12:38:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-12 12:38:52,522 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 299 [2022-07-12 12:38:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:52,523 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-12 12:38:52,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 12:38:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-12 12:38:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-12 12:38:52,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:52,532 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:38:52,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 461066554, now seen corresponding path program 1 times [2022-07-12 12:38:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:52,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246103216] [2022-07-12 12:38:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:38:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 12:38:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:38:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:38:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:38:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:38:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-12 12:38:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246103216] [2022-07-12 12:38:53,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246103216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075476041] [2022-07-12 12:38:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:53,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:38:53,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:38:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:53,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 3671 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 12:38:53,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:38:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-12 12:38:54,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:38:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075476041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:54,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:38:54,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-07-12 12:38:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59899354] [2022-07-12 12:38:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:54,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:38:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:38:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:38:54,057 INFO L87 Difference]: Start difference. First operand 2007 states and 2685 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 12:38:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:38:54,462 INFO L93 Difference]: Finished difference Result 5435 states and 7380 transitions. [2022-07-12 12:38:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:38:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 301 [2022-07-12 12:38:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:38:54,472 INFO L225 Difference]: With dead ends: 5435 [2022-07-12 12:38:54,473 INFO L226 Difference]: Without dead ends: 3525 [2022-07-12 12:38:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:38:54,478 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 1119 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 4518 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:38:54,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 4518 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:38:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-12 12:38:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2007. [2022-07-12 12:38:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1510 states have (on average 1.323841059602649) internal successors, (1999), 1555 states have internal predecessors, (1999), 335 states have call successors, (335), 153 states have call predecessors, (335), 161 states have return successors, (351), 316 states have call predecessors, (351), 334 states have call successors, (351) [2022-07-12 12:38:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2685 transitions. [2022-07-12 12:38:54,605 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2685 transitions. Word has length 301 [2022-07-12 12:38:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:38:54,606 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2685 transitions. [2022-07-12 12:38:54,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 12:38:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2685 transitions. [2022-07-12 12:38:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-12 12:38:54,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:38:54,614 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:38:54,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:38:54,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:54,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:38:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:38:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1773182242, now seen corresponding path program 1 times [2022-07-12 12:38:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:38:54,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131768515] [2022-07-12 12:38:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:38:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:38:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:38:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:38:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:38:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 12:38:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:38:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:38:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:38:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:38:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:38:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:38:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:38:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 12:38:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 12:38:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 12:38:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:38:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:38:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:38:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:38:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:38:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:38:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:38:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:38:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:38:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-12 12:38:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:38:55,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131768515] [2022-07-12 12:38:55,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131768515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203549337] [2022-07-12 12:38:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:38:55,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:38:55,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:38:55,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:38:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:38:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:38:56,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 3705 conjuncts, 381 conjunts are in the unsatisfiable core [2022-07-12 12:38:56,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:38:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 12:38:56,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:38:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203549337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:38:56,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:38:56,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32 [2022-07-12 12:38:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780032780] [2022-07-12 12:38:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:38:56,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 12:38:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 12:38:56,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-07-12 12:38:56,880 INFO L87 Difference]: Start difference. First operand 2007 states and 2685 transitions. Second operand has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-12 12:39:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:00,031 INFO L93 Difference]: Finished difference Result 6897 states and 9442 transitions. [2022-07-12 12:39:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 12:39:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) Word has length 311 [2022-07-12 12:39:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:00,060 INFO L225 Difference]: With dead ends: 6897 [2022-07-12 12:39:00,060 INFO L226 Difference]: Without dead ends: 4987 [2022-07-12 12:39:00,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 12:39:00,067 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 3304 mSDsluCounter, 7861 mSDsCounter, 0 mSdLazyCounter, 4447 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 8663 SdHoareTripleChecker+Invalid, 4957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 4447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:00,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 8663 Invalid, 4957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 4447 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 12:39:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2022-07-12 12:39:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 3983. [2022-07-12 12:39:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 2996 states have (on average 1.3227636849132176) internal successors, (3963), 3087 states have internal predecessors, (3963), 664 states have call successors, (664), 297 states have call predecessors, (664), 322 states have return successors, (718), 634 states have call predecessors, (718), 663 states have call successors, (718) [2022-07-12 12:39:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5345 transitions. [2022-07-12 12:39:00,327 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5345 transitions. Word has length 311 [2022-07-12 12:39:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:00,328 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5345 transitions. [2022-07-12 12:39:00,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 14 states have internal predecessors, (192), 5 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (34), 7 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-12 12:39:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5345 transitions. [2022-07-12 12:39:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-07-12 12:39:00,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:00,339 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:00,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:00,567 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,SelfDestructingSolverStorable14 [2022-07-12 12:39:00,568 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1153675596, now seen corresponding path program 1 times [2022-07-12 12:39:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:00,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508462203] [2022-07-12 12:39:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:39:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:39:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:39:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 12:39:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 12:39:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:39:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:39:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 12:39:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 12:39:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:39:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:39:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 12:39:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:39:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:00,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 12:39:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-12 12:39:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:01,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508462203] [2022-07-12 12:39:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508462203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954561898] [2022-07-12 12:39:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:01,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 12:39:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:01,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 3757 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 12:39:01,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 12:39:01,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:01,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954561898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:01,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:01,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-12 12:39:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113010250] [2022-07-12 12:39:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:01,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:39:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:39:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:39:01,930 INFO L87 Difference]: Start difference. First operand 3983 states and 5345 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:02,130 INFO L93 Difference]: Finished difference Result 7928 states and 10656 transitions. [2022-07-12 12:39:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:39:02,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 323 [2022-07-12 12:39:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:02,144 INFO L225 Difference]: With dead ends: 7928 [2022-07-12 12:39:02,144 INFO L226 Difference]: Without dead ends: 4090 [2022-07-12 12:39:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:39:02,154 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 231 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:02,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:39:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-07-12 12:39:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3983. [2022-07-12 12:39:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 2996 states have (on average 1.3207610146862483) internal successors, (3957), 3081 states have internal predecessors, (3957), 664 states have call successors, (664), 297 states have call predecessors, (664), 322 states have return successors, (718), 634 states have call predecessors, (718), 663 states have call successors, (718) [2022-07-12 12:39:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5339 transitions. [2022-07-12 12:39:02,406 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5339 transitions. Word has length 323 [2022-07-12 12:39:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:02,406 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 5339 transitions. [2022-07-12 12:39:02,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 12:39:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5339 transitions. [2022-07-12 12:39:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-12 12:39:02,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:02,417 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:02,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:02,643 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,SelfDestructingSolverStorable15 [2022-07-12 12:39:02,644 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -287103134, now seen corresponding path program 1 times [2022-07-12 12:39:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432437741] [2022-07-12 12:39:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:39:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:39:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:39:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:39:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:39:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:39:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:39:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 12:39:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:39:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:39:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:39:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 12:39:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:39:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:39:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:39:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 12:39:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:03,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432437741] [2022-07-12 12:39:03,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432437741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:03,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824339536] [2022-07-12 12:39:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:03,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:03,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:03,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 12:39:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:04,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 3825 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 12:39:04,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 12:39:04,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:04,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824339536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:04,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:04,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-12 12:39:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024564782] [2022-07-12 12:39:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:39:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:39:04,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:39:04,206 INFO L87 Difference]: Start difference. First operand 3983 states and 5339 transitions. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:39:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:04,812 INFO L93 Difference]: Finished difference Result 9217 states and 12606 transitions. [2022-07-12 12:39:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:39:04,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) Word has length 325 [2022-07-12 12:39:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:04,832 INFO L225 Difference]: With dead ends: 9217 [2022-07-12 12:39:04,832 INFO L226 Difference]: Without dead ends: 5379 [2022-07-12 12:39:04,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:39:04,842 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 554 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:04,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 5398 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:39:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-07-12 12:39:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4007. [2022-07-12 12:39:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3017 states have (on average 1.31852833941001) internal successors, (3978), 3099 states have internal predecessors, (3978), 664 states have call successors, (664), 297 states have call predecessors, (664), 325 states have return successors, (730), 640 states have call predecessors, (730), 663 states have call successors, (730) [2022-07-12 12:39:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5372 transitions. [2022-07-12 12:39:05,139 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5372 transitions. Word has length 325 [2022-07-12 12:39:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:05,140 INFO L495 AbstractCegarLoop]: Abstraction has 4007 states and 5372 transitions. [2022-07-12 12:39:05,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 6 states have internal predecessors, (195), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:39:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5372 transitions. [2022-07-12 12:39:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-07-12 12:39:05,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:05,151 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:05,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:05,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:05,380 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1006763776, now seen corresponding path program 1 times [2022-07-12 12:39:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:05,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254910216] [2022-07-12 12:39:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:39:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:39:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:39:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:39:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:39:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:39:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:39:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:39:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 12:39:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 12:39:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:39:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 12:39:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 12:39:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 12:39:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 12:39:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:06,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-07-12 12:39:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254910216] [2022-07-12 12:39:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254910216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967492701] [2022-07-12 12:39:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:06,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:06,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 12:39:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:07,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 3871 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 12:39:07,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-12 12:39:07,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967492701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:07,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:07,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2022-07-12 12:39:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428844660] [2022-07-12 12:39:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:07,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:39:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:07,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:39:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:39:07,083 INFO L87 Difference]: Start difference. First operand 4007 states and 5372 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:39:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:07,327 INFO L93 Difference]: Finished difference Result 7989 states and 10718 transitions. [2022-07-12 12:39:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:39:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 334 [2022-07-12 12:39:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:07,340 INFO L225 Difference]: With dead ends: 7989 [2022-07-12 12:39:07,340 INFO L226 Difference]: Without dead ends: 4008 [2022-07-12 12:39:07,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:39:07,349 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:07,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2077 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:39:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2022-07-12 12:39:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 4008. [2022-07-12 12:39:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 3018 states have (on average 1.3184227965540092) internal successors, (3979), 3100 states have internal predecessors, (3979), 664 states have call successors, (664), 297 states have call predecessors, (664), 325 states have return successors, (730), 640 states have call predecessors, (730), 663 states have call successors, (730) [2022-07-12 12:39:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5373 transitions. [2022-07-12 12:39:07,672 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5373 transitions. Word has length 334 [2022-07-12 12:39:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:07,672 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5373 transitions. [2022-07-12 12:39:07,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 12:39:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5373 transitions. [2022-07-12 12:39:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-12 12:39:07,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:07,687 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:07,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:07,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 12:39:07,912 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1513628900, now seen corresponding path program 1 times [2022-07-12 12:39:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992381490] [2022-07-12 12:39:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 12:39:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:39:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:39:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:39:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:39:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 12:39:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:39:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:39:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:39:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 12:39:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 12:39:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-12 12:39:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-12 12:39:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992381490] [2022-07-12 12:39:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992381490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77408294] [2022-07-12 12:39:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:08,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:08,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 12:39:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:09,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 3892 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 12:39:09,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 12:39:09,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:09,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77408294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:09,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:09,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 16 [2022-07-12 12:39:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792739307] [2022-07-12 12:39:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:09,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:39:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:09,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:39:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:39:09,509 INFO L87 Difference]: Start difference. First operand 4008 states and 5373 transitions. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 5 states have internal predecessors, (204), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 12:39:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:09,883 INFO L93 Difference]: Finished difference Result 8231 states and 11094 transitions. [2022-07-12 12:39:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:39:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 5 states have internal predecessors, (204), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) Word has length 338 [2022-07-12 12:39:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:09,897 INFO L225 Difference]: With dead ends: 8231 [2022-07-12 12:39:09,897 INFO L226 Difference]: Without dead ends: 4369 [2022-07-12 12:39:09,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:39:09,905 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 75 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4612 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:09,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4612 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:39:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2022-07-12 12:39:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4038. [2022-07-12 12:39:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 3042 states have (on average 1.3159105851413544) internal successors, (4003), 3118 states have internal predecessors, (4003), 664 states have call successors, (664), 297 states have call predecessors, (664), 331 states have return successors, (742), 652 states have call predecessors, (742), 663 states have call successors, (742) [2022-07-12 12:39:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 5409 transitions. [2022-07-12 12:39:10,177 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 5409 transitions. Word has length 338 [2022-07-12 12:39:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:10,178 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 5409 transitions. [2022-07-12 12:39:10,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 5 states have internal predecessors, (204), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 12:39:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 5409 transitions. [2022-07-12 12:39:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2022-07-12 12:39:10,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:10,189 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:10,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:10,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:10,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1305419618, now seen corresponding path program 1 times [2022-07-12 12:39:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113050417] [2022-07-12 12:39:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:39:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 12:39:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:39:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:39:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 12:39:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:39:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:39:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 12:39:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:39:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:39:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:39:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 12:39:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 12:39:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 12:39:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-12 12:39:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:10,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113050417] [2022-07-12 12:39:10,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113050417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:10,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091878778] [2022-07-12 12:39:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:10,976 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:10,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 12:39:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:11,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 3886 conjuncts, 298 conjunts are in the unsatisfiable core [2022-07-12 12:39:11,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:12,053 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:39:12,054 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 12:39:12,418 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:39:12,419 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 12:39:12,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-07-12 12:39:12,920 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 12:39:12,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 12:39:13,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:39:13,788 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-12 12:39:13,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 45 [2022-07-12 12:39:14,083 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-12 12:39:14,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 12:39:14,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 69 [2022-07-12 12:39:14,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2022-07-12 12:39:14,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 75 treesize of output 62 [2022-07-12 12:39:14,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2022-07-12 12:39:14,370 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-07-12 12:39:14,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 152 [2022-07-12 12:39:14,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:39:14,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 110 [2022-07-12 12:39:14,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 40 [2022-07-12 12:39:14,403 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 11 treesize of output 7 [2022-07-12 12:39:16,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:39:16,167 INFO L356 Elim1Store]: treesize reduction 54, result has 39.3 percent of original size [2022-07-12 12:39:16,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 220 treesize of output 246 [2022-07-12 12:39:16,260 INFO L356 Elim1Store]: treesize reduction 96, result has 28.9 percent of original size [2022-07-12 12:39:16,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 308 treesize of output 261 [2022-07-12 12:39:16,284 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 12:39:16,285 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 1 case distinctions, treesize of input 268 treesize of output 270 [2022-07-12 12:39:16,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:39:16,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-07-12 12:39:16,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:39:16,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-07-12 12:39:16,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-07-12 12:39:16,450 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-12 12:39:16,451 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 128 [2022-07-12 12:39:16,640 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-12 12:39:16,640 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 109 [2022-07-12 12:39:19,538 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-12 12:39:19,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 52 [2022-07-12 12:39:19,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-12 12:39:19,946 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 12:39:19,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 131 [2022-07-12 12:39:19,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 134 [2022-07-12 12:39:20,492 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-12 12:39:20,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 52 [2022-07-12 12:39:20,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-12 12:39:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 21 proven. 145 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 12:39:21,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:39:21,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:39:21,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2022-07-12 12:39:21,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:39:21,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-07-12 12:39:22,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4113 (Array Int Int)) (v_ArrVal_4114 (Array Int Int))) (not (<= (mod (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| v_ArrVal_4114)) (.cse0 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| v_ArrVal_4113)) (.cse4 (+ c_~if_usb_driver_group1~0.offset 533))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))) 18446744073709551616) 0))) is different from false [2022-07-12 12:39:22,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091878778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:22,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:39:22,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 49] total 62 [2022-07-12 12:39:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337486670] [2022-07-12 12:39:22,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:39:22,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-12 12:39:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-12 12:39:22,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4482, Unknown=41, NotChecked=136, Total=4970 [2022-07-12 12:39:22,414 INFO L87 Difference]: Start difference. First operand 4038 states and 5409 transitions. Second operand has 62 states, 57 states have (on average 7.052631578947368) internal successors, (402), 45 states have internal predecessors, (402), 21 states have call successors, (73), 21 states have call predecessors, (73), 23 states have return successors, (75), 26 states have call predecessors, (75), 21 states have call successors, (75) [2022-07-12 12:39:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:45,485 INFO L93 Difference]: Finished difference Result 14211 states and 19389 transitions. [2022-07-12 12:39:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-12 12:39:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 57 states have (on average 7.052631578947368) internal successors, (402), 45 states have internal predecessors, (402), 21 states have call successors, (73), 21 states have call predecessors, (73), 23 states have return successors, (75), 26 states have call predecessors, (75), 21 states have call successors, (75) Word has length 335 [2022-07-12 12:39:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:45,516 INFO L225 Difference]: With dead ends: 14211 [2022-07-12 12:39:45,516 INFO L226 Difference]: Without dead ends: 10319 [2022-07-12 12:39:45,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5188 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1483, Invalid=17595, Unknown=108, NotChecked=274, Total=19460 [2022-07-12 12:39:45,530 INFO L413 NwaCegarLoop]: 1320 mSDtfsCounter, 5342 mSDsluCounter, 19358 mSDsCounter, 0 mSdLazyCounter, 25160 mSolverCounterSat, 3090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5466 SdHoareTripleChecker+Valid, 20678 SdHoareTripleChecker+Invalid, 34093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3090 IncrementalHoareTripleChecker+Valid, 25160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5843 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:45,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5466 Valid, 20678 Invalid, 34093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3090 Valid, 25160 Invalid, 0 Unknown, 5843 Unchecked, 17.4s Time] [2022-07-12 12:39:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10319 states. [2022-07-12 12:39:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10319 to 8775. [2022-07-12 12:39:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 6610 states have (on average 1.3133131618759455) internal successors, (8681), 6756 states have internal predecessors, (8681), 1461 states have call successors, (1461), 623 states have call predecessors, (1461), 703 states have return successors, (1673), 1456 states have call predecessors, (1673), 1460 states have call successors, (1673) [2022-07-12 12:39:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 11815 transitions. [2022-07-12 12:39:46,151 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 11815 transitions. Word has length 335 [2022-07-12 12:39:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:46,152 INFO L495 AbstractCegarLoop]: Abstraction has 8775 states and 11815 transitions. [2022-07-12 12:39:46,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 57 states have (on average 7.052631578947368) internal successors, (402), 45 states have internal predecessors, (402), 21 states have call successors, (73), 21 states have call predecessors, (73), 23 states have return successors, (75), 26 states have call predecessors, (75), 21 states have call successors, (75) [2022-07-12 12:39:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 11815 transitions. [2022-07-12 12:39:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-07-12 12:39:46,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:46,173 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:46,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:46,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1425782146, now seen corresponding path program 2 times [2022-07-12 12:39:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886537148] [2022-07-12 12:39:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:39:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:39:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:39:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:39:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:39:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 12:39:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:39:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:39:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:39:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 12:39:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:39:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 12:39:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-12 12:39:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-12 12:39:47,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:47,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886537148] [2022-07-12 12:39:47,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886537148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:47,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238977821] [2022-07-12 12:39:47,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:39:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:47,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:47,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:47,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 12:39:47,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 12:39:47,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:39:47,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 12:39:47,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-12 12:39:48,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:48,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238977821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:48,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:48,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 28 [2022-07-12 12:39:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307633473] [2022-07-12 12:39:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:48,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 12:39:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 12:39:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2022-07-12 12:39:48,158 INFO L87 Difference]: Start difference. First operand 8775 states and 11815 transitions. Second operand has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 11 states have internal predecessors, (203), 3 states have call successors, (37), 2 states have call predecessors, (37), 5 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:39:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:48,896 INFO L93 Difference]: Finished difference Result 16742 states and 22597 transitions. [2022-07-12 12:39:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:39:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 11 states have internal predecessors, (203), 3 states have call successors, (37), 2 states have call predecessors, (37), 5 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) Word has length 345 [2022-07-12 12:39:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:48,929 INFO L225 Difference]: With dead ends: 16742 [2022-07-12 12:39:48,929 INFO L226 Difference]: Without dead ends: 8861 [2022-07-12 12:39:48,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 12:39:48,950 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 49 mSDsluCounter, 8514 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 9231 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:48,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 9231 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:39:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2022-07-12 12:39:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 8741. [2022-07-12 12:39:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8741 states, 6584 states have (on average 1.311512758201701) internal successors, (8635), 6730 states have internal predecessors, (8635), 1459 states have call successors, (1459), 623 states have call predecessors, (1459), 697 states have return successors, (1645), 1448 states have call predecessors, (1645), 1458 states have call successors, (1645) [2022-07-12 12:39:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 11739 transitions. [2022-07-12 12:39:49,728 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 11739 transitions. Word has length 345 [2022-07-12 12:39:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:49,730 INFO L495 AbstractCegarLoop]: Abstraction has 8741 states and 11739 transitions. [2022-07-12 12:39:49,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.615384615384615) internal successors, (203), 11 states have internal predecessors, (203), 3 states have call successors, (37), 2 states have call predecessors, (37), 5 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:39:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 11739 transitions. [2022-07-12 12:39:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2022-07-12 12:39:49,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:49,746 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:49,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 12:39:49,946 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,SelfDestructingSolverStorable20 [2022-07-12 12:39:49,947 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -374975042, now seen corresponding path program 1 times [2022-07-12 12:39:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:49,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358737505] [2022-07-12 12:39:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:39:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:39:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:39:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:39:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:39:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:39:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 12:39:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:39:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:39:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:39:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 12:39:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:39:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 12:39:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:39:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:39:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 12:39:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-07-12 12:39:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:50,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358737505] [2022-07-12 12:39:50,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358737505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:50,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987967750] [2022-07-12 12:39:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:50,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:50,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:50,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 12:39:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:51,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 4133 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 12:39:51,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 12:39:51,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:39:51,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987967750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:39:51,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:39:51,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 16 [2022-07-12 12:39:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345846904] [2022-07-12 12:39:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:39:51,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:39:51,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:39:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:39:51,628 INFO L87 Difference]: Start difference. First operand 8741 states and 11739 transitions. Second operand has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 12:39:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:39:52,318 INFO L93 Difference]: Finished difference Result 13647 states and 18414 transitions. [2022-07-12 12:39:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:39:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) Word has length 358 [2022-07-12 12:39:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:39:52,352 INFO L225 Difference]: With dead ends: 13647 [2022-07-12 12:39:52,352 INFO L226 Difference]: Without dead ends: 9371 [2022-07-12 12:39:52,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:39:52,367 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 140 mSDsluCounter, 5198 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:39:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 5965 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:39:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9371 states. [2022-07-12 12:39:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9371 to 8782. [2022-07-12 12:39:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8782 states, 6619 states have (on average 1.3097144583773983) internal successors, (8669), 6759 states have internal predecessors, (8669), 1458 states have call successors, (1458), 623 states have call predecessors, (1458), 704 states have return successors, (1658), 1460 states have call predecessors, (1658), 1457 states have call successors, (1658) [2022-07-12 12:39:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8782 states to 8782 states and 11785 transitions. [2022-07-12 12:39:53,109 INFO L78 Accepts]: Start accepts. Automaton has 8782 states and 11785 transitions. Word has length 358 [2022-07-12 12:39:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:39:53,109 INFO L495 AbstractCegarLoop]: Abstraction has 8782 states and 11785 transitions. [2022-07-12 12:39:53,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (40), 4 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 12:39:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8782 states and 11785 transitions. [2022-07-12 12:39:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-07-12 12:39:53,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:39:53,127 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:39:53,157 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-12 12:39:53,346 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,SelfDestructingSolverStorable21 [2022-07-12 12:39:53,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:39:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:39:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash -475300320, now seen corresponding path program 1 times [2022-07-12 12:39:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:39:53,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502638312] [2022-07-12 12:39:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:39:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:39:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:39:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 12:39:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 12:39:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:39:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:39:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 12:39:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:39:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 12:39:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:39:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 12:39:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 12:39:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 12:39:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-12 12:39:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:39:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:39:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 12:39:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-12 12:39:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:39:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:39:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:39:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:39:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:39:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:39:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:39:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:39:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:39:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 12:39:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:39:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502638312] [2022-07-12 12:39:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502638312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:39:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567589387] [2022-07-12 12:39:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:39:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:39:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:39:54,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:39:54,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 12:39:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:39:57,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 4191 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 12:39:57,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:39:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-12 12:39:57,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:39:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 12:39:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567589387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:39:58,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:39:58,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2022-07-12 12:39:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132632879] [2022-07-12 12:39:58,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:39:58,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 12:39:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:39:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 12:39:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:39:58,096 INFO L87 Difference]: Start difference. First operand 8782 states and 11785 transitions. Second operand has 17 states, 17 states have (on average 17.647058823529413) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (98), 9 states have call predecessors, (98), 5 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2022-07-12 12:40:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:40:01,785 INFO L93 Difference]: Finished difference Result 18009 states and 24280 transitions. [2022-07-12 12:40:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:40:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.647058823529413) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (98), 9 states have call predecessors, (98), 5 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 373 [2022-07-12 12:40:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:40:01,815 INFO L225 Difference]: With dead ends: 18009 [2022-07-12 12:40:01,815 INFO L226 Difference]: Without dead ends: 9252 [2022-07-12 12:40:01,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 823 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-07-12 12:40:01,901 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 583 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 4828 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:40:01,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 4828 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 12:40:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9252 states. [2022-07-12 12:40:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9252 to 8785. [2022-07-12 12:40:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8785 states, 6622 states have (on average 1.3095741467834492) internal successors, (8672), 6762 states have internal predecessors, (8672), 1458 states have call successors, (1458), 623 states have call predecessors, (1458), 704 states have return successors, (1658), 1460 states have call predecessors, (1658), 1457 states have call successors, (1658) [2022-07-12 12:40:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8785 states to 8785 states and 11788 transitions. [2022-07-12 12:40:02,551 INFO L78 Accepts]: Start accepts. Automaton has 8785 states and 11788 transitions. Word has length 373 [2022-07-12 12:40:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:40:02,551 INFO L495 AbstractCegarLoop]: Abstraction has 8785 states and 11788 transitions. [2022-07-12 12:40:02,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.647058823529413) internal successors, (300), 10 states have internal predecessors, (300), 2 states have call successors, (98), 9 states have call predecessors, (98), 5 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2022-07-12 12:40:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8785 states and 11788 transitions. [2022-07-12 12:40:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-07-12 12:40:02,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:40:02,572 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:40:02,611 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-12 12:40:02,788 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,SelfDestructingSolverStorable22 [2022-07-12 12:40:02,789 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:40:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:40:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1806371074, now seen corresponding path program 2 times [2022-07-12 12:40:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:40:02,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213057124] [2022-07-12 12:40:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:40:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:40:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 12:40:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:40:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:40:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:40:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:40:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:40:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 12:40:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:40:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 12:40:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 12:40:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:40:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 12:40:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:40:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 12:40:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 12:40:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 12:40:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 12:40:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:40:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:40:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:40:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat