./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 14:28:13,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 14:28:13,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 14:28:13,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 14:28:13,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 14:28:13,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 14:28:13,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 14:28:13,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 14:28:13,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 14:28:13,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 14:28:13,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 14:28:13,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 14:28:13,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 14:28:13,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 14:28:13,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 14:28:13,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 14:28:13,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 14:28:13,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 14:28:13,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 14:28:13,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 14:28:13,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 14:28:13,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 14:28:13,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 14:28:13,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 14:28:13,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 14:28:13,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 14:28:13,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 14:28:13,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 14:28:13,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 14:28:13,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 14:28:13,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 14:28:13,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 14:28:13,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 14:28:13,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 14:28:13,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 14:28:13,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 14:28:13,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 14:28:13,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 14:28:13,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 14:28:13,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 14:28:13,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 14:28:13,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 14:28:13,682 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 14:28:13,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 14:28:13,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 14:28:13,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 14:28:13,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 14:28:13,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 14:28:13,684 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 14:28:13,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 14:28:13,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 14:28:13,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 14:28:13,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 14:28:13,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 14:28:13,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:28:13,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 14:28:13,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 14:28:13,688 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 14:28:13,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 14:28:13,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 14:28:13,688 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-02 14:28:13,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 14:28:13,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 14:28:13,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 14:28:13,922 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 14:28:13,923 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 14:28:13,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:28:13,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d353e4047/f9626e48c35940388a4f6c92fdb1c446/FLAG068cf1611 [2021-11-02 14:28:14,513 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 14:28:14,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:28:14,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d353e4047/f9626e48c35940388a4f6c92fdb1c446/FLAG068cf1611 [2021-11-02 14:28:14,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d353e4047/f9626e48c35940388a4f6c92fdb1c446 [2021-11-02 14:28:14,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 14:28:14,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 14:28:14,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 14:28:14,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 14:28:14,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 14:28:14,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:28:14" (1/1) ... [2021-11-02 14:28:14,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0046c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:14, skipping insertion in model container [2021-11-02 14:28:14,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:28:14" (1/1) ... [2021-11-02 14:28:14,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 14:28:14,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 14:28:15,638 WARN L228 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-02 14:28:15,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:28:15,693 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 14:28:15,868 WARN L228 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-02 14:28:15,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:28:16,021 INFO L208 MainTranslator]: Completed translation [2021-11-02 14:28:16,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16 WrapperNode [2021-11-02 14:28:16,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 14:28:16,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 14:28:16,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 14:28:16,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 14:28:16,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 14:28:16,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 14:28:16,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 14:28:16,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 14:28:16,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 14:28:16,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 14:28:16,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 14:28:16,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 14:28:16,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (1/1) ... [2021-11-02 14:28:16,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:28:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:28:16,318 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) [2021-11-02 14:28:16,319 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 [2021-11-02 14:28:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-02 14:28:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-02 14:28:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 14:28:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 14:28:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 14:28:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-02 14:28:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 14:28:16,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 14:28:16,644 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:28:17,391 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-02 14:28:17,392 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-02 14:28:17,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 14:28:17,403 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-02 14:28:17,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:17 BoogieIcfgContainer [2021-11-02 14:28:17,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 14:28:17,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 14:28:17,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 14:28:17,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 14:28:17,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 02:28:14" (1/3) ... [2021-11-02 14:28:17,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eea901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:28:17, skipping insertion in model container [2021-11-02 14:28:17,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:16" (2/3) ... [2021-11-02 14:28:17,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eea901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:28:17, skipping insertion in model container [2021-11-02 14:28:17,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:17" (3/3) ... [2021-11-02 14:28:17,413 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:28:17,419 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 14:28:17,420 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-02 14:28:17,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 14:28:17,470 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 14:28:17,471 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-02 14:28:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 14:28:17,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:17,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:17,499 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-02 14:28:17,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:17,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230908728] [2021-11-02 14:28:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:17,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:17,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:17,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230908728] [2021-11-02 14:28:17,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230908728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:17,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:17,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:28:17,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130303061] [2021-11-02 14:28:17,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:17,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:17,882 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:21,547 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2021-11-02 14:28:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-02 14:28:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:21,561 INFO L225 Difference]: With dead ends: 1189 [2021-11-02 14:28:21,561 INFO L226 Difference]: Without dead ends: 765 [2021-11-02 14:28:21,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.09ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:21,570 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 503 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3252.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.58ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3564.46ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:21,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 18 Invalid, 1028 Unknown, 0 Unchecked, 7.58ms Time], IncrementalHoareTripleChecker [7 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 3564.46ms Time] [2021-11-02 14:28:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-02 14:28:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2021-11-02 14:28:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 736 states have (on average 1.327445652173913) internal successors, (977), 746 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2021-11-02 14:28:21,653 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2021-11-02 14:28:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:21,654 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2021-11-02 14:28:21,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2021-11-02 14:28:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:28:21,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:21,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:21,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 14:28:21,656 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-02 14:28:21,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:21,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081112618] [2021-11-02 14:28:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:21,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:21,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:21,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081112618] [2021-11-02 14:28:21,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081112618] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:21,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:21,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:28:21,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359334701] [2021-11-02 14:28:21,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:21,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:21,774 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:25,712 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2021-11-02 14:28:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:25,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-02 14:28:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:25,719 INFO L225 Difference]: With dead ends: 2217 [2021-11-02 14:28:25,720 INFO L226 Difference]: Without dead ends: 1475 [2021-11-02 14:28:25,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.34ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:25,727 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 487 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3567.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.76ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3848.08ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:25,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 0 Invalid, 1005 Unknown, 0 Unchecked, 3.76ms Time], IncrementalHoareTripleChecker [3 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 3848.08ms Time] [2021-11-02 14:28:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-02 14:28:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2021-11-02 14:28:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1435 states have (on average 1.3261324041811846) internal successors, (1903), 1445 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2021-11-02 14:28:25,816 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2021-11-02 14:28:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:25,816 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2021-11-02 14:28:25,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2021-11-02 14:28:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 14:28:25,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:25,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:25,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 14:28:25,821 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-02 14:28:25,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:25,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163128702] [2021-11-02 14:28:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:25,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:25,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:25,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163128702] [2021-11-02 14:28:25,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163128702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:25,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:25,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:28:25,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867115946] [2021-11-02 14:28:25,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:25,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:25,936 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:28,353 INFO L93 Difference]: Finished difference Result 3924 states and 5208 transitions. [2021-11-02 14:28:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-02 14:28:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:28,362 INFO L225 Difference]: With dead ends: 3924 [2021-11-02 14:28:28,362 INFO L226 Difference]: Without dead ends: 2485 [2021-11-02 14:28:28,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.30ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:28,372 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 453 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2104.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.15ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2321.19ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:28,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 3.15ms Time], IncrementalHoareTripleChecker [5 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 2321.19ms Time] [2021-11-02 14:28:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2021-11-02 14:28:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2453. [2021-11-02 14:28:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2442 states have (on average 1.341932841932842) internal successors, (3277), 2452 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3277 transitions. [2021-11-02 14:28:28,439 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3277 transitions. Word has length 38 [2021-11-02 14:28:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:28,439 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 3277 transitions. [2021-11-02 14:28:28,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3277 transitions. [2021-11-02 14:28:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 14:28:28,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:28,445 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:28:28,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 14:28:28,446 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389857, now seen corresponding path program 1 times [2021-11-02 14:28:28,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:28,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329010126] [2021-11-02 14:28:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:28,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:28,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:28,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329010126] [2021-11-02 14:28:28,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329010126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:28,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:28,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:28:28,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982767918] [2021-11-02 14:28:28,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:28:28,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:28:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:28:28,555 INFO L87 Difference]: Start difference. First operand 2453 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:30,641 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:32,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:35,769 INFO L93 Difference]: Finished difference Result 7327 states and 9781 transitions. [2021-11-02 14:28:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:28:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 14:28:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:35,785 INFO L225 Difference]: With dead ends: 7327 [2021-11-02 14:28:35,785 INFO L226 Difference]: Without dead ends: 4882 [2021-11-02 14:28:35,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.91ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:35,791 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 979 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6684.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.25ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7076.13ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:35,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 0 Invalid, 1875 Unknown, 0 Unchecked, 8.25ms Time], IncrementalHoareTripleChecker [1 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 7076.13ms Time] [2021-11-02 14:28:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2021-11-02 14:28:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 2469. [2021-11-02 14:28:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2458 states have (on average 1.339707078925956) internal successors, (3293), 2468 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3293 transitions. [2021-11-02 14:28:35,870 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3293 transitions. Word has length 41 [2021-11-02 14:28:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:35,870 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 3293 transitions. [2021-11-02 14:28:35,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3293 transitions. [2021-11-02 14:28:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:28:35,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:35,872 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:28:35,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 14:28:35,872 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1996940455, now seen corresponding path program 1 times [2021-11-02 14:28:35,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:35,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923255888] [2021-11-02 14:28:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:35,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:35,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:35,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923255888] [2021-11-02 14:28:35,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923255888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:35,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:35,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:28:35,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645656516] [2021-11-02 14:28:35,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:28:35,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:28:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:28:35,976 INFO L87 Difference]: Start difference. First operand 2469 states and 3293 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:37,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:40,015 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:44,592 INFO L93 Difference]: Finished difference Result 6707 states and 8941 transitions. [2021-11-02 14:28:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:28:44,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 14:28:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:44,605 INFO L225 Difference]: With dead ends: 6707 [2021-11-02 14:28:44,606 INFO L226 Difference]: Without dead ends: 4246 [2021-11-02 14:28:44,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.69ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:44,612 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 742 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8066.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.55ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8482.80ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:44,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 0 Invalid, 1887 Unknown, 0 Unchecked, 6.55ms Time], IncrementalHoareTripleChecker [0 Valid, 1886 Invalid, 1 Unknown, 0 Unchecked, 8482.80ms Time] [2021-11-02 14:28:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2021-11-02 14:28:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 2485. [2021-11-02 14:28:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2474 states have (on average 1.3375101050929668) internal successors, (3309), 2484 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3309 transitions. [2021-11-02 14:28:44,687 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3309 transitions. Word has length 42 [2021-11-02 14:28:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:44,687 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 3309 transitions. [2021-11-02 14:28:44,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3309 transitions. [2021-11-02 14:28:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:28:44,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:44,689 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:28:44,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 14:28:44,689 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:28:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -942849768, now seen corresponding path program 1 times [2021-11-02 14:28:44,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:44,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153042883] [2021-11-02 14:28:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:44,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:44,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:44,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153042883] [2021-11-02 14:28:44,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153042883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:44,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:44,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:28:44,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098943875] [2021-11-02 14:28:44,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:28:44,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:28:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:44,777 INFO L87 Difference]: Start difference. First operand 2485 states and 3309 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:28:47,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:49,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:52,948 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:28:54,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:01,700 INFO L93 Difference]: Finished difference Result 13586 states and 18045 transitions. [2021-11-02 14:29:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 14:29:01,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 14:29:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:01,733 INFO L225 Difference]: With dead ends: 13586 [2021-11-02 14:29:01,733 INFO L226 Difference]: Without dead ends: 12316 [2021-11-02 14:29:01,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 34.39ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:29:01,739 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3034 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15690.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.36ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16541.17ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:01,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3034 Valid, 0 Invalid, 4357 Unknown, 0 Unchecked, 12.36ms Time], IncrementalHoareTripleChecker [25 Valid, 4331 Invalid, 1 Unknown, 0 Unchecked, 16541.17ms Time] [2021-11-02 14:29:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2021-11-02 14:29:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 2545. [2021-11-02 14:29:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2534 states have (on average 1.329518547750592) internal successors, (3369), 2544 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3369 transitions. [2021-11-02 14:29:01,866 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3369 transitions. Word has length 42 [2021-11-02 14:29:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:01,867 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 3369 transitions. [2021-11-02 14:29:01,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3369 transitions. [2021-11-02 14:29:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:29:01,868 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:01,868 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:29:01,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 14:29:01,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:29:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1763769626, now seen corresponding path program 1 times [2021-11-02 14:29:01,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:01,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041168822] [2021-11-02 14:29:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:01,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:29:01,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:01,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041168822] [2021-11-02 14:29:01,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041168822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:01,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:01,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:29:01,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438541276] [2021-11-02 14:29:01,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:29:01,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:29:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:29:01,965 INFO L87 Difference]: Start difference. First operand 2545 states and 3369 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:04,585 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:12,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:14,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:24,157 INFO L93 Difference]: Finished difference Result 18627 states and 25013 transitions. [2021-11-02 14:29:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 14:29:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 14:29:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:24,190 INFO L225 Difference]: With dead ends: 18627 [2021-11-02 14:29:24,190 INFO L226 Difference]: Without dead ends: 16090 [2021-11-02 14:29:24,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 89.13ms TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-02 14:29:24,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3892 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 10168 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19819.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3892 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.07ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 10168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21329.10ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:24,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3892 Valid, 0 Invalid, 10190 Unknown, 0 Unchecked, 26.07ms Time], IncrementalHoareTripleChecker [21 Valid, 10168 Invalid, 1 Unknown, 0 Unchecked, 21329.10ms Time] [2021-11-02 14:29:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16090 states. [2021-11-02 14:29:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16090 to 2523. [2021-11-02 14:29:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2512 states have (on average 1.3244426751592357) internal successors, (3327), 2522 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3327 transitions. [2021-11-02 14:29:24,379 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3327 transitions. Word has length 42 [2021-11-02 14:29:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:24,380 INFO L470 AbstractCegarLoop]: Abstraction has 2523 states and 3327 transitions. [2021-11-02 14:29:24,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3327 transitions. [2021-11-02 14:29:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 14:29:24,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:24,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:29:24,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 14:29:24,382 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:29:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1882537444, now seen corresponding path program 1 times [2021-11-02 14:29:24,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:24,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748886920] [2021-11-02 14:29:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:24,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:29:24,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:24,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748886920] [2021-11-02 14:29:24,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748886920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:24,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:24,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:29:24,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948389345] [2021-11-02 14:29:24,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:29:24,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:29:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:29:24,485 INFO L87 Difference]: Start difference. First operand 2523 states and 3327 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:26,967 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:28,996 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:31,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:38,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:40,786 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:41,339 INFO L93 Difference]: Finished difference Result 8648 states and 11424 transitions. [2021-11-02 14:29:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:29:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-02 14:29:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:41,350 INFO L225 Difference]: With dead ends: 8648 [2021-11-02 14:29:41,350 INFO L226 Difference]: Without dead ends: 6133 [2021-11-02 14:29:41,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:41,355 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1250 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15843.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16463.30ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:41,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 0 Invalid, 2725 Unknown, 0 Unchecked, 5.03ms Time], IncrementalHoareTripleChecker [2 Valid, 2721 Invalid, 2 Unknown, 0 Unchecked, 16463.30ms Time] [2021-11-02 14:29:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-11-02 14:29:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2261. [2021-11-02 14:29:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2250 states have (on average 1.3177777777777777) internal successors, (2965), 2260 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2965 transitions. [2021-11-02 14:29:41,488 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2965 transitions. Word has length 44 [2021-11-02 14:29:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:41,490 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 2965 transitions. [2021-11-02 14:29:41,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2965 transitions. [2021-11-02 14:29:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 14:29:41,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:41,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:29:41,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 14:29:41,492 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:29:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -297582244, now seen corresponding path program 1 times [2021-11-02 14:29:41,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:41,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678362196] [2021-11-02 14:29:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:41,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:29:41,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:41,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678362196] [2021-11-02 14:29:41,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678362196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:41,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:41,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:29:41,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319514513] [2021-11-02 14:29:41,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:29:41,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:29:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:29:41,572 INFO L87 Difference]: Start difference. First operand 2261 states and 2965 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:44,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:47,940 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:50,611 INFO L93 Difference]: Finished difference Result 3590 states and 4695 transitions. [2021-11-02 14:29:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:29:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-02 14:29:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:50,616 INFO L225 Difference]: With dead ends: 3590 [2021-11-02 14:29:50,616 INFO L226 Difference]: Without dead ends: 3575 [2021-11-02 14:29:50,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.94ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:29:50,617 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 820 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8430.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.72ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8818.63ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:50,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 0 Invalid, 1897 Unknown, 0 Unchecked, 2.72ms Time], IncrementalHoareTripleChecker [18 Valid, 1878 Invalid, 1 Unknown, 0 Unchecked, 8818.63ms Time] [2021-11-02 14:29:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2021-11-02 14:29:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3517. [2021-11-02 14:29:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3506 states have (on average 1.3168853394181403) internal successors, (4617), 3516 states have internal predecessors, (4617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 4617 transitions. [2021-11-02 14:29:50,789 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 4617 transitions. Word has length 44 [2021-11-02 14:29:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:50,790 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 4617 transitions. [2021-11-02 14:29:50,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 4617 transitions. [2021-11-02 14:29:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 14:29:50,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:50,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:29:50,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 14:29:50,792 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:29:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1289306960, now seen corresponding path program 1 times [2021-11-02 14:29:50,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:50,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409075898] [2021-11-02 14:29:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:50,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:29:50,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:50,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409075898] [2021-11-02 14:29:50,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409075898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:50,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:50,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:29:50,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910819385] [2021-11-02 14:29:50,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:29:50,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:29:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:29:50,859 INFO L87 Difference]: Start difference. First operand 3517 states and 4617 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:53,363 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:29:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:55,351 INFO L93 Difference]: Finished difference Result 7104 states and 9381 transitions. [2021-11-02 14:29:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:29:55,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-02 14:29:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:55,357 INFO L225 Difference]: With dead ends: 7104 [2021-11-02 14:29:55,357 INFO L226 Difference]: Without dead ends: 3595 [2021-11-02 14:29:55,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.39ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:29:55,362 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4036.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.44ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4259.34ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:55,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 1.44ms Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 4259.34ms Time] [2021-11-02 14:29:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2021-11-02 14:29:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3595. [2021-11-02 14:29:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3584 states have (on average 1.3099888392857142) internal successors, (4695), 3594 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4695 transitions. [2021-11-02 14:29:55,570 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4695 transitions. Word has length 47 [2021-11-02 14:29:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:55,570 INFO L470 AbstractCegarLoop]: Abstraction has 3595 states and 4695 transitions. [2021-11-02 14:29:55,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4695 transitions. [2021-11-02 14:29:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-02 14:29:55,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:55,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:29:55,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 14:29:55,572 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:29:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1848487698, now seen corresponding path program 1 times [2021-11-02 14:29:55,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:55,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914347570] [2021-11-02 14:29:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:55,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:29:55,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:55,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914347570] [2021-11-02 14:29:55,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914347570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:55,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:55,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:29:55,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359546967] [2021-11-02 14:29:55,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:29:55,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:29:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:29:55,677 INFO L87 Difference]: Start difference. First operand 3595 states and 4695 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:29:59,103 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:00,580 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:02,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:09,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:10,741 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:13,627 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:16,027 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:20,465 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:21,546 INFO L93 Difference]: Finished difference Result 11814 states and 15487 transitions. [2021-11-02 14:30:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 14:30:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-02 14:30:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:21,558 INFO L225 Difference]: With dead ends: 11814 [2021-11-02 14:30:21,558 INFO L226 Difference]: Without dead ends: 9198 [2021-11-02 14:30:21,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 106.84ms TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-11-02 14:30:21,563 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2894 mSDsluCounter, 3293 mSDsCounter, 0 mSdLazyCounter, 5024 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23996.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.75ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5024 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25098.46ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:21,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 0 Invalid, 5055 Unknown, 0 Unchecked, 15.75ms Time], IncrementalHoareTripleChecker [29 Valid, 5024 Invalid, 2 Unknown, 0 Unchecked, 25098.46ms Time] [2021-11-02 14:30:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9198 states. [2021-11-02 14:30:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9198 to 3611. [2021-11-02 14:30:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3600 states have (on average 1.3086111111111112) internal successors, (4711), 3610 states have internal predecessors, (4711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 4711 transitions. [2021-11-02 14:30:21,812 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 4711 transitions. Word has length 48 [2021-11-02 14:30:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:21,813 INFO L470 AbstractCegarLoop]: Abstraction has 3611 states and 4711 transitions. [2021-11-02 14:30:21,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 4711 transitions. [2021-11-02 14:30:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 14:30:21,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:21,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:21,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 14:30:21,815 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:30:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash -6937233, now seen corresponding path program 1 times [2021-11-02 14:30:21,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:21,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747227620] [2021-11-02 14:30:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:21,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:30:21,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:21,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747227620] [2021-11-02 14:30:21,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747227620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:21,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:21,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:30:21,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193336943] [2021-11-02 14:30:21,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:30:21,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:30:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:30:21,882 INFO L87 Difference]: Start difference. First operand 3611 states and 4711 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:25,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:30,682 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:34,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:36,681 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:38,513 INFO L93 Difference]: Finished difference Result 11601 states and 15156 transitions. [2021-11-02 14:30:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:30:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-02 14:30:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:38,524 INFO L225 Difference]: With dead ends: 11601 [2021-11-02 14:30:38,525 INFO L226 Difference]: Without dead ends: 7998 [2021-11-02 14:30:38,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:38,530 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 867 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15410.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.23ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16031.13ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:38,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 0 Invalid, 2857 Unknown, 0 Unchecked, 5.23ms Time], IncrementalHoareTripleChecker [4 Valid, 2852 Invalid, 1 Unknown, 0 Unchecked, 16031.13ms Time] [2021-11-02 14:30:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2021-11-02 14:30:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 3064. [2021-11-02 14:30:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 3053 states have (on average 1.30527350147396) internal successors, (3985), 3063 states have internal predecessors, (3985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3985 transitions. [2021-11-02 14:30:38,784 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3985 transitions. Word has length 52 [2021-11-02 14:30:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:38,784 INFO L470 AbstractCegarLoop]: Abstraction has 3064 states and 3985 transitions. [2021-11-02 14:30:38,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3985 transitions. [2021-11-02 14:30:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 14:30:38,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:38,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:38,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 14:30:38,786 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:30:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 291347065, now seen corresponding path program 1 times [2021-11-02 14:30:38,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:38,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020498994] [2021-11-02 14:30:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:38,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:30:38,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:38,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020498994] [2021-11-02 14:30:38,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020498994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:38,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:38,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:30:38,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46172806] [2021-11-02 14:30:38,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:30:38,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:30:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:30:38,852 INFO L87 Difference]: Start difference. First operand 3064 states and 3985 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:41,163 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:46,254 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:51,291 INFO L93 Difference]: Finished difference Result 10240 states and 13292 transitions. [2021-11-02 14:30:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:30:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-02 14:30:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:51,299 INFO L225 Difference]: With dead ends: 10240 [2021-11-02 14:30:51,299 INFO L226 Difference]: Without dead ends: 7608 [2021-11-02 14:30:51,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.84ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:51,303 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1354 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11210.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.18ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11795.09ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:51,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1354 Valid, 0 Invalid, 2721 Unknown, 0 Unchecked, 5.18ms Time], IncrementalHoareTripleChecker [2 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 11795.09ms Time] [2021-11-02 14:30:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2021-11-02 14:30:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 2856. [2021-11-02 14:30:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2845 states have (on average 1.3001757469244288) internal successors, (3699), 2855 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3699 transitions. [2021-11-02 14:30:51,530 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3699 transitions. Word has length 52 [2021-11-02 14:30:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:51,530 INFO L470 AbstractCegarLoop]: Abstraction has 2856 states and 3699 transitions. [2021-11-02 14:30:51,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3699 transitions. [2021-11-02 14:30:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 14:30:51,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:51,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:51,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 14:30:51,532 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:30:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -729721289, now seen corresponding path program 1 times [2021-11-02 14:30:51,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:51,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486130897] [2021-11-02 14:30:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:51,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:30:51,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:51,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486130897] [2021-11-02 14:30:51,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486130897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:51,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:51,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:51,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836584784] [2021-11-02 14:30:51,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:51,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:51,595 INFO L87 Difference]: Start difference. First operand 2856 states and 3699 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:53,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:54,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:30:56,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:00,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:03,813 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:06,267 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:10,418 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:11,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:18,433 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:31:19,974 INFO L93 Difference]: Finished difference Result 17011 states and 22235 transitions. [2021-11-02 14:31:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 14:31:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-02 14:31:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:31:19,995 INFO L225 Difference]: With dead ends: 17011 [2021-11-02 14:31:19,995 INFO L226 Difference]: Without dead ends: 15662 [2021-11-02 14:31:20,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.17ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:31:20,000 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1931 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25715.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.17ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26878.70ms IncrementalHoareTripleChecker+Time [2021-11-02 14:31:20,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1931 Valid, 0 Invalid, 5207 Unknown, 0 Unchecked, 13.17ms Time], IncrementalHoareTripleChecker [16 Valid, 5191 Invalid, 0 Unknown, 0 Unchecked, 26878.70ms Time] [2021-11-02 14:31:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2021-11-02 14:31:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 2904. [2021-11-02 14:31:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2893 states have (on average 1.2951952989975803) internal successors, (3747), 2903 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3747 transitions. [2021-11-02 14:31:20,323 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3747 transitions. Word has length 52 [2021-11-02 14:31:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:31:20,323 INFO L470 AbstractCegarLoop]: Abstraction has 2904 states and 3747 transitions. [2021-11-02 14:31:20,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3747 transitions. [2021-11-02 14:31:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 14:31:20,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:31:20,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:31:20,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 14:31:20,325 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:31:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:31:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1876302265, now seen corresponding path program 1 times [2021-11-02 14:31:20,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:31:20,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669255357] [2021-11-02 14:31:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:31:20,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:31:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:31:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:31:20,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:31:20,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669255357] [2021-11-02 14:31:20,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669255357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:31:20,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:31:20,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:31:20,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830044866] [2021-11-02 14:31:20,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:31:20,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:31:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:31:20,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:31:20,382 INFO L87 Difference]: Start difference. First operand 2904 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:22,226 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:31:26,354 INFO L93 Difference]: Finished difference Result 5450 states and 7040 transitions. [2021-11-02 14:31:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:31:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-02 14:31:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:31:26,358 INFO L225 Difference]: With dead ends: 5450 [2021-11-02 14:31:26,358 INFO L226 Difference]: Without dead ends: 4077 [2021-11-02 14:31:26,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:31:26,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5251.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.68ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5577.29ms IncrementalHoareTripleChecker+Time [2021-11-02 14:31:26,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 1381 Unknown, 0 Unchecked, 1.68ms Time], IncrementalHoareTripleChecker [1 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 5577.29ms Time] [2021-11-02 14:31:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2021-11-02 14:31:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 2912. [2021-11-02 14:31:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2901 states have (on average 1.2943812478455705) internal successors, (3755), 2911 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3755 transitions. [2021-11-02 14:31:26,624 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3755 transitions. Word has length 52 [2021-11-02 14:31:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:31:26,624 INFO L470 AbstractCegarLoop]: Abstraction has 2912 states and 3755 transitions. [2021-11-02 14:31:26,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3755 transitions. [2021-11-02 14:31:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 14:31:26,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:31:26,626 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:31:26,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 14:31:26,626 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:31:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:31:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash -873150611, now seen corresponding path program 1 times [2021-11-02 14:31:26,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:31:26,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687362583] [2021-11-02 14:31:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:31:26,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:31:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:31:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:31:26,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:31:26,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687362583] [2021-11-02 14:31:26,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687362583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:31:26,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:31:26,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 14:31:26,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747227532] [2021-11-02 14:31:26,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 14:31:26,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:31:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 14:31:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:31:26,759 INFO L87 Difference]: Start difference. First operand 2912 states and 3755 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:31:28,737 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:30,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:37,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:41,231 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:43,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:48,221 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:51,976 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:54,909 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:04,795 INFO L93 Difference]: Finished difference Result 15352 states and 19899 transitions. [2021-11-02 14:32:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-02 14:32:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-02 14:32:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:04,814 INFO L225 Difference]: With dead ends: 15352 [2021-11-02 14:32:04,814 INFO L226 Difference]: Without dead ends: 12872 [2021-11-02 14:32:04,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 425.25ms TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-02 14:32:04,821 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4697 mSDsluCounter, 6594 mSDsCounter, 0 mSdLazyCounter, 8624 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34394.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4697 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.97ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 8624 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36057.05ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:04,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4697 Valid, 0 Invalid, 8662 Unknown, 0 Unchecked, 24.97ms Time], IncrementalHoareTripleChecker [35 Valid, 8624 Invalid, 3 Unknown, 0 Unchecked, 36057.05ms Time] [2021-11-02 14:32:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2021-11-02 14:32:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 2910. [2021-11-02 14:32:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2899 states have (on average 1.2904449810279406) internal successors, (3741), 2909 states have internal predecessors, (3741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3741 transitions. [2021-11-02 14:32:05,190 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3741 transitions. Word has length 53 [2021-11-02 14:32:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:05,191 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3741 transitions. [2021-11-02 14:32:05,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3741 transitions. [2021-11-02 14:32:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 14:32:05,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:05,192 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:32:05,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 14:32:05,193 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:32:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash 24644017, now seen corresponding path program 1 times [2021-11-02 14:32:05,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:32:05,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181003574] [2021-11-02 14:32:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:05,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:32:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:32:05,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:32:05,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181003574] [2021-11-02 14:32:05,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181003574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:05,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:05,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:32:05,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688174675] [2021-11-02 14:32:05,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:32:05,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:32:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:32:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:05,239 INFO L87 Difference]: Start difference. First operand 2910 states and 3741 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:07,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:10,892 INFO L93 Difference]: Finished difference Result 5831 states and 7495 transitions. [2021-11-02 14:32:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:32:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-02 14:32:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:10,895 INFO L225 Difference]: With dead ends: 5831 [2021-11-02 14:32:10,895 INFO L226 Difference]: Without dead ends: 2927 [2021-11-02 14:32:10,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.63ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:32:10,898 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4987.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.14ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5274.92ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:10,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 1513 Unknown, 0 Unchecked, 2.14ms Time], IncrementalHoareTripleChecker [0 Valid, 1512 Invalid, 1 Unknown, 0 Unchecked, 5274.92ms Time] [2021-11-02 14:32:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2021-11-02 14:32:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2914. [2021-11-02 14:32:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2903 states have (on average 1.289700310024113) internal successors, (3744), 2913 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3744 transitions. [2021-11-02 14:32:11,203 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3744 transitions. Word has length 53 [2021-11-02 14:32:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:11,203 INFO L470 AbstractCegarLoop]: Abstraction has 2914 states and 3744 transitions. [2021-11-02 14:32:11,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3744 transitions. [2021-11-02 14:32:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 14:32:11,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:11,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:32:11,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 14:32:11,205 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:32:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 446058872, now seen corresponding path program 1 times [2021-11-02 14:32:11,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:32:11,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214091214] [2021-11-02 14:32:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:11,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:32:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:32:11,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:32:11,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214091214] [2021-11-02 14:32:11,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214091214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:11,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:11,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:32:11,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577667498] [2021-11-02 14:32:11,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:32:11,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:32:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:32:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:11,287 INFO L87 Difference]: Start difference. First operand 2914 states and 3744 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:13,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:14,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:17,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:20,494 INFO L93 Difference]: Finished difference Result 4304 states and 5517 transitions. [2021-11-02 14:32:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:32:20,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-02 14:32:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:20,500 INFO L225 Difference]: With dead ends: 4304 [2021-11-02 14:32:20,500 INFO L226 Difference]: Without dead ends: 4298 [2021-11-02 14:32:20,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.99ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:20,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 846 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8241.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.87ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8674.46ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:20,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [846 Valid, 0 Invalid, 1912 Unknown, 0 Unchecked, 3.87ms Time], IncrementalHoareTripleChecker [8 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 8674.46ms Time] [2021-11-02 14:32:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2021-11-02 14:32:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4252. [2021-11-02 14:32:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 4241 states have (on average 1.2897901438340014) internal successors, (5470), 4251 states have internal predecessors, (5470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 5470 transitions. [2021-11-02 14:32:20,932 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 5470 transitions. Word has length 54 [2021-11-02 14:32:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:20,933 INFO L470 AbstractCegarLoop]: Abstraction has 4252 states and 5470 transitions. [2021-11-02 14:32:20,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 5470 transitions. [2021-11-02 14:32:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-02 14:32:20,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:20,934 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:32:20,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 14:32:20,934 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:32:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1584391570, now seen corresponding path program 1 times [2021-11-02 14:32:20,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:32:20,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518451248] [2021-11-02 14:32:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:20,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:32:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-02 14:32:21,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:32:21,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518451248] [2021-11-02 14:32:21,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518451248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:21,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:21,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:32:21,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044910077] [2021-11-02 14:32:21,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:32:21,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:32:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:32:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:21,147 INFO L87 Difference]: Start difference. First operand 4252 states and 5470 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:23,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:26,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:30,398 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:31,031 INFO L93 Difference]: Finished difference Result 8498 states and 10933 transitions. [2021-11-02 14:32:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:32:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-02 14:32:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:31,037 INFO L225 Difference]: With dead ends: 8498 [2021-11-02 14:32:31,037 INFO L226 Difference]: Without dead ends: 4252 [2021-11-02 14:32:31,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.03ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:32:31,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9040.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.10ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9385.95ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:31,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 2.10ms Time], IncrementalHoareTripleChecker [0 Valid, 1507 Invalid, 1 Unknown, 0 Unchecked, 9385.95ms Time] [2021-11-02 14:32:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2021-11-02 14:32:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 4252. [2021-11-02 14:32:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 4241 states have (on average 1.2895543503890592) internal successors, (5469), 4251 states have internal predecessors, (5469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 5469 transitions. [2021-11-02 14:32:31,583 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 5469 transitions. Word has length 55 [2021-11-02 14:32:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 4252 states and 5469 transitions. [2021-11-02 14:32:31,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 5469 transitions. [2021-11-02 14:32:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-02 14:32:31,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:31,596 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:32:31,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 14:32:31,597 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:32:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1103311312, now seen corresponding path program 1 times [2021-11-02 14:32:31,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:32:31,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716389467] [2021-11-02 14:32:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:31,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:32:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-02 14:32:31,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:32:31,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716389467] [2021-11-02 14:32:31,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716389467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:31,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:31,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:32:31,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603183006] [2021-11-02 14:32:31,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:32:31,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:32:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:32:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:31,794 INFO L87 Difference]: Start difference. First operand 4252 states and 5469 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:34,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:41,292 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:42,337 INFO L93 Difference]: Finished difference Result 10905 states and 14089 transitions. [2021-11-02 14:32:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:32:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-02 14:32:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:42,350 INFO L225 Difference]: With dead ends: 10905 [2021-11-02 14:32:42,351 INFO L226 Difference]: Without dead ends: 8957 [2021-11-02 14:32:42,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.10ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:32:42,356 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 687 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9033.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.05ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9485.48ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:42,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 0 Invalid, 2053 Unknown, 0 Unchecked, 4.05ms Time], IncrementalHoareTripleChecker [15 Valid, 2037 Invalid, 1 Unknown, 0 Unchecked, 9485.48ms Time] [2021-11-02 14:32:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2021-11-02 14:32:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8766. [2021-11-02 14:32:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8766 states, 8755 states have (on average 1.2961736150770988) internal successors, (11348), 8765 states have internal predecessors, (11348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 11348 transitions. [2021-11-02 14:32:43,320 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 11348 transitions. Word has length 55 [2021-11-02 14:32:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:43,321 INFO L470 AbstractCegarLoop]: Abstraction has 8766 states and 11348 transitions. [2021-11-02 14:32:43,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 11348 transitions. [2021-11-02 14:32:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 14:32:43,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:43,322 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:32:43,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 14:32:43,322 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:32:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1514792705, now seen corresponding path program 1 times [2021-11-02 14:32:43,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:32:43,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739463437] [2021-11-02 14:32:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:43,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:32:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:32:43,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:32:43,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739463437] [2021-11-02 14:32:43,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739463437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:43,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:43,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 14:32:43,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706941937] [2021-11-02 14:32:43,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:32:43,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:32:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:32:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:32:43,394 INFO L87 Difference]: Start difference. First operand 8766 states and 11348 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:32:45,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:46,975 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:49,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:53,411 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:54,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:58,999 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:05,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:10,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:12,308 INFO L93 Difference]: Finished difference Result 23303 states and 30380 transitions. [2021-11-02 14:33:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 14:33:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-02 14:33:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:12,337 INFO L225 Difference]: With dead ends: 23303 [2021-11-02 14:33:12,338 INFO L226 Difference]: Without dead ends: 19822 [2021-11-02 14:33:12,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 108.43ms TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2021-11-02 14:33:12,346 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2610 mSDsluCounter, 3545 mSDsCounter, 0 mSdLazyCounter, 5372 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25126.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.15ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5372 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26273.66ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:12,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2610 Valid, 0 Invalid, 5396 Unknown, 0 Unchecked, 18.15ms Time], IncrementalHoareTripleChecker [23 Valid, 5372 Invalid, 1 Unknown, 0 Unchecked, 26273.66ms Time] [2021-11-02 14:33:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2021-11-02 14:33:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 8766. [2021-11-02 14:33:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8766 states, 8755 states have (on average 1.2946887492861223) internal successors, (11335), 8765 states have internal predecessors, (11335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 11335 transitions. [2021-11-02 14:33:13,433 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 11335 transitions. Word has length 56 [2021-11-02 14:33:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:13,433 INFO L470 AbstractCegarLoop]: Abstraction has 8766 states and 11335 transitions. [2021-11-02 14:33:13,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 11335 transitions. [2021-11-02 14:33:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-02 14:33:13,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:13,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:13,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 14:33:13,435 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:33:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 850396480, now seen corresponding path program 1 times [2021-11-02 14:33:13,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:33:13,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197526868] [2021-11-02 14:33:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:13,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:33:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:33:13,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:33:13,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197526868] [2021-11-02 14:33:13,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197526868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:13,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:33:13,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:33:13,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117673834] [2021-11-02 14:33:13,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:33:13,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:33:13,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:33:13,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:33:13,495 INFO L87 Difference]: Start difference. First operand 8766 states and 11335 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:15,897 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:22,774 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:25,350 INFO L93 Difference]: Finished difference Result 23823 states and 30988 transitions. [2021-11-02 14:33:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:33:25,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-02 14:33:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:25,376 INFO L225 Difference]: With dead ends: 23823 [2021-11-02 14:33:25,376 INFO L226 Difference]: Without dead ends: 15322 [2021-11-02 14:33:25,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.70ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:33:25,388 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9328.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.90ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9878.30ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:25,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 2748 Unknown, 0 Unchecked, 4.90ms Time], IncrementalHoareTripleChecker [9 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 9878.30ms Time] [2021-11-02 14:33:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15322 states. [2021-11-02 14:33:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15322 to 8775. [2021-11-02 14:33:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 8764 states have (on average 1.2941579187585577) internal successors, (11342), 8774 states have internal predecessors, (11342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 11342 transitions. [2021-11-02 14:33:26,506 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 11342 transitions. Word has length 58 [2021-11-02 14:33:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:26,506 INFO L470 AbstractCegarLoop]: Abstraction has 8775 states and 11342 transitions. [2021-11-02 14:33:26,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 11342 transitions. [2021-11-02 14:33:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-02 14:33:26,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:26,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:26,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 14:33:26,508 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:33:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1274043202, now seen corresponding path program 1 times [2021-11-02 14:33:26,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:33:26,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887069173] [2021-11-02 14:33:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:26,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:33:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:33:26,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:33:26,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887069173] [2021-11-02 14:33:26,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887069173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:26,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:33:26,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:33:26,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843419042] [2021-11-02 14:33:26,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:33:26,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:33:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:33:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:33:26,572 INFO L87 Difference]: Start difference. First operand 8775 states and 11342 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:29,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:32,745 INFO L93 Difference]: Finished difference Result 17318 states and 22389 transitions. [2021-11-02 14:33:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:33:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-02 14:33:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:32,760 INFO L225 Difference]: With dead ends: 17318 [2021-11-02 14:33:32,761 INFO L226 Difference]: Without dead ends: 8814 [2021-11-02 14:33:32,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.32ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:33:32,770 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4834.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5062.22ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:32,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 1.42ms Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 1 Unknown, 0 Unchecked, 5062.22ms Time] [2021-11-02 14:33:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2021-11-02 14:33:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8801. [2021-11-02 14:33:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8801 states, 8790 states have (on average 1.293287827076223) internal successors, (11368), 8800 states have internal predecessors, (11368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 11368 transitions. [2021-11-02 14:33:33,835 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 11368 transitions. Word has length 58 [2021-11-02 14:33:33,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:33,835 INFO L470 AbstractCegarLoop]: Abstraction has 8801 states and 11368 transitions. [2021-11-02 14:33:33,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 11368 transitions. [2021-11-02 14:33:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 14:33:33,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:33,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:33,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 14:33:33,836 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:33:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -361538827, now seen corresponding path program 1 times [2021-11-02 14:33:33,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:33:33,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490220722] [2021-11-02 14:33:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:33,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:33:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:33:33,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:33:33,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490220722] [2021-11-02 14:33:33,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490220722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:33,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:33:33,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:33:33,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717755115] [2021-11-02 14:33:33,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:33:33,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:33:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:33:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:33:33,899 INFO L87 Difference]: Start difference. First operand 8801 states and 11368 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:36,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:42,468 INFO L93 Difference]: Finished difference Result 30092 states and 38916 transitions. [2021-11-02 14:33:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:33:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-02 14:33:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:42,504 INFO L225 Difference]: With dead ends: 30092 [2021-11-02 14:33:42,504 INFO L226 Difference]: Without dead ends: 21299 [2021-11-02 14:33:42,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:33:42,516 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 757 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5556.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.09ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5964.83ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:42,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 0 Invalid, 2474 Unknown, 0 Unchecked, 5.09ms Time], IncrementalHoareTripleChecker [2 Valid, 2471 Invalid, 1 Unknown, 0 Unchecked, 5964.83ms Time] [2021-11-02 14:33:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2021-11-02 14:33:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 8867. [2021-11-02 14:33:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8867 states, 8856 states have (on average 1.2911020776874436) internal successors, (11434), 8866 states have internal predecessors, (11434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 11434 transitions. [2021-11-02 14:33:43,668 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 11434 transitions. Word has length 60 [2021-11-02 14:33:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:43,669 INFO L470 AbstractCegarLoop]: Abstraction has 8867 states and 11434 transitions. [2021-11-02 14:33:43,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 11434 transitions. [2021-11-02 14:33:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 14:33:43,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:43,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:43,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 14:33:43,670 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:33:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 772416922, now seen corresponding path program 1 times [2021-11-02 14:33:43,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:33:43,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359182757] [2021-11-02 14:33:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:43,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:33:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:33:43,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:33:43,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359182757] [2021-11-02 14:33:43,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359182757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:43,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:33:43,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:33:43,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693911461] [2021-11-02 14:33:43,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:33:43,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:33:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:33:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:33:43,731 INFO L87 Difference]: Start difference. First operand 8867 states and 11434 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:58,202 INFO L93 Difference]: Finished difference Result 28795 states and 37094 transitions. [2021-11-02 14:33:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:33:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-02 14:33:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:58,235 INFO L225 Difference]: With dead ends: 28795 [2021-11-02 14:33:58,235 INFO L226 Difference]: Without dead ends: 21469 [2021-11-02 14:33:58,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:33:58,246 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 783 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10772.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.90ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11410.94ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:58,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 0 Invalid, 3043 Unknown, 0 Unchecked, 5.90ms Time], IncrementalHoareTripleChecker [4 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 11410.94ms Time] [2021-11-02 14:33:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21469 states. [2021-11-02 14:33:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21469 to 8759. [2021-11-02 14:33:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8759 states, 8748 states have (on average 1.2904663923182442) internal successors, (11289), 8758 states have internal predecessors, (11289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8759 states to 8759 states and 11289 transitions. [2021-11-02 14:33:59,446 INFO L78 Accepts]: Start accepts. Automaton has 8759 states and 11289 transitions. Word has length 60 [2021-11-02 14:33:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:59,446 INFO L470 AbstractCegarLoop]: Abstraction has 8759 states and 11289 transitions. [2021-11-02 14:33:59,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:33:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8759 states and 11289 transitions. [2021-11-02 14:33:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 14:33:59,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:59,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:59,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 14:33:59,448 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:33:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2037876465, now seen corresponding path program 1 times [2021-11-02 14:33:59,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:33:59,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036232805] [2021-11-02 14:33:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:59,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:33:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:33:59,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:33:59,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036232805] [2021-11-02 14:33:59,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036232805] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 14:33:59,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454393520] [2021-11-02 14:33:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:59,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:33:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:33:59,515 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) [2021-11-02 14:33:59,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 14:33:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:59,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 14:33:59,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:33:59,889 INFO L388 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 13 treesize of output 7 [2021-11-02 14:33:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:33:59,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 14:33:59,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454393520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:59,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 14:33:59,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-02 14:33:59,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12601731] [2021-11-02 14:33:59,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:33:59,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:33:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:33:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:33:59,985 INFO L87 Difference]: Start difference. First operand 8759 states and 11289 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:34:04,564 INFO L93 Difference]: Finished difference Result 17721 states and 22992 transitions. [2021-11-02 14:34:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:34:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-02 14:34:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:34:04,576 INFO L225 Difference]: With dead ends: 17721 [2021-11-02 14:34:04,576 INFO L226 Difference]: Without dead ends: 8970 [2021-11-02 14:34:04,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.17ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:34:04,584 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3027.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3247.47ms IncrementalHoareTripleChecker+Time [2021-11-02 14:34:04,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1009 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [12 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 3247.47ms Time] [2021-11-02 14:34:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2021-11-02 14:34:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 8970. [2021-11-02 14:34:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8970 states, 8959 states have (on average 1.2836254046210513) internal successors, (11500), 8969 states have internal predecessors, (11500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8970 states to 8970 states and 11500 transitions. [2021-11-02 14:34:05,763 INFO L78 Accepts]: Start accepts. Automaton has 8970 states and 11500 transitions. Word has length 61 [2021-11-02 14:34:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:34:05,763 INFO L470 AbstractCegarLoop]: Abstraction has 8970 states and 11500 transitions. [2021-11-02 14:34:05,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8970 states and 11500 transitions. [2021-11-02 14:34:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 14:34:05,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:34:05,764 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:34:05,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 14:34:05,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-02 14:34:05,967 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:34:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:34:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 306863343, now seen corresponding path program 1 times [2021-11-02 14:34:05,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:34:05,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961577585] [2021-11-02 14:34:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:05,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:34:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:34:06,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:34:06,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961577585] [2021-11-02 14:34:06,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961577585] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 14:34:06,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891359695] [2021-11-02 14:34:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:06,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:34:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:34:06,032 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) [2021-11-02 14:34:06,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 14:34:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:06,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:34:06,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:34:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:34:06,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:34:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:34:06,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891359695] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 14:34:06,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 14:34:06,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-02 14:34:06,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313926114] [2021-11-02 14:34:06,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:34:06,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:34:06,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:34:06,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:34:06,486 INFO L87 Difference]: Start difference. First operand 8970 states and 11500 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:08,961 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:10,120 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:34:13,395 INFO L93 Difference]: Finished difference Result 17795 states and 22823 transitions. [2021-11-02 14:34:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:34:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-02 14:34:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:34:13,408 INFO L225 Difference]: With dead ends: 17795 [2021-11-02 14:34:13,408 INFO L226 Difference]: Without dead ends: 9087 [2021-11-02 14:34:13,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 11.31ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:34:13,415 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5311.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5562.17ms IncrementalHoareTripleChecker+Time [2021-11-02 14:34:13,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 1019 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [5 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 5562.17ms Time] [2021-11-02 14:34:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9087 states. [2021-11-02 14:34:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9087 to 9087. [2021-11-02 14:34:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9087 states, 9076 states have (on average 1.2799691494050243) internal successors, (11617), 9086 states have internal predecessors, (11617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9087 states to 9087 states and 11617 transitions. [2021-11-02 14:34:14,583 INFO L78 Accepts]: Start accepts. Automaton has 9087 states and 11617 transitions. Word has length 61 [2021-11-02 14:34:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:34:14,583 INFO L470 AbstractCegarLoop]: Abstraction has 9087 states and 11617 transitions. [2021-11-02 14:34:14,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9087 states and 11617 transitions. [2021-11-02 14:34:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 14:34:14,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:34:14,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:34:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 14:34:14,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-02 14:34:14,798 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:34:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:34:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1955072921, now seen corresponding path program 1 times [2021-11-02 14:34:14,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:34:14,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565570701] [2021-11-02 14:34:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:14,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:34:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:34:14,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:34:14,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565570701] [2021-11-02 14:34:14,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565570701] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 14:34:14,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199475255] [2021-11-02 14:34:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:14,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:34:14,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:34:14,886 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) [2021-11-02 14:34:14,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 14:34:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:15,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 14:34:15,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:34:15,225 INFO L388 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 13 treesize of output 7 [2021-11-02 14:34:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:34:15,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:34:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:34:15,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199475255] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 14:34:15,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 14:34:15,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-02 14:34:15,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476727332] [2021-11-02 14:34:15,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 14:34:15,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:34:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 14:34:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:34:15,424 INFO L87 Difference]: Start difference. First operand 9087 states and 11617 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:17,566 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:18,766 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:20,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:21,902 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:25,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:34:27,643 INFO L93 Difference]: Finished difference Result 19010 states and 24914 transitions. [2021-11-02 14:34:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 14:34:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-02 14:34:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:34:27,661 INFO L225 Difference]: With dead ends: 19010 [2021-11-02 14:34:27,661 INFO L226 Difference]: Without dead ends: 9931 [2021-11-02 14:34:27,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 23.40ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:34:27,673 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10207.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.74ms SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10647.42ms IncrementalHoareTripleChecker+Time [2021-11-02 14:34:27,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 2091 Unknown, 0 Unchecked, 3.74ms Time], IncrementalHoareTripleChecker [83 Valid, 2007 Invalid, 1 Unknown, 0 Unchecked, 10647.42ms Time] [2021-11-02 14:34:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9931 states. [2021-11-02 14:34:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9931 to 9931. [2021-11-02 14:34:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9931 states, 9920 states have (on average 1.256149193548387) internal successors, (12461), 9930 states have internal predecessors, (12461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9931 states to 9931 states and 12461 transitions. [2021-11-02 14:34:29,102 INFO L78 Accepts]: Start accepts. Automaton has 9931 states and 12461 transitions. Word has length 62 [2021-11-02 14:34:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:34:29,102 INFO L470 AbstractCegarLoop]: Abstraction has 9931 states and 12461 transitions. [2021-11-02 14:34:29,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9931 states and 12461 transitions. [2021-11-02 14:34:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 14:34:29,103 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:34:29,103 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:34:29,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 14:34:29,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:34:29,323 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:34:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:34:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1699998706, now seen corresponding path program 1 times [2021-11-02 14:34:29,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:34:29,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365532229] [2021-11-02 14:34:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:29,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:34:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:34:29,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:34:29,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365532229] [2021-11-02 14:34:29,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365532229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:34:29,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:34:29,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 14:34:29,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618464060] [2021-11-02 14:34:29,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 14:34:29,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:34:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 14:34:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:34:29,440 INFO L87 Difference]: Start difference. First operand 9931 states and 12461 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:34:33,270 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:35,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:37,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:40,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:42,969 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:45,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:48,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:52,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:54,831 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:57,897 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:59,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:01,287 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:09,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:35:16,042 INFO L93 Difference]: Finished difference Result 49013 states and 61818 transitions. [2021-11-02 14:35:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-02 14:35:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-02 14:35:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:35:16,127 INFO L225 Difference]: With dead ends: 49013 [2021-11-02 14:35:16,128 INFO L226 Difference]: Without dead ends: 43072 [2021-11-02 14:35:16,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 413.21ms TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-02 14:35:16,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4176 mSDsluCounter, 6401 mSDsCounter, 0 mSdLazyCounter, 8393 mSolverCounterSat, 34 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37196.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.33ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 8393 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39001.06ms IncrementalHoareTripleChecker+Time [2021-11-02 14:35:16,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4176 Valid, 0 Invalid, 8434 Unknown, 0 Unchecked, 30.33ms Time], IncrementalHoareTripleChecker [34 Valid, 8393 Invalid, 7 Unknown, 0 Unchecked, 39001.06ms Time] [2021-11-02 14:35:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43072 states. [2021-11-02 14:35:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43072 to 9906. [2021-11-02 14:35:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9895 states have (on average 1.2536634663971702) internal successors, (12405), 9905 states have internal predecessors, (12405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 12405 transitions. [2021-11-02 14:35:17,984 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 12405 transitions. Word has length 62 [2021-11-02 14:35:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:35:17,984 INFO L470 AbstractCegarLoop]: Abstraction has 9906 states and 12405 transitions. [2021-11-02 14:35:17,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 12405 transitions. [2021-11-02 14:35:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 14:35:17,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:35:17,985 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:35:17,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 14:35:17,985 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:35:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:35:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -86443031, now seen corresponding path program 1 times [2021-11-02 14:35:17,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:35:17,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133427497] [2021-11-02 14:35:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:35:17,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:35:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 14:35:18,173 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 14:35:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 14:35:18,405 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 14:35:18,405 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 14:35:18,406 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2021-11-02 14:35:18,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2021-11-02 14:35:18,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2021-11-02 14:35:18,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2021-11-02 14:35:18,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2021-11-02 14:35:18,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2021-11-02 14:35:18,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2021-11-02 14:35:18,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2021-11-02 14:35:18,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2021-11-02 14:35:18,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2021-11-02 14:35:18,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2021-11-02 14:35:18,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 14:35:18,414 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:35:18,417 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 14:35:18,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 02:35:18 BoogieIcfgContainer [2021-11-02 14:35:18,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 14:35:18,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 14:35:18,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 14:35:18,601 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 14:35:18,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:17" (3/4) ... [2021-11-02 14:35:18,603 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 14:35:18,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 14:35:18,604 INFO L158 Benchmark]: Toolchain (without parser) took 423908.29ms. Allocated memory was 123.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 77.5MB in the beginning and 735.4MB in the end (delta: -657.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-02 14:35:18,604 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 123.7MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 14:35:18,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1324.04ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 77.3MB in the beginning and 90.5MB in the end (delta: -13.2MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2021-11-02 14:35:18,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.95ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 75.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-02 14:35:18,604 INFO L158 Benchmark]: Boogie Preprocessor took 140.23ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 75.8MB in the beginning and 182.0MB in the end (delta: -106.1MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2021-11-02 14:35:18,604 INFO L158 Benchmark]: RCFGBuilder took 1128.79ms. Allocated memory is still 241.2MB. Free memory was 182.0MB in the beginning and 160.9MB in the end (delta: 21.1MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2021-11-02 14:35:18,605 INFO L158 Benchmark]: TraceAbstraction took 421191.65ms. Allocated memory was 241.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 159.8MB in the beginning and 736.4MB in the end (delta: -576.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-02 14:35:18,605 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 1.8GB. Free memory was 736.4MB in the beginning and 735.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 14:35:18,609 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 123.7MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1324.04ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 77.3MB in the beginning and 90.5MB in the end (delta: -13.2MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.95ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 75.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.23ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 75.8MB in the beginning and 182.0MB in the end (delta: -106.1MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1128.79ms. Allocated memory is still 241.2MB. Free memory was 182.0MB in the beginning and 160.9MB in the end (delta: 21.1MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * TraceAbstraction took 421191.65ms. Allocated memory was 241.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 159.8MB in the beginning and 736.4MB in the end (delta: -576.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 1.8GB. Free memory was 736.4MB in the beginning and 735.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5143, overapproximation of bitwiseAnd at line 6104. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6777] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6109] msg->length = (u8 )5 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6135] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6137] COND TRUE i < 10 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6151] COND TRUE ! context [L6154] dev->udev [L6154] urb->transfer_dma [L6802] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6810] COND TRUE \read(*addr) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 410 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 420953.14ms, OverallIterations: 30, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 56.79ms, AutomataDifference: 399046.85ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15.73ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 34603 SdHoareTripleChecker+Valid, 364010.81ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34603 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 346138.86ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56447 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86580 IncrementalHoareTripleChecker+Invalid, 86982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 9 mSDtfsCounter, 86580 mSolverCounterSat, 227.88ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1384.68ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9931occurred in iteration=28, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 16339.73ms AutomataMinimizationTime, 29 MinimizatonAttempts, 146853 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 266.95ms SsaConstructionTime, 1502.42ms SatisfiabilityAnalysisTime, 2082.84ms InterpolantComputationTime, 1673 NumberOfCodeBlocks, 1673 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1698 ConstructedInterpolants, 0 QuantifiedInterpolants, 2491 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3514 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 43/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 14:35:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 14:35:20,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 14:35:20,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 14:35:20,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 14:35:20,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 14:35:20,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 14:35:20,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 14:35:20,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 14:35:20,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 14:35:20,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 14:35:20,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 14:35:20,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 14:35:20,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 14:35:20,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 14:35:20,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 14:35:20,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 14:35:20,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 14:35:20,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 14:35:20,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 14:35:20,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 14:35:20,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 14:35:20,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 14:35:20,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 14:35:20,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 14:35:20,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 14:35:20,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 14:35:20,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 14:35:20,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 14:35:20,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 14:35:20,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 14:35:20,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 14:35:20,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 14:35:20,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 14:35:20,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 14:35:20,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 14:35:20,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 14:35:20,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 14:35:20,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 14:35:20,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 14:35:20,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 14:35:20,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 14:35:20,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 14:35:20,516 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 14:35:20,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 14:35:20,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 14:35:20,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 14:35:20,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 14:35:20,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 14:35:20,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 14:35:20,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:35:20,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 14:35:20,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 14:35:20,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 14:35:20,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 14:35:20,520 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-02 14:35:20,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 14:35:20,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 14:35:20,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 14:35:20,848 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 14:35:20,851 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 14:35:20,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:35:20,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5db4e5d9/5749716e562e449989cea175d94459f3/FLAG1fa7e5e7c [2021-11-02 14:35:21,528 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 14:35:21,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:35:21,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5db4e5d9/5749716e562e449989cea175d94459f3/FLAG1fa7e5e7c [2021-11-02 14:35:21,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5db4e5d9/5749716e562e449989cea175d94459f3 [2021-11-02 14:35:21,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 14:35:21,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 14:35:21,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 14:35:21,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 14:35:21,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 14:35:21,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:35:21" (1/1) ... [2021-11-02 14:35:21,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da21d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:21, skipping insertion in model container [2021-11-02 14:35:21,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:35:21" (1/1) ... [2021-11-02 14:35:21,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 14:35:22,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 14:35:22,932 WARN L228 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-02 14:35:22,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:35:23,017 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 14:35:23,236 WARN L228 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-02 14:35:23,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:35:23,399 INFO L208 MainTranslator]: Completed translation [2021-11-02 14:35:23,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23 WrapperNode [2021-11-02 14:35:23,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 14:35:23,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 14:35:23,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 14:35:23,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 14:35:23,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 14:35:23,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 14:35:23,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 14:35:23,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 14:35:23,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 14:35:23,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 14:35:23,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 14:35:23,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 14:35:23,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (1/1) ... [2021-11-02 14:35:23,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:35:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:35:23,712 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) [2021-11-02 14:35:23,713 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 [2021-11-02 14:35:23,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-02 14:35:23,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 14:35:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-02 14:35:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 14:35:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 14:35:24,053 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:35:25,095 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-02 14:35:25,096 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-02 14:35:25,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 14:35:25,105 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-02 14:35:25,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:35:25 BoogieIcfgContainer [2021-11-02 14:35:25,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 14:35:25,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 14:35:25,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 14:35:25,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 14:35:25,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 02:35:21" (1/3) ... [2021-11-02 14:35:25,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d3ca1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:35:25, skipping insertion in model container [2021-11-02 14:35:25,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:35:23" (2/3) ... [2021-11-02 14:35:25,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d3ca1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:35:25, skipping insertion in model container [2021-11-02 14:35:25,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:35:25" (3/3) ... [2021-11-02 14:35:25,113 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-02 14:35:25,117 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 14:35:25,118 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-02 14:35:25,168 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 14:35:25,173 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 14:35:25,173 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-02 14:35:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 14:35:25,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:35:25,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:35:25,198 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:35:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:35:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-02 14:35:25,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:35:25,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120849298] [2021-11-02 14:35:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:35:25,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:35:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:35:25,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:35:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 14:35:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:35:25,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:35:25,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:35:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:35:25,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:35:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:35:25,798 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:35:25,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120849298] [2021-11-02 14:35:25,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120849298] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:35:25,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:35:25,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 14:35:25,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397516105] [2021-11-02 14:35:25,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:35:25,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:35:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:35:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:35:25,821 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:27,890 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:31,040 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:40,541 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:43,611 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:35:48,580 INFO L93 Difference]: Finished difference Result 1119 states and 1645 transitions. [2021-11-02 14:35:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:35:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-02 14:35:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:35:48,596 INFO L225 Difference]: With dead ends: 1119 [2021-11-02 14:35:48,596 INFO L226 Difference]: Without dead ends: 696 [2021-11-02 14:35:48,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.36ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:35:48,602 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 419 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21675.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.13ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22570.60ms IncrementalHoareTripleChecker+Time [2021-11-02 14:35:48,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 18 Invalid, 1025 Unknown, 0 Unchecked, 16.13ms Time], IncrementalHoareTripleChecker [6 Valid, 1016 Invalid, 3 Unknown, 0 Unchecked, 22570.60ms Time] [2021-11-02 14:35:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-02 14:35:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 678. [2021-11-02 14:35:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 667 states have (on average 1.3403298350824588) internal successors, (894), 677 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 894 transitions. [2021-11-02 14:35:48,660 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 894 transitions. Word has length 10 [2021-11-02 14:35:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:35:48,660 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 894 transitions. [2021-11-02 14:35:48,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 894 transitions. [2021-11-02 14:35:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:35:48,661 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:35:48,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:35:48,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 14:35:48,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:35:48,870 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:35:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:35:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-02 14:35:48,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:35:48,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505539856] [2021-11-02 14:35:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:35:48,871 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:35:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:35:48,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:35:48,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 14:35:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:35:49,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:35:49,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:35:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:35:49,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:35:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:35:49,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:35:49,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505539856] [2021-11-02 14:35:49,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505539856] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:35:49,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:35:49,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 14:35:49,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409109869] [2021-11-02 14:35:49,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:35:49,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:35:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:35:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:35:49,508 INFO L87 Difference]: Start difference. First operand 678 states and 894 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:35:51,569 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:55,073 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:59,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:02,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:10,888 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:36:17,112 INFO L93 Difference]: Finished difference Result 1940 states and 2571 transitions. [2021-11-02 14:36:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:36:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-02 14:36:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:36:17,118 INFO L225 Difference]: With dead ends: 1940 [2021-11-02 14:36:17,118 INFO L226 Difference]: Without dead ends: 1267 [2021-11-02 14:36:17,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.67ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:36:17,122 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 402 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26323.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.13ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27404.21ms IncrementalHoareTripleChecker+Time [2021-11-02 14:36:17,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 11.13ms Time], IncrementalHoareTripleChecker [3 Valid, 997 Invalid, 3 Unknown, 0 Unchecked, 27404.21ms Time] [2021-11-02 14:36:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2021-11-02 14:36:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1239. [2021-11-02 14:36:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1228 states have (on average 1.3460912052117264) internal successors, (1653), 1238 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1653 transitions. [2021-11-02 14:36:17,182 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1653 transitions. Word has length 11 [2021-11-02 14:36:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:36:17,183 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1653 transitions. [2021-11-02 14:36:17,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1653 transitions. [2021-11-02 14:36:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 14:36:17,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:36:17,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:36:17,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 14:36:17,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:36:17,391 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:36:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:36:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-02 14:36:17,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:36:17,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788907357] [2021-11-02 14:36:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:36:17,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:36:17,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:36:17,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:36:17,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 14:36:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:36:17,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 14:36:17,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:36:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:18,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:36:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:18,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:36:18,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788907357] [2021-11-02 14:36:18,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788907357] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:36:18,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:36:18,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 14:36:18,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285159516] [2021-11-02 14:36:18,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:36:18,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:36:18,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:36:18,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:36:18,370 INFO L87 Difference]: Start difference. First operand 1239 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:20,434 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:22,876 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:26,699 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:48,012 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:36:52,093 INFO L93 Difference]: Finished difference Result 2472 states and 3299 transitions. [2021-11-02 14:36:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:36:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-02 14:36:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:36:52,099 INFO L225 Difference]: With dead ends: 2472 [2021-11-02 14:36:52,100 INFO L226 Difference]: Without dead ends: 1239 [2021-11-02 14:36:52,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.67ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:36:52,106 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32303.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33502.47ms IncrementalHoareTripleChecker+Time [2021-11-02 14:36:52,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 14.24ms Time], IncrementalHoareTripleChecker [0 Valid, 1505 Invalid, 3 Unknown, 0 Unchecked, 33502.47ms Time] [2021-11-02 14:36:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2021-11-02 14:36:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2021-11-02 14:36:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1228 states have (on average 1.3452768729641693) internal successors, (1652), 1238 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1652 transitions. [2021-11-02 14:36:52,142 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1652 transitions. Word has length 38 [2021-11-02 14:36:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:36:52,144 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1652 transitions. [2021-11-02 14:36:52,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1652 transitions. [2021-11-02 14:36:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 14:36:52,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:36:52,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:36:52,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 14:36:52,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:36:52,375 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:36:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:36:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 667504064, now seen corresponding path program 1 times [2021-11-02 14:36:52,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:36:52,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181303274] [2021-11-02 14:36:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:36:52,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:36:52,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:36:52,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:36:52,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 14:36:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:36:52,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:36:52,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:36:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:53,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:36:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:53,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:36:53,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181303274] [2021-11-02 14:36:53,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181303274] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:36:53,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:36:53,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 14:36:53,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638002541] [2021-11-02 14:36:53,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:36:53,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:36:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:36:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:36:53,404 INFO L87 Difference]: Start difference. First operand 1239 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:36:55,477 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:58,573 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:19,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:23,225 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:29,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:37:29,329 INFO L93 Difference]: Finished difference Result 4552 states and 6121 transitions. [2021-11-02 14:37:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:37:29,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-02 14:37:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:37:29,340 INFO L225 Difference]: With dead ends: 4552 [2021-11-02 14:37:29,340 INFO L226 Difference]: Without dead ends: 3320 [2021-11-02 14:37:29,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.03ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:37:29,343 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1094 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34029.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.80ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35645.32ms IncrementalHoareTripleChecker+Time [2021-11-02 14:37:29,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 0 Invalid, 1373 Unknown, 0 Unchecked, 17.80ms Time], IncrementalHoareTripleChecker [9 Valid, 1361 Invalid, 3 Unknown, 0 Unchecked, 35645.32ms Time] [2021-11-02 14:37:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2021-11-02 14:37:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3254. [2021-11-02 14:37:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3243 states have (on average 1.3595436324390997) internal successors, (4409), 3253 states have internal predecessors, (4409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:37:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4409 transitions. [2021-11-02 14:37:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4409 transitions. Word has length 38 [2021-11-02 14:37:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:37:29,422 INFO L470 AbstractCegarLoop]: Abstraction has 3254 states and 4409 transitions. [2021-11-02 14:37:29,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:37:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4409 transitions. [2021-11-02 14:37:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 14:37:29,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:37:29,425 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:37:29,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 14:37:29,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:37:29,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:37:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:37:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1703756643, now seen corresponding path program 1 times [2021-11-02 14:37:29,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:37:29,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979884556] [2021-11-02 14:37:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:37:29,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:37:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:37:29,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:37:29,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 14:37:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:37:30,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:37:30,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:37:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:37:30,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:37:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:37:30,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:37:30,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979884556] [2021-11-02 14:37:30,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979884556] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:37:30,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:37:30,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 14:37:30,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127944408] [2021-11-02 14:37:30,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 14:37:30,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:37:30,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 14:37:30,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:37:30,638 INFO L87 Difference]: Start difference. First operand 3254 states and 4409 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:37:32,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:35,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:36,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:40,254 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:48,528 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:49,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:59,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:04,687 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:08,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:09,371 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:20,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:31,600 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:34,624 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:35,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:38:48,147 INFO L93 Difference]: Finished difference Result 12768 states and 17300 transitions. [2021-11-02 14:38:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:38:48,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 14:38:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:38:48,181 INFO L225 Difference]: With dead ends: 12768 [2021-11-02 14:38:48,181 INFO L226 Difference]: Without dead ends: 9522 [2021-11-02 14:38:48,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 188.10ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:38:48,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1617 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74328.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.97ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77026.67ms IncrementalHoareTripleChecker+Time [2021-11-02 14:38:48,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1617 Valid, 0 Invalid, 3087 Unknown, 0 Unchecked, 28.97ms Time], IncrementalHoareTripleChecker [3 Valid, 3081 Invalid, 3 Unknown, 0 Unchecked, 77026.67ms Time] [2021-11-02 14:38:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states. [2021-11-02 14:38:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 3278. [2021-11-02 14:38:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3267 states have (on average 1.3569023569023568) internal successors, (4433), 3277 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:38:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4433 transitions. [2021-11-02 14:38:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4433 transitions. Word has length 41 [2021-11-02 14:38:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:38:48,336 INFO L470 AbstractCegarLoop]: Abstraction has 3278 states and 4433 transitions. [2021-11-02 14:38:48,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:38:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4433 transitions. [2021-11-02 14:38:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:38:48,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:38:48,338 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:38:48,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 14:38:48,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:38:48,553 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:38:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:38:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1337408933, now seen corresponding path program 1 times [2021-11-02 14:38:48,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:38:48,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524284527] [2021-11-02 14:38:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:38:48,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:38:48,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:38:48,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:38:48,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 14:38:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:38:48,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:38:48,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:38:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:38:49,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:38:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:38:49,438 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:38:49,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524284527] [2021-11-02 14:38:49,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524284527] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:38:49,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:38:49,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 14:38:49,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873601029] [2021-11-02 14:38:49,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 14:38:49,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:38:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 14:38:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:38:49,440 INFO L87 Difference]: Start difference. First operand 3278 states and 4433 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:38:51,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:58,082 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:42,253 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:49,996 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:39:54,058 INFO L93 Difference]: Finished difference Result 10872 states and 14740 transitions. [2021-11-02 14:39:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:39:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 14:39:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:39:54,080 INFO L225 Difference]: With dead ends: 10872 [2021-11-02 14:39:54,080 INFO L226 Difference]: Without dead ends: 7602 [2021-11-02 14:39:54,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 182.86ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:39:54,085 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1143 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61881.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.42ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64198.38ms IncrementalHoareTripleChecker+Time [2021-11-02 14:39:54,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 0 Invalid, 2863 Unknown, 0 Unchecked, 27.42ms Time], IncrementalHoareTripleChecker [1 Valid, 2859 Invalid, 3 Unknown, 0 Unchecked, 64198.38ms Time] [2021-11-02 14:39:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7602 states. [2021-11-02 14:39:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7602 to 3302. [2021-11-02 14:39:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3291 states have (on average 1.3542996049832878) internal successors, (4457), 3301 states have internal predecessors, (4457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:39:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4457 transitions. [2021-11-02 14:39:54,231 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4457 transitions. Word has length 42 [2021-11-02 14:39:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:39:54,231 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4457 transitions. [2021-11-02 14:39:54,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:39:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4457 transitions. [2021-11-02 14:39:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:39:54,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:39:54,233 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:39:54,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 14:39:54,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:39:54,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:39:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:39:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash -283318246, now seen corresponding path program 1 times [2021-11-02 14:39:54,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:39:54,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047529826] [2021-11-02 14:39:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:39:54,451 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:39:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:39:54,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:39:54,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 14:39:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:39:54,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 14:39:54,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:39:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:39:55,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:39:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:39:55,465 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:39:55,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047529826] [2021-11-02 14:39:55,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047529826] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:39:55,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:39:55,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 14:39:55,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140194604] [2021-11-02 14:39:55,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:39:55,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:39:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:39:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:39:55,466 INFO L87 Difference]: Start difference. First operand 3302 states and 4457 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:39:57,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:00,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:04,883 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:09,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:35,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:36,765 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:38,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:40,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:41,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:57,269 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:58,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:04,890 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:09,579 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:22,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:32,242 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:34,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:40,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:41:43,258 INFO L93 Difference]: Finished difference Result 17802 states and 24094 transitions. [2021-11-02 14:41:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 14:41:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 14:41:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:41:43,302 INFO L225 Difference]: With dead ends: 17802 [2021-11-02 14:41:43,302 INFO L226 Difference]: Without dead ends: 16082 [2021-11-02 14:41:43,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 518.51ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 14:41:43,310 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2705 mSDsluCounter, 3052 mSDsCounter, 0 mSdLazyCounter, 4176 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102018.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.26ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106442.78ms IncrementalHoareTripleChecker+Time [2021-11-02 14:41:43,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2705 Valid, 0 Invalid, 4204 Unknown, 0 Unchecked, 43.26ms Time], IncrementalHoareTripleChecker [25 Valid, 4176 Invalid, 3 Unknown, 0 Unchecked, 106442.78ms Time] [2021-11-02 14:41:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16082 states. [2021-11-02 14:41:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16082 to 3377. [2021-11-02 14:41:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 3366 states have (on average 1.34640522875817) internal successors, (4532), 3376 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:41:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4532 transitions. [2021-11-02 14:41:43,583 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4532 transitions. Word has length 42 [2021-11-02 14:41:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:41:43,583 INFO L470 AbstractCegarLoop]: Abstraction has 3377 states and 4532 transitions. [2021-11-02 14:41:43,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:41:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4532 transitions. [2021-11-02 14:41:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 14:41:43,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:41:43,586 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:41:43,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-02 14:41:43,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:41:43,791 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-02 14:41:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:41:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1871666148, now seen corresponding path program 1 times [2021-11-02 14:41:43,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:41:43,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50821744] [2021-11-02 14:41:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:41:43,792 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:41:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:41:43,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:41:43,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 14:41:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:41:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 14:41:44,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:41:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:41:44,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:41:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:41:44,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:41:44,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50821744] [2021-11-02 14:41:44,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50821744] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:41:44,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:41:44,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-02 14:41:44,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199305164] [2021-11-02 14:41:44,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 14:41:44,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:41:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 14:41:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:41:44,804 INFO L87 Difference]: Start difference. First operand 3377 states and 4532 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:41:46,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:56,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:09,827 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15