./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-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 0b2aee7f7e67804021e49e5736bb0f9c1b2e215c216274214a3b77fa62ce19be --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:26:52,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:26:52,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:26:52,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:26:52,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:26:52,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:26:52,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:26:52,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:26:52,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:26:52,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:26:52,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:26:52,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:26:52,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:26:52,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:26:52,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:26:52,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:26:52,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:26:52,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:26:52,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:26:52,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:26:52,741 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:26:52,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:26:52,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:26:52,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:26:52,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:26:52,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:26:52,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:26:52,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:26:52,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:26:52,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:26:52,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:26:52,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:26:52,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:26:52,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:26:52,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:26:52,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:26:52,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:26:52,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:26:52,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:26:52,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:26:52,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:26:52,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:26:52,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:26:52,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:26:52,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:26:52,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:26:52,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:26:52,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:26:52,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:26:52,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:26:52,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:26:52,771 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:26:52,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:26:52,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:26:52,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:26:52,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:26:52,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:26:52,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:26:52,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:26:52,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:52,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:26:52,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:26:52,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:26:52,775 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 -> 0b2aee7f7e67804021e49e5736bb0f9c1b2e215c216274214a3b77fa62ce19be [2022-07-12 12:26:52,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:26:52,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:26:52,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:26:52,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:26:52,984 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:26:52,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:26:53,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5932cc3/322d483899fa4a969ecdcd2dc265f0be/FLAGc479b6c0f [2022-07-12 12:26:53,605 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:26:53,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:26:53,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5932cc3/322d483899fa4a969ecdcd2dc265f0be/FLAGc479b6c0f [2022-07-12 12:26:54,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5932cc3/322d483899fa4a969ecdcd2dc265f0be [2022-07-12 12:26:54,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:26:54,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:26:54,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:54,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:26:54,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:26:54,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:54" (1/1) ... [2022-07-12 12:26:54,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1d627c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:54, skipping insertion in model container [2022-07-12 12:26:54,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:54" (1/1) ... [2022-07-12 12:26:54,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:26:54,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:26:54,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[182154,182167] [2022-07-12 12:26:55,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:55,099 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:26:55,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[182154,182167] [2022-07-12 12:26:55,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:55,339 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:26:55,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55 WrapperNode [2022-07-12 12:26:55,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:55,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:55,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:26:55,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:26:55,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,444 INFO L137 Inliner]: procedures = 174, calls = 1340, calls flagged for inlining = 82, calls inlined = 66, statements flattened = 2613 [2022-07-12 12:26:55,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:55,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:26:55,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:26:55,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:26:55,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:26:55,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:26:55,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:26:55,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:26:55,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (1/1) ... [2022-07-12 12:26:55,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:55,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:55,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:26:55,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:26:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-12 12:26:55,639 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-12 12:26:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-12 12:26:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-12 12:26:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:26:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 12:26:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 12:26:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_12 [2022-07-12 12:26:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_12 [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:26:55,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:55,641 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:26:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:26:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:26:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:26:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:26:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:26:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:26:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:26:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:26:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:26:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb_fwload [2022-07-12 12:26:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb_fwload [2022-07-12 12:26:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:26:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:26:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-12 12:26:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-12 12:26:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-12 12:26:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-12 12:26:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive_fwload [2022-07-12 12:26:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive_fwload [2022-07-12 12:26:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:26:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:26:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_send_fw_pkt [2022-07-12 12:26:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_send_fw_pkt [2022-07-12 12:26:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-12 12:26:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-12 12:26:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:26:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:26:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:26:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-12 12:26:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-12 12:26:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:26:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:26:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:26:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:26:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:26:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:26:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:26:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:26:55,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:26:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-12 12:26:55,649 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-12 12:26:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-12 12:26:55,649 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-12 12:26:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:26:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-12 12:26:55,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-12 12:26:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_9 [2022-07-12 12:26:55,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_9 [2022-07-12 12:26:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:26:55,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:26:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:26:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:26:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 12:26:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:55,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:26:55,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:26:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-12 12:26:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-12 12:26:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:26:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2022-07-12 12:26:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2022-07-12 12:26:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 12:26:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 12:26:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-12 12:26:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-12 12:26:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2022-07-12 12:26:55,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2022-07-12 12:26:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:26:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:26:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-07-12 12:26:55,653 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-07-12 12:26:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-12 12:26:55,654 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-12 12:26:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:26:55,654 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:26:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-12 12:26:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-12 12:26:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive [2022-07-12 12:26:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive [2022-07-12 12:26:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:26:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:26:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:26:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:26:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:26:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:26:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:26:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:26:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:26:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:26:56,100 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:26:56,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:26:56,339 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:26:56,971 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:26:57,619 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:26:57,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:26:57,633 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:26:57,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:26:57 BoogieIcfgContainer [2022-07-12 12:26:57,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:26:57,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:26:57,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:26:57,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:26:57,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:26:54" (1/3) ... [2022-07-12 12:26:57,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca6e052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:26:57, skipping insertion in model container [2022-07-12 12:26:57,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:55" (2/3) ... [2022-07-12 12:26:57,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca6e052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:26:57, skipping insertion in model container [2022-07-12 12:26:57,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:26:57" (3/3) ... [2022-07-12 12:26:57,646 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-12 12:26:57,656 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:26:57,656 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:26:57,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:26:57,731 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@41c491a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2955a942 [2022-07-12 12:26:57,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:26:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 826 states, 603 states have (on average 1.3747927031509122) internal successors, (829), 633 states have internal predecessors, (829), 178 states have call successors, (178), 45 states have call predecessors, (178), 43 states have return successors, (172), 166 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-12 12:26:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 12:26:57,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:26:57,744 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] [2022-07-12 12:26:57,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:26:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:26:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 527149613, now seen corresponding path program 1 times [2022-07-12 12:26:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:26:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918316806] [2022-07-12 12:26:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:26:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:26:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:26:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:26:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:26:58,158 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:26:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:26:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918316806] [2022-07-12 12:26:58,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918316806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:26:58,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:26:58,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:26:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389229163] [2022-07-12 12:26:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:26:58,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:26:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:26:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:26:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:26:58,189 INFO L87 Difference]: Start difference. First operand has 826 states, 603 states have (on average 1.3747927031509122) internal successors, (829), 633 states have internal predecessors, (829), 178 states have call successors, (178), 45 states have call predecessors, (178), 43 states have return successors, (172), 166 states have call predecessors, (172), 172 states have call successors, (172) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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:27:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:00,657 INFO L93 Difference]: Finished difference Result 2773 states and 4101 transitions. [2022-07-12 12:27:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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 29 [2022-07-12 12:27:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:00,686 INFO L225 Difference]: With dead ends: 2773 [2022-07-12 12:27:00,686 INFO L226 Difference]: Without dead ends: 1924 [2022-07-12 12:27:00,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:27:00,696 INFO L413 NwaCegarLoop]: 1255 mSDtfsCounter, 2449 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2560 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1180 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:00,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2560 Valid, 3103 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1180 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 12:27:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2022-07-12 12:27:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1585. [2022-07-12 12:27:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1165 states have (on average 1.36137339055794) internal successors, (1586), 1205 states have internal predecessors, (1586), 336 states have call successors, (336), 84 states have call predecessors, (336), 83 states have return successors, (331), 319 states have call predecessors, (331), 331 states have call successors, (331) [2022-07-12 12:27:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2253 transitions. [2022-07-12 12:27:00,855 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2253 transitions. Word has length 29 [2022-07-12 12:27:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:00,855 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 2253 transitions. [2022-07-12 12:27:00,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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:27:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2253 transitions. [2022-07-12 12:27:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 12:27:00,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:00,858 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] [2022-07-12 12:27:00,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:27:00,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 195057076, now seen corresponding path program 1 times [2022-07-12 12:27:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:00,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087859991] [2022-07-12 12:27:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:00,992 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:27:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:00,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087859991] [2022-07-12 12:27:00,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087859991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:00,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:00,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457292822] [2022-07-12 12:27:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:00,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:00,996 INFO L87 Difference]: Start difference. First operand 1585 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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:27:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:02,327 INFO L93 Difference]: Finished difference Result 1950 states and 2809 transitions. [2022-07-12 12:27:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:27:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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 39 [2022-07-12 12:27:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:02,337 INFO L225 Difference]: With dead ends: 1950 [2022-07-12 12:27:02,337 INFO L226 Difference]: Without dead ends: 1937 [2022-07-12 12:27:02,338 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:27:02,339 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 1802 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:02,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 1937 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 12:27:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2022-07-12 12:27:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1585. [2022-07-12 12:27:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1165 states have (on average 1.3605150214592274) internal successors, (1585), 1205 states have internal predecessors, (1585), 336 states have call successors, (336), 84 states have call predecessors, (336), 83 states have return successors, (331), 319 states have call predecessors, (331), 331 states have call successors, (331) [2022-07-12 12:27:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2252 transitions. [2022-07-12 12:27:02,399 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2252 transitions. Word has length 39 [2022-07-12 12:27:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:02,400 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 2252 transitions. [2022-07-12 12:27:02,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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:27:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2252 transitions. [2022-07-12 12:27:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 12:27:02,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:02,402 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] [2022-07-12 12:27:02,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:27:02,402 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 252315378, now seen corresponding path program 1 times [2022-07-12 12:27:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:02,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815694081] [2022-07-12 12:27:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:02,571 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:27:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:02,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815694081] [2022-07-12 12:27:02,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815694081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:02,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:02,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372303458] [2022-07-12 12:27:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:02,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:02,575 INFO L87 Difference]: Start difference. First operand 1585 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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:27:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:05,032 INFO L93 Difference]: Finished difference Result 5389 states and 7961 transitions. [2022-07-12 12:27:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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 39 [2022-07-12 12:27:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:05,049 INFO L225 Difference]: With dead ends: 5389 [2022-07-12 12:27:05,049 INFO L226 Difference]: Without dead ends: 3823 [2022-07-12 12:27:05,054 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:27:05,058 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 2526 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 1182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1182 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:05,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 3050 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1182 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 12:27:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2022-07-12 12:27:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3298. [2022-07-12 12:27:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2431 states have (on average 1.3562320032908268) internal successors, (3297), 2507 states have internal predecessors, (3297), 678 states have call successors, (678), 165 states have call predecessors, (678), 188 states have return successors, (793), 669 states have call predecessors, (793), 673 states have call successors, (793) [2022-07-12 12:27:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4768 transitions. [2022-07-12 12:27:05,166 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4768 transitions. Word has length 39 [2022-07-12 12:27:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:05,167 INFO L495 AbstractCegarLoop]: Abstraction has 3298 states and 4768 transitions. [2022-07-12 12:27:05,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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:27:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4768 transitions. [2022-07-12 12:27:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 12:27:05,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:05,170 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] [2022-07-12 12:27:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:27:05,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash -768568990, now seen corresponding path program 1 times [2022-07-12 12:27:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809494959] [2022-07-12 12:27:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:05,313 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:27:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:05,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809494959] [2022-07-12 12:27:05,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809494959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:05,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:05,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460083329] [2022-07-12 12:27:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:05,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:05,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:05,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:05,315 INFO L87 Difference]: Start difference. First operand 3298 states and 4768 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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:27:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:07,683 INFO L93 Difference]: Finished difference Result 10872 states and 16391 transitions. [2022-07-12 12:27:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-07-12 12:27:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:07,751 INFO L225 Difference]: With dead ends: 10872 [2022-07-12 12:27:07,751 INFO L226 Difference]: Without dead ends: 7593 [2022-07-12 12:27:07,763 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:27:07,768 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 2545 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:07,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 2914 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 12:27:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2022-07-12 12:27:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 6717. [2022-07-12 12:27:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 4956 states have (on average 1.3520984665052462) internal successors, (6701), 5104 states have internal predecessors, (6701), 1362 states have call successors, (1362), 327 states have call predecessors, (1362), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-12 12:27:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 9880 transitions. [2022-07-12 12:27:08,007 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 9880 transitions. Word has length 40 [2022-07-12 12:27:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:08,009 INFO L495 AbstractCegarLoop]: Abstraction has 6717 states and 9880 transitions. [2022-07-12 12:27:08,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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:27:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 9880 transitions. [2022-07-12 12:27:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 12:27:08,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:08,010 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:27:08,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:27:08,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1943758837, now seen corresponding path program 1 times [2022-07-12 12:27:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:08,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055771077] [2022-07-12 12:27:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:08,153 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:27:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:08,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055771077] [2022-07-12 12:27:08,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055771077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:08,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:08,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045405858] [2022-07-12 12:27:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:08,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:08,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:08,155 INFO L87 Difference]: Start difference. First operand 6717 states and 9880 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:27:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:10,499 INFO L93 Difference]: Finished difference Result 7591 states and 11290 transitions. [2022-07-12 12:27:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:10,500 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:27:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:10,533 INFO L225 Difference]: With dead ends: 7591 [2022-07-12 12:27:10,533 INFO L226 Difference]: Without dead ends: 7588 [2022-07-12 12:27:10,537 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:27:10,538 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 2530 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 1196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1196 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:10,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2633 Valid, 2935 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1196 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 12:27:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2022-07-12 12:27:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 6718. [2022-07-12 12:27:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 4957 states have (on average 1.3520274359491629) internal successors, (6702), 5105 states have internal predecessors, (6702), 1362 states have call successors, (1362), 327 states have call predecessors, (1362), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-12 12:27:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9881 transitions. [2022-07-12 12:27:10,796 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9881 transitions. Word has length 41 [2022-07-12 12:27:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:10,797 INFO L495 AbstractCegarLoop]: Abstraction has 6718 states and 9881 transitions. [2022-07-12 12:27:10,797 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:27:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9881 transitions. [2022-07-12 12:27:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 12:27:10,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:10,799 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, 1] [2022-07-12 12:27:10,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:27:10,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 126580421, now seen corresponding path program 1 times [2022-07-12 12:27:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:10,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89851093] [2022-07-12 12:27:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:10,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:10,925 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:27:10,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89851093] [2022-07-12 12:27:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89851093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349690097] [2022-07-12 12:27:10,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:10,927 INFO L87 Difference]: Start difference. First operand 6718 states and 9881 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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:27:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:12,171 INFO L93 Difference]: Finished difference Result 7587 states and 11286 transitions. [2022-07-12 12:27:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:27:12,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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 42 [2022-07-12 12:27:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:12,199 INFO L225 Difference]: With dead ends: 7587 [2022-07-12 12:27:12,199 INFO L226 Difference]: Without dead ends: 7584 [2022-07-12 12:27:12,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:27:12,203 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 1781 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:12,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 1882 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:27:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7584 states. [2022-07-12 12:27:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7584 to 6717. [2022-07-12 12:27:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 4957 states have (on average 1.3518257010288481) internal successors, (6701), 5104 states have internal predecessors, (6701), 1361 states have call successors, (1361), 327 states have call predecessors, (1361), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-12 12:27:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 9879 transitions. [2022-07-12 12:27:12,466 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 9879 transitions. Word has length 42 [2022-07-12 12:27:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:12,467 INFO L495 AbstractCegarLoop]: Abstraction has 6717 states and 9879 transitions. [2022-07-12 12:27:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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:27:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 9879 transitions. [2022-07-12 12:27:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 12:27:12,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:12,471 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, 1, 1] [2022-07-12 12:27:12,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:27:12,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -371370760, now seen corresponding path program 1 times [2022-07-12 12:27:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110713741] [2022-07-12 12:27:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,600 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:27:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110713741] [2022-07-12 12:27:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110713741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:12,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730565498] [2022-07-12 12:27:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:12,603 INFO L87 Difference]: Start difference. First operand 6717 states and 9879 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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:27:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:13,870 INFO L93 Difference]: Finished difference Result 7586 states and 11284 transitions. [2022-07-12 12:27:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:27:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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 43 [2022-07-12 12:27:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:13,902 INFO L225 Difference]: With dead ends: 7586 [2022-07-12 12:27:13,902 INFO L226 Difference]: Without dead ends: 7574 [2022-07-12 12:27:13,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:27:13,905 INFO L413 NwaCegarLoop]: 1003 mSDtfsCounter, 1784 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:13,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 1866 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 12:27:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2022-07-12 12:27:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 6707. [2022-07-12 12:27:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 4948 states have (on average 1.3516572352465643) internal successors, (6688), 5094 states have internal predecessors, (6688), 1360 states have call successors, (1360), 327 states have call predecessors, (1360), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-12 12:27:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 9865 transitions. [2022-07-12 12:27:14,111 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 9865 transitions. Word has length 43 [2022-07-12 12:27:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:14,112 INFO L495 AbstractCegarLoop]: Abstraction has 6707 states and 9865 transitions. [2022-07-12 12:27:14,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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:27:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 9865 transitions. [2022-07-12 12:27:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 12:27:14,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:14,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:14,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:27:14,121 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -134116982, now seen corresponding path program 1 times [2022-07-12 12:27:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323791284] [2022-07-12 12:27:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 12:27:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 12:27:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 12:27:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:27:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:27:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 12:27:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323791284] [2022-07-12 12:27:14,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323791284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:14,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:14,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:27:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549841458] [2022-07-12 12:27:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:14,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:27:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:27:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:27:14,461 INFO L87 Difference]: Start difference. First operand 6707 states and 9865 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:16,749 INFO L93 Difference]: Finished difference Result 16108 states and 23839 transitions. [2022-07-12 12:27:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 12:27:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2022-07-12 12:27:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:16,779 INFO L225 Difference]: With dead ends: 16108 [2022-07-12 12:27:16,780 INFO L226 Difference]: Without dead ends: 9420 [2022-07-12 12:27:16,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:27:16,800 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 2390 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2455 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1495 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:16,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2455 Valid, 3306 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1495 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 12:27:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2022-07-12 12:27:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 7983. [2022-07-12 12:27:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 5905 states have (on average 1.3483488569009314) internal successors, (7962), 6083 states have internal predecessors, (7962), 1550 states have call successors, (1550), 352 states have call predecessors, (1550), 527 states have return successors, (2169), 1643 states have call predecessors, (2169), 1547 states have call successors, (2169) [2022-07-12 12:27:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 11681 transitions. [2022-07-12 12:27:17,110 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 11681 transitions. Word has length 143 [2022-07-12 12:27:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:17,111 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 11681 transitions. [2022-07-12 12:27:17,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 11681 transitions. [2022-07-12 12:27:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 12:27:17,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:17,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:17,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:27:17,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1543029914, now seen corresponding path program 1 times [2022-07-12 12:27:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:17,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956844589] [2022-07-12 12:27:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:27:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:27:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:27:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:27:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 12:27:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956844589] [2022-07-12 12:27:17,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956844589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:17,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303036354] [2022-07-12 12:27:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:17,420 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:27:17,421 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:27:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:17,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 2718 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:27:17,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 12:27:17,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:27:17,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303036354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:17,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:27:17,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-07-12 12:27:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639835974] [2022-07-12 12:27:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:17,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:27:17,996 INFO L87 Difference]: Start difference. First operand 7983 states and 11681 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:18,655 INFO L93 Difference]: Finished difference Result 23983 states and 35141 transitions. [2022-07-12 12:27:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:18,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-07-12 12:27:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:18,717 INFO L225 Difference]: With dead ends: 23983 [2022-07-12 12:27:18,717 INFO L226 Difference]: Without dead ends: 16023 [2022-07-12 12:27:18,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:27:18,747 INFO L413 NwaCegarLoop]: 2213 mSDtfsCounter, 1438 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:18,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 7254 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:27:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2022-07-12 12:27:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 8031. [2022-07-12 12:27:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 5937 states have (on average 1.346471281792151) internal successors, (7994), 6107 states have internal predecessors, (7994), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 527 states have return successors, (2203), 1659 states have call predecessors, (2203), 1563 states have call successors, (2203) [2022-07-12 12:27:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 11763 transitions. [2022-07-12 12:27:19,216 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 11763 transitions. Word has length 152 [2022-07-12 12:27:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:19,216 INFO L495 AbstractCegarLoop]: Abstraction has 8031 states and 11763 transitions. [2022-07-12 12:27:19,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 11763 transitions. [2022-07-12 12:27:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 12:27:19,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:19,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:19,249 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:27:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:19,439 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 531912664, now seen corresponding path program 1 times [2022-07-12 12:27:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:19,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530480668] [2022-07-12 12:27:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:27:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:27:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:27:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:27:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:27:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530480668] [2022-07-12 12:27:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530480668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:19,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717355810] [2022-07-12 12:27:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:19,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:19,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:19,811 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:27:19,812 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:27:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:20,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 12:27:20,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 12:27:20,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:27:20,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717355810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:20,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:27:20,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 12:27:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734811812] [2022-07-12 12:27:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:20,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:27:20,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:20,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:27:20,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:27:20,428 INFO L87 Difference]: Start difference. First operand 8031 states and 11763 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:20,748 INFO L93 Difference]: Finished difference Result 16277 states and 23887 transitions. [2022-07-12 12:27:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:27:20,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-07-12 12:27:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:20,782 INFO L225 Difference]: With dead ends: 16277 [2022-07-12 12:27:20,782 INFO L226 Difference]: Without dead ends: 8269 [2022-07-12 12:27:20,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:27:20,806 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 256 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2273 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:27:20,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 2273 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:27:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2022-07-12 12:27:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 8031. [2022-07-12 12:27:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 5937 states have (on average 1.345123799898939) internal successors, (7986), 6099 states have internal predecessors, (7986), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 527 states have return successors, (2203), 1659 states have call predecessors, (2203), 1563 states have call successors, (2203) [2022-07-12 12:27:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 11755 transitions. [2022-07-12 12:27:21,315 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 11755 transitions. Word has length 152 [2022-07-12 12:27:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:21,315 INFO L495 AbstractCegarLoop]: Abstraction has 8031 states and 11755 transitions. [2022-07-12 12:27:21,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:27:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 11755 transitions. [2022-07-12 12:27:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 12:27:21,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:21,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:21,350 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:27:21,535 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:27:21,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash 620818428, now seen corresponding path program 1 times [2022-07-12 12:27:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:21,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111928029] [2022-07-12 12:27:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:27:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:27:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:27:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 12:27:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:27:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:27:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111928029] [2022-07-12 12:27:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111928029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639084988] [2022-07-12 12:27:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:21,895 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:27:21,896 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:27:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:22,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 2801 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 12:27:22,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 12:27:22,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:27:22,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639084988] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:27:22,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:27:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 31 [2022-07-12 12:27:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190485803] [2022-07-12 12:27:22,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:22,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 12:27:22,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 12:27:22,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:27:22,936 INFO L87 Difference]: Start difference. First operand 8031 states and 11755 transitions. Second operand has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:27:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:31,800 INFO L93 Difference]: Finished difference Result 23225 states and 36925 transitions. [2022-07-12 12:27:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 12:27:31,800 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) Word has length 157 [2022-07-12 12:27:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:31,869 INFO L225 Difference]: With dead ends: 23225 [2022-07-12 12:27:31,870 INFO L226 Difference]: Without dead ends: 15201 [2022-07-12 12:27:31,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 12:27:31,909 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 3614 mSDsluCounter, 17472 mSDsCounter, 0 mSdLazyCounter, 11205 mSolverCounterSat, 2122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 18757 SdHoareTripleChecker+Invalid, 13327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2122 IncrementalHoareTripleChecker+Valid, 11205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:31,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 18757 Invalid, 13327 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2122 Valid, 11205 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-12 12:27:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2022-07-12 12:27:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 8095. [2022-07-12 12:27:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8095 states, 5989 states have (on average 1.3421272332609784) internal successors, (8038), 6147 states have internal predecessors, (8038), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 539 states have return successors, (2243), 1675 states have call predecessors, (2243), 1563 states have call successors, (2243) [2022-07-12 12:27:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 11847 transitions. [2022-07-12 12:27:32,547 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 11847 transitions. Word has length 157 [2022-07-12 12:27:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:32,548 INFO L495 AbstractCegarLoop]: Abstraction has 8095 states and 11847 transitions. [2022-07-12 12:27:32,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-12 12:27:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 11847 transitions. [2022-07-12 12:27:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 12:27:32,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:32,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:32,581 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:27:32,775 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:27:32,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1788786096, now seen corresponding path program 1 times [2022-07-12 12:27:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:32,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99618446] [2022-07-12 12:27:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:27:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:27:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:27:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:27:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:27:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 12:27:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:33,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99618446] [2022-07-12 12:27:33,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99618446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:33,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:33,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:27:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913447910] [2022-07-12 12:27:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:33,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:27:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:27:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:27:33,121 INFO L87 Difference]: Start difference. First operand 8095 states and 11847 transitions. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:27:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:37,457 INFO L93 Difference]: Finished difference Result 17480 states and 25811 transitions. [2022-07-12 12:27:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:27:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 169 [2022-07-12 12:27:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:37,497 INFO L225 Difference]: With dead ends: 17480 [2022-07-12 12:27:37,497 INFO L226 Difference]: Without dead ends: 9408 [2022-07-12 12:27:37,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-12 12:27:37,522 INFO L413 NwaCegarLoop]: 1002 mSDtfsCounter, 1764 mSDsluCounter, 4617 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 1240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1240 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:37,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 5619 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1240 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 12:27:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9408 states. [2022-07-12 12:27:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9408 to 8135. [2022-07-12 12:27:38,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8135 states, 6021 states have (on average 1.3416376017272877) internal successors, (8078), 6171 states have internal predecessors, (8078), 1574 states have call successors, (1574), 352 states have call predecessors, (1574), 539 states have return successors, (2251), 1691 states have call predecessors, (2251), 1571 states have call successors, (2251) [2022-07-12 12:27:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8135 states to 8135 states and 11903 transitions. [2022-07-12 12:27:38,061 INFO L78 Accepts]: Start accepts. Automaton has 8135 states and 11903 transitions. Word has length 169 [2022-07-12 12:27:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:38,061 INFO L495 AbstractCegarLoop]: Abstraction has 8135 states and 11903 transitions. [2022-07-12 12:27:38,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:27:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 8135 states and 11903 transitions. [2022-07-12 12:27:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 12:27:38,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:38,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:38,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:27:38,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -92495082, now seen corresponding path program 1 times [2022-07-12 12:27:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:38,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410690475] [2022-07-12 12:27:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 12:27:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 12:27:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:27:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:27:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 12:27:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:27:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 12:27:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:38,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410690475] [2022-07-12 12:27:38,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410690475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:38,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:38,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:27:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114871346] [2022-07-12 12:27:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:38,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:27:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:27:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:27:38,355 INFO L87 Difference]: Start difference. First operand 8135 states and 11903 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:27:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:42,338 INFO L93 Difference]: Finished difference Result 17522 states and 25845 transitions. [2022-07-12 12:27:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:27:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2022-07-12 12:27:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:42,371 INFO L225 Difference]: With dead ends: 17522 [2022-07-12 12:27:42,371 INFO L226 Difference]: Without dead ends: 9406 [2022-07-12 12:27:42,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:27:42,389 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 1768 mSDsluCounter, 4638 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 4478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:42,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 5635 Invalid, 4478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 12:27:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2022-07-12 12:27:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 8136. [2022-07-12 12:27:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8136 states, 6022 states have (on average 1.3415808701428098) internal successors, (8079), 6172 states have internal predecessors, (8079), 1574 states have call successors, (1574), 352 states have call predecessors, (1574), 539 states have return successors, (2251), 1691 states have call predecessors, (2251), 1571 states have call successors, (2251) [2022-07-12 12:27:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8136 states to 8136 states and 11904 transitions. [2022-07-12 12:27:42,828 INFO L78 Accepts]: Start accepts. Automaton has 8136 states and 11904 transitions. Word has length 175 [2022-07-12 12:27:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:42,828 INFO L495 AbstractCegarLoop]: Abstraction has 8136 states and 11904 transitions. [2022-07-12 12:27:42,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:27:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8136 states and 11904 transitions. [2022-07-12 12:27:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-12 12:27:42,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:42,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:42,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:27:42,839 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -933269753, now seen corresponding path program 1 times [2022-07-12 12:27:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410947559] [2022-07-12 12:27:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:27:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:27:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:27:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:27:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:27:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 12:27:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410947559] [2022-07-12 12:27:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410947559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894556312] [2022-07-12 12:27:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:43,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:43,153 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:27:43,154 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:27:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:43,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-12 12:27:43,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:43,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:27:44,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:27:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 12:27:44,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:27:44,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894556312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:44,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:27:44,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2022-07-12 12:27:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190059390] [2022-07-12 12:27:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:44,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:27:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:44,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:27:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-07-12 12:27:44,036 INFO L87 Difference]: Start difference. First operand 8136 states and 11904 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:27:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:45,740 INFO L93 Difference]: Finished difference Result 18024 states and 26640 transitions. [2022-07-12 12:27:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 12:27:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) Word has length 176 [2022-07-12 12:27:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:45,771 INFO L225 Difference]: With dead ends: 18024 [2022-07-12 12:27:45,771 INFO L226 Difference]: Without dead ends: 9912 [2022-07-12 12:27:45,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2022-07-12 12:27:45,793 INFO L413 NwaCegarLoop]: 2198 mSDtfsCounter, 1850 mSDsluCounter, 18751 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 20949 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:45,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1892 Valid, 20949 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 12:27:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9912 states. [2022-07-12 12:27:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9912 to 8103. [2022-07-12 12:27:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 5997 states have (on average 1.3408370852092713) internal successors, (8041), 6147 states have internal predecessors, (8041), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 539 states have return successors, (2243), 1683 states have call predecessors, (2243), 1563 states have call successors, (2243) [2022-07-12 12:27:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 11850 transitions. [2022-07-12 12:27:46,235 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 11850 transitions. Word has length 176 [2022-07-12 12:27:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:46,236 INFO L495 AbstractCegarLoop]: Abstraction has 8103 states and 11850 transitions. [2022-07-12 12:27:46,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:27:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 11850 transitions. [2022-07-12 12:27:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 12:27:46,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:46,245 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:46,267 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:27:46,467 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:27:46,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1055633972, now seen corresponding path program 1 times [2022-07-12 12:27:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:46,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965654141] [2022-07-12 12:27:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:27:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:27:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:27:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 12:27:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:27:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 12:27:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 12:27:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965654141] [2022-07-12 12:27:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965654141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334492983] [2022-07-12 12:27:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:46,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:46,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:46,866 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:27:46,867 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:27:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:47,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 2998 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 12:27:47,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:27:47,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 12:27:47,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334492983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:27:47,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:27:47,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2022-07-12 12:27:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866803130] [2022-07-12 12:27:47,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:47,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 12:27:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 12:27:47,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:27:47,941 INFO L87 Difference]: Start difference. First operand 8103 states and 11850 transitions. Second operand has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) [2022-07-12 12:27:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:55,464 INFO L93 Difference]: Finished difference Result 18431 states and 27411 transitions. [2022-07-12 12:27:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 12:27:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) Word has length 196 [2022-07-12 12:27:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:55,497 INFO L225 Difference]: With dead ends: 18431 [2022-07-12 12:27:55,498 INFO L226 Difference]: Without dead ends: 10346 [2022-07-12 12:27:55,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 12:27:55,517 INFO L413 NwaCegarLoop]: 1308 mSDtfsCounter, 8018 mSDsluCounter, 10222 mSDsCounter, 0 mSdLazyCounter, 8092 mSolverCounterSat, 5160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8116 SdHoareTripleChecker+Valid, 11530 SdHoareTripleChecker+Invalid, 13252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5160 IncrementalHoareTripleChecker+Valid, 8092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:55,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8116 Valid, 11530 Invalid, 13252 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5160 Valid, 8092 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 12:27:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10346 states. [2022-07-12 12:27:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 7838. [2022-07-12 12:27:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7838 states, 5812 states have (on average 1.3406744666207846) internal successors, (7792), 5954 states have internal predecessors, (7792), 1492 states have call successors, (1492), 348 states have call predecessors, (1492), 533 states have return successors, (2145), 1615 states have call predecessors, (2145), 1489 states have call successors, (2145) [2022-07-12 12:27:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 11429 transitions. [2022-07-12 12:27:56,040 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 11429 transitions. Word has length 196 [2022-07-12 12:27:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:56,040 INFO L495 AbstractCegarLoop]: Abstraction has 7838 states and 11429 transitions. [2022-07-12 12:27:56,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) [2022-07-12 12:27:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 11429 transitions. [2022-07-12 12:27:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 12:27:56,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:56,048 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:27:56,070 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:27:56,263 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:27:56,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1991704043, now seen corresponding path program 2 times [2022-07-12 12:27:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:56,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518417799] [2022-07-12 12:27:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:27:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:27:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:27:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:27:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:27:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:27:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:27:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:27:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:27:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 12:27:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:27:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:27:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:27:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:27:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 12:27:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:56,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518417799] [2022-07-12 12:27:56,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518417799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:27:56,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212292034] [2022-07-12 12:27:56,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:27:56,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:27:56,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:27:56,938 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:27:56,940 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:27:57,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:27:57,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:27:57,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 3043 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-12 12:27:57,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:27:58,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:27:58,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:27:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 12:27:58,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:27:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 12:27:58,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212292034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:27:58,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:27:58,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 8] total 30 [2022-07-12 12:27:58,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136516760] [2022-07-12 12:27:58,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:27:58,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 12:27:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 12:27:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-07-12 12:27:58,555 INFO L87 Difference]: Start difference. First operand 7838 states and 11429 transitions. Second operand has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-12 12:28:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:19,408 INFO L93 Difference]: Finished difference Result 20972 states and 31872 transitions. [2022-07-12 12:28:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 12:28:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) Word has length 199 [2022-07-12 12:28:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:19,468 INFO L225 Difference]: With dead ends: 20972 [2022-07-12 12:28:19,468 INFO L226 Difference]: Without dead ends: 13161 [2022-07-12 12:28:19,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 443 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=613, Invalid=3677, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 12:28:19,490 INFO L413 NwaCegarLoop]: 1895 mSDtfsCounter, 9775 mSDsluCounter, 25037 mSDsCounter, 0 mSdLazyCounter, 21591 mSolverCounterSat, 4946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9907 SdHoareTripleChecker+Valid, 26932 SdHoareTripleChecker+Invalid, 26537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4946 IncrementalHoareTripleChecker+Valid, 21591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:19,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9907 Valid, 26932 Invalid, 26537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4946 Valid, 21591 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2022-07-12 12:28:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13161 states. [2022-07-12 12:28:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13161 to 7810. [2022-07-12 12:28:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7810 states, 5792 states have (on average 1.339779005524862) internal successors, (7760), 5934 states have internal predecessors, (7760), 1484 states have call successors, (1484), 348 states have call predecessors, (1484), 533 states have return successors, (2137), 1607 states have call predecessors, (2137), 1481 states have call successors, (2137) [2022-07-12 12:28:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 11381 transitions. [2022-07-12 12:28:20,159 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 11381 transitions. Word has length 199 [2022-07-12 12:28:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:20,160 INFO L495 AbstractCegarLoop]: Abstraction has 7810 states and 11381 transitions. [2022-07-12 12:28:20,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-12 12:28:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 11381 transitions. [2022-07-12 12:28:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 12:28:20,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:20,169 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:20,194 INFO 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:28:20,383 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:28:20,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1741297651, now seen corresponding path program 1 times [2022-07-12 12:28:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:20,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016545436] [2022-07-12 12:28:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:28:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:28:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:28:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:28:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:28:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:28:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:28:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 12:28:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:28:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:28:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 12:28:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:20,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016545436] [2022-07-12 12:28:20,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016545436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:20,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419365557] [2022-07-12 12:28:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:20,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:20,735 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:28:20,736 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:28:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:21,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:28:21,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 12:28:21,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:21,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419365557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:21,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:21,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 11 [2022-07-12 12:28:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426537675] [2022-07-12 12:28:21,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:21,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:28:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:21,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:28:21,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:28:21,491 INFO L87 Difference]: Start difference. First operand 7810 states and 11381 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:28:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:23,250 INFO L93 Difference]: Finished difference Result 23381 states and 34090 transitions. [2022-07-12 12:28:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:28:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 202 [2022-07-12 12:28:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:23,388 INFO L225 Difference]: With dead ends: 23381 [2022-07-12 12:28:23,388 INFO L226 Difference]: Without dead ends: 23364 [2022-07-12 12:28:23,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:28:23,397 INFO L413 NwaCegarLoop]: 2392 mSDtfsCounter, 2108 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:23,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 4453 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 12:28:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2022-07-12 12:28:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 23326. [2022-07-12 12:28:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23326 states, 17292 states have (on average 1.340735600277585) internal successors, (23184), 17730 states have internal predecessors, (23184), 4440 states have call successors, (4440), 1036 states have call predecessors, (4440), 1593 states have return successors, (6405), 4799 states have call predecessors, (6405), 4437 states have call successors, (6405) [2022-07-12 12:28:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23326 states to 23326 states and 34029 transitions. [2022-07-12 12:28:25,105 INFO L78 Accepts]: Start accepts. Automaton has 23326 states and 34029 transitions. Word has length 202 [2022-07-12 12:28:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:25,106 INFO L495 AbstractCegarLoop]: Abstraction has 23326 states and 34029 transitions. [2022-07-12 12:28:25,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:28:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 23326 states and 34029 transitions. [2022-07-12 12:28:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 12:28:25,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:25,119 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:25,141 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:28:25,322 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:28:25,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 730180401, now seen corresponding path program 1 times [2022-07-12 12:28:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658320016] [2022-07-12 12:28:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:28:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:28:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:28:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:28:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:28:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:28:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:28:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 12:28:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:28:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:28:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 12:28:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658320016] [2022-07-12 12:28:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658320016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:25,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:28:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133034278] [2022-07-12 12:28:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:25,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:28:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:28:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:28:25,603 INFO L87 Difference]: Start difference. First operand 23326 states and 34029 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 12:28:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:35,606 INFO L93 Difference]: Finished difference Result 84685 states and 126400 transitions. [2022-07-12 12:28:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:28:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 202 [2022-07-12 12:28:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:35,844 INFO L225 Difference]: With dead ends: 84685 [2022-07-12 12:28:35,845 INFO L226 Difference]: Without dead ends: 61386 [2022-07-12 12:28:35,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-07-12 12:28:35,916 INFO L413 NwaCegarLoop]: 1193 mSDtfsCounter, 5666 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 3645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5765 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 7181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3645 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:35,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5765 Valid, 4962 Invalid, 7181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3645 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 12:28:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61386 states. [2022-07-12 12:28:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61386 to 22274. [2022-07-12 12:28:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22274 states, 16492 states have (on average 1.343439243269464) internal successors, (22156), 16894 states have internal predecessors, (22156), 4344 states have call successors, (4344), 1036 states have call predecessors, (4344), 1437 states have return successors, (5709), 4607 states have call predecessors, (5709), 4341 states have call successors, (5709) [2022-07-12 12:28:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22274 states to 22274 states and 32209 transitions. [2022-07-12 12:28:38,687 INFO L78 Accepts]: Start accepts. Automaton has 22274 states and 32209 transitions. Word has length 202 [2022-07-12 12:28:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:38,687 INFO L495 AbstractCegarLoop]: Abstraction has 22274 states and 32209 transitions. [2022-07-12 12:28:38,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 12:28:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22274 states and 32209 transitions. [2022-07-12 12:28:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 12:28:38,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:38,699 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 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:28:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 12:28:38,699 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1833483783, now seen corresponding path program 1 times [2022-07-12 12:28:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:38,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782701986] [2022-07-12 12:28:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:28:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:28:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:28:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:28:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:28:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:28:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:28:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 12:28:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:28:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:28:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:28:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 12:28:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782701986] [2022-07-12 12:28:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782701986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772530886] [2022-07-12 12:28:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:40,509 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:28:40,510 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:28:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:41,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 3119 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-12 12:28:41,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:42,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:28:42,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:28:42,460 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 12:28:42,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-07-12 12:28:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:42,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 12:28:42,652 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 12:28:42,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-07-12 12:28:42,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:28:42,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 12:28:43,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-12 12:28:43,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-12 12:28:43,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 12:28:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 12:28:43,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:28:56,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772530886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:56,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:28:56,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 22] total 52 [2022-07-12 12:28:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066636913] [2022-07-12 12:28:56,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:28:56,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 12:28:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 12:28:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3498, Unknown=4, NotChecked=0, Total=3782 [2022-07-12 12:28:56,481 INFO L87 Difference]: Start difference. First operand 22274 states and 32209 transitions. Second operand has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 12:29:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:33,713 INFO L93 Difference]: Finished difference Result 66574 states and 102521 transitions. [2022-07-12 12:29:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-07-12 12:29:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) Word has length 212 [2022-07-12 12:29:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:33,882 INFO L225 Difference]: With dead ends: 66574 [2022-07-12 12:29:33,882 INFO L226 Difference]: Without dead ends: 44327 [2022-07-12 12:29:33,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 328 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7087 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=2210, Invalid=21656, Unknown=4, NotChecked=0, Total=23870 [2022-07-12 12:29:33,952 INFO L413 NwaCegarLoop]: 1854 mSDtfsCounter, 11576 mSDsluCounter, 37257 mSDsCounter, 0 mSdLazyCounter, 31003 mSolverCounterSat, 6972 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11695 SdHoareTripleChecker+Valid, 39111 SdHoareTripleChecker+Invalid, 40898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6972 IncrementalHoareTripleChecker+Valid, 31003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2923 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:33,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11695 Valid, 39111 Invalid, 40898 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6972 Valid, 31003 Invalid, 0 Unknown, 2923 Unchecked, 25.7s Time] [2022-07-12 12:29:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44327 states. [2022-07-12 12:29:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44327 to 23102. [2022-07-12 12:29:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23102 states, 17080 states have (on average 1.3379391100702576) internal successors, (22852), 17506 states have internal predecessors, (22852), 4476 states have call successors, (4476), 1108 states have call predecessors, (4476), 1545 states have return successors, (5973), 4751 states have call predecessors, (5973), 4473 states have call successors, (5973) [2022-07-12 12:29:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 33301 transitions. [2022-07-12 12:29:36,951 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 33301 transitions. Word has length 212 [2022-07-12 12:29:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:36,952 INFO L495 AbstractCegarLoop]: Abstraction has 23102 states and 33301 transitions. [2022-07-12 12:29:36,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 12:29:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 33301 transitions. [2022-07-12 12:29:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 12:29:36,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:36,964 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 12:29:36,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 12:29:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:37,165 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2098825928, now seen corresponding path program 1 times [2022-07-12 12:29:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:37,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134322742] [2022-07-12 12:29:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:29:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:29:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:29:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:29:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:29:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:29:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:29:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 12:29:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:29:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:29:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 12:29:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:29:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:37,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134322742] [2022-07-12 12:29:37,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134322742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:37,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:29:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735818094] [2022-07-12 12:29:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:37,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:29:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:29:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:37,450 INFO L87 Difference]: Start difference. First operand 23102 states and 33301 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:29:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:46,931 INFO L93 Difference]: Finished difference Result 53277 states and 78143 transitions. [2022-07-12 12:29:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:29:46,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 212 [2022-07-12 12:29:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:47,068 INFO L225 Difference]: With dead ends: 53277 [2022-07-12 12:29:47,069 INFO L226 Difference]: Without dead ends: 29854 [2022-07-12 12:29:47,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2022-07-12 12:29:47,132 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 3590 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 2581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3675 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 5946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2581 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:47,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3675 Valid, 5043 Invalid, 5946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2581 Valid, 3365 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 12:29:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29854 states. [2022-07-12 12:29:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29854 to 22562. [2022-07-12 12:29:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22562 states, 16630 states have (on average 1.3303668069753458) internal successors, (22124), 17016 states have internal predecessors, (22124), 4416 states have call successors, (4416), 1078 states have call predecessors, (4416), 1515 states have return successors, (5913), 4721 states have call predecessors, (5913), 4413 states have call successors, (5913) [2022-07-12 12:29:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22562 states to 22562 states and 32453 transitions. [2022-07-12 12:29:49,643 INFO L78 Accepts]: Start accepts. Automaton has 22562 states and 32453 transitions. Word has length 212 [2022-07-12 12:29:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:49,643 INFO L495 AbstractCegarLoop]: Abstraction has 22562 states and 32453 transitions. [2022-07-12 12:29:49,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 12:29:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22562 states and 32453 transitions. [2022-07-12 12:29:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-12 12:29:49,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:49,654 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 12:29:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 12:29:49,655 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2079284806, now seen corresponding path program 1 times [2022-07-12 12:29:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115852515] [2022-07-12 12:29:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:29:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:29:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:29:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:29:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:29:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:29:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:29:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 12:29:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:29:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:29:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 12:29:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 12:29:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:49,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115852515] [2022-07-12 12:29:49,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115852515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:49,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:49,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:29:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60658941] [2022-07-12 12:29:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:49,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:29:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:29:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:49,869 INFO L87 Difference]: Start difference. First operand 22562 states and 32453 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:53,829 INFO L93 Difference]: Finished difference Result 37057 states and 53972 transitions. [2022-07-12 12:29:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:29:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 212 [2022-07-12 12:29:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:53,871 INFO L225 Difference]: With dead ends: 37057 [2022-07-12 12:29:53,872 INFO L226 Difference]: Without dead ends: 14521 [2022-07-12 12:29:53,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:29:53,908 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 2698 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 1946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1946 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:53,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 3041 Invalid, 3464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1946 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 12:29:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2022-07-12 12:29:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 11016. [2022-07-12 12:29:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 8095 states have (on average 1.3268684373069797) internal successors, (10741), 8273 states have internal predecessors, (10741), 2177 states have call successors, (2177), 525 states have call predecessors, (2177), 743 states have return successors, (2924), 2340 states have call predecessors, (2924), 2174 states have call successors, (2924) [2022-07-12 12:29:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 15842 transitions. [2022-07-12 12:29:55,188 INFO L78 Accepts]: Start accepts. Automaton has 11016 states and 15842 transitions. Word has length 212 [2022-07-12 12:29:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:55,188 INFO L495 AbstractCegarLoop]: Abstraction has 11016 states and 15842 transitions. [2022-07-12 12:29:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11016 states and 15842 transitions. [2022-07-12 12:29:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-12 12:29:55,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:55,196 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:55,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 12:29:55,196 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1018479461, now seen corresponding path program 1 times [2022-07-12 12:29:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:55,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798553534] [2022-07-12 12:29:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:29:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:29:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:29:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:29:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:29:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:29:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:29:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 12:29:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 12:29:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:29:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:29:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 12:29:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:29:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:29:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-12 12:29:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798553534] [2022-07-12 12:29:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798553534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:29:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504438488] [2022-07-12 12:29:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:55,727 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:29:55,728 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:29:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 3517 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 12:29:56,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 12:29:56,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:56,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504438488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:56,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:29:56,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 17 [2022-07-12 12:29:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748914073] [2022-07-12 12:29:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:56,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:29:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:56,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:29:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:29:56,689 INFO L87 Difference]: Start difference. First operand 11016 states and 15842 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 12:29:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:57,817 INFO L93 Difference]: Finished difference Result 21956 states and 31592 transitions. [2022-07-12 12:29:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:29:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) Word has length 247 [2022-07-12 12:29:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:57,852 INFO L225 Difference]: With dead ends: 21956 [2022-07-12 12:29:57,852 INFO L226 Difference]: Without dead ends: 11040 [2022-07-12 12:29:57,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:29:57,872 INFO L413 NwaCegarLoop]: 1123 mSDtfsCounter, 2 mSDsluCounter, 6722 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7845 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:57,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7845 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:29:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11040 states. [2022-07-12 12:29:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11040 to 11040. [2022-07-12 12:29:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 8119 states have (on average 1.3259022047050129) internal successors, (10765), 8285 states have internal predecessors, (10765), 2177 states have call successors, (2177), 525 states have call predecessors, (2177), 743 states have return successors, (2924), 2352 states have call predecessors, (2924), 2174 states have call successors, (2924) [2022-07-12 12:29:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 15866 transitions. [2022-07-12 12:29:58,949 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 15866 transitions. Word has length 247 [2022-07-12 12:29:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:58,949 INFO L495 AbstractCegarLoop]: Abstraction has 11040 states and 15866 transitions. [2022-07-12 12:29:58,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 12:29:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 15866 transitions. [2022-07-12 12:29:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 12:29:58,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:58,956 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:58,980 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:29:59,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:59,163 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash -270283457, now seen corresponding path program 2 times [2022-07-12 12:29:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:59,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663748854] [2022-07-12 12:29:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:30:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:30:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 12:30:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:30:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 12:30:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 12:30:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 12:30:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 12:30:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:30:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:30:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:30:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 12:30:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:30:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:30:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 30 proven. 46 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-12 12:30:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:02,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663748854] [2022-07-12 12:30:02,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663748854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:30:02,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258976035] [2022-07-12 12:30:02,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:30:02,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:30:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:30:02,752 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:30:02,806 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:30:04,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 12:30:04,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:30:04,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 3543 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-12 12:30:04,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:04,988 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 6 treesize of output 5 [2022-07-12 12:30:05,670 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:30:05,912 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:30:06,031 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 12:30:06,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 12:30:06,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:30:06,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 12:30:06,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-12 12:30:07,156 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 12:30:07,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 12:30:07,285 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 12:30:07,285 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 12:30:07,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:30:07,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 12:30:07,989 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:30:07,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 32 [2022-07-12 12:30:07,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 12:30:08,025 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:30:08,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 32 [2022-07-12 12:30:08,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 12:30:08,063 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 12:30:08,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-12 12:30:08,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 12:30:08,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-12 12:30:08,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 30 [2022-07-12 12:30:08,796 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 12:30:08,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 26 [2022-07-12 12:30:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 54 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 12:30:08,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:30:10,611 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod (+ c_~usb_urb~0.offset c_~usb_urb~0.base) 18446744073709551616) 0) (forall ((v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int))) (= (mod (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) (+ 51 |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.offset|))) (.cse1 (+ 20 |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2867) |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2868) |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) .cse1))) 18446744073709551616) (mod (+ c_~usb_urb~0.offset c_~usb_urb~0.base) 18446744073709551616)))) is different from false [2022-07-12 12:30:10,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258976035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:30:10,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:30:10,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 44] total 93 [2022-07-12 12:30:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445792221] [2022-07-12 12:30:10,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:30:10,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-12 12:30:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-12 12:30:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=10450, Unknown=16, NotChecked=206, Total=11130 [2022-07-12 12:30:10,616 INFO L87 Difference]: Start difference. First operand 11040 states and 15866 transitions. Second operand has 93 states, 88 states have (on average 3.102272727272727) internal successors, (273), 72 states have internal predecessors, (273), 32 states have call successors, (59), 17 states have call predecessors, (59), 26 states have return successors, (52), 38 states have call predecessors, (52), 31 states have call successors, (52)