./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 17:43:54,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 17:43:54,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 17:43:54,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 17:43:54,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 17:43:54,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 17:43:54,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 17:43:54,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 17:43:54,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 17:43:54,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 17:43:54,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 17:43:54,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 17:43:54,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 17:43:54,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 17:43:54,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 17:43:54,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 17:43:54,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 17:43:54,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 17:43:54,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 17:43:54,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 17:43:54,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 17:43:54,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 17:43:54,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 17:43:54,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 17:43:54,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 17:43:54,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 17:43:54,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 17:43:54,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 17:43:54,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 17:43:54,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 17:43:54,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 17:43:54,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 17:43:54,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 17:43:54,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 17:43:54,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 17:43:54,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 17:43:54,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 17:43:54,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 17:43:54,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 17:43:54,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 17:43:54,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 17:43:54,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 17:43:54,736 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 17:43:54,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 17:43:54,736 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 17:43:54,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 17:43:54,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 17:43:54,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 17:43:54,738 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 17:43:54,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 17:43:54,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 17:43:54,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 17:43:54,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 17:43:54,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 17:43:54,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 17:43:54,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 17:43:54,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 17:43:54,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 17:43:54,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 17:43:54,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 17:43:54,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 17:43:54,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 17:43:54,741 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 17:43:54,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 17:43:54,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 17:43:54,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 17:43:54,741 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 -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-02 17:43:54,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 17:43:54,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 17:43:54,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 17:43:54,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 17:43:54,940 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 17:43:54,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:43:55,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f7d10a9/516fe4e1e7ce421f83bea0b83b13ac21/FLAG1150a4dc3 [2021-11-02 17:43:55,537 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 17:43:55,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:43:55,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f7d10a9/516fe4e1e7ce421f83bea0b83b13ac21/FLAG1150a4dc3 [2021-11-02 17:43:56,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f7d10a9/516fe4e1e7ce421f83bea0b83b13ac21 [2021-11-02 17:43:56,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 17:43:56,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 17:43:56,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 17:43:56,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 17:43:56,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 17:43:56,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:56,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6defaf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56, skipping insertion in model container [2021-11-02 17:43:56,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:56,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 17:43:56,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 17:43:56,529 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-02 17:43:56,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 17:43:56,799 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 17:43:56,859 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-02 17:43:56,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 17:43:56,992 INFO L208 MainTranslator]: Completed translation [2021-11-02 17:43:56,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56 WrapperNode [2021-11-02 17:43:56,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 17:43:56,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 17:43:56,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 17:43:56,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 17:43:56,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 17:43:57,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 17:43:57,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 17:43:57,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 17:43:57,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 17:43:57,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 17:43:57,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 17:43:57,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 17:43:57,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (1/1) ... [2021-11-02 17:43:57,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 17:43:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 17:43:57,272 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 17:43:57,275 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 17:43:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-02 17:43:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 17:43:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 17:43:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 17:43:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 17:43:57,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 17:44:00,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 17:44:00,297 INFO L299 CfgBuilder]: Removed 310 assume(true) statements. [2021-11-02 17:44:00,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 05:44:00 BoogieIcfgContainer [2021-11-02 17:44:00,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 17:44:00,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 17:44:00,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 17:44:00,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 17:44:00,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 05:43:56" (1/3) ... [2021-11-02 17:44:00,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52136b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 05:44:00, skipping insertion in model container [2021-11-02 17:44:00,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:43:56" (2/3) ... [2021-11-02 17:44:00,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52136b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 05:44:00, skipping insertion in model container [2021-11-02 17:44:00,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 05:44:00" (3/3) ... [2021-11-02 17:44:00,306 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:44:00,310 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 17:44:00,310 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 17:44:00,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 17:44:00,350 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 17:44:00,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 17:44:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 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 17:44:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 17:44:00,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:00,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:44:00,370 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1148713798, now seen corresponding path program 1 times [2021-11-02 17:44:00,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:00,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145345740] [2021-11-02 17:44:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:00,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:00,746 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 17:44:00,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:00,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145345740] [2021-11-02 17:44:00,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145345740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:00,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:00,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 17:44:00,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915459621] [2021-11-02 17:44:00,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:00,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:00,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:00,773 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17:44:02,852 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:06,104 INFO L93 Difference]: Finished difference Result 1120 states and 1667 transitions. [2021-11-02 17:44:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:06,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-11-02 17:44:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:06,121 INFO L225 Difference]: With dead ends: 1120 [2021-11-02 17:44:06,124 INFO L226 Difference]: Without dead ends: 725 [2021-11-02 17:44:06,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:06,134 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 499 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4684.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.58ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5180.02ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:06,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 8 Invalid, 1060 Unknown, 0 Unchecked, 12.58ms Time], IncrementalHoareTripleChecker [3 Valid, 1056 Invalid, 1 Unknown, 0 Unchecked, 5180.02ms Time] [2021-11-02 17:44:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-11-02 17:44:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2021-11-02 17:44:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 720 states have (on average 1.4055555555555554) internal successors, (1012), 724 states have internal predecessors, (1012), 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 17:44:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1012 transitions. [2021-11-02 17:44:06,225 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1012 transitions. Word has length 15 [2021-11-02 17:44:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:06,226 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1012 transitions. [2021-11-02 17:44:06,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17:44:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1012 transitions. [2021-11-02 17:44:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-02 17:44:06,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:06,227 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] [2021-11-02 17:44:06,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 17:44:06,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1888760138, now seen corresponding path program 1 times [2021-11-02 17:44:06,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:06,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204572194] [2021-11-02 17:44:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:06,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:06,395 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 17:44:06,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:06,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204572194] [2021-11-02 17:44:06,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204572194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:06,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:06,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 17:44:06,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235206126] [2021-11-02 17:44:06,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:06,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:06,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:06,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:06,404 INFO L87 Difference]: Start difference. First operand 725 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 17:44:08,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:13,000 INFO L93 Difference]: Finished difference Result 1108 states and 1534 transitions. [2021-11-02 17:44:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-11-02 17:44:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:13,004 INFO L225 Difference]: With dead ends: 1108 [2021-11-02 17:44:13,004 INFO L226 Difference]: Without dead ends: 1093 [2021-11-02 17:44:13,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:13,006 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 513 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5867.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.75ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6468.91ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:13,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 0 Invalid, 1554 Unknown, 0 Unchecked, 11.75ms Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 1 Unknown, 0 Unchecked, 6468.91ms Time] [2021-11-02 17:44:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-11-02 17:44:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 725. [2021-11-02 17:44:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 720 states have (on average 1.4041666666666666) internal successors, (1011), 724 states have internal predecessors, (1011), 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 17:44:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1011 transitions. [2021-11-02 17:44:13,032 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1011 transitions. Word has length 22 [2021-11-02 17:44:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:13,032 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1011 transitions. [2021-11-02 17:44:13,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 17:44:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1011 transitions. [2021-11-02 17:44:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-02 17:44:13,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:13,033 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] [2021-11-02 17:44:13,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 17:44:13,034 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1888700556, now seen corresponding path program 1 times [2021-11-02 17:44:13,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:13,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126433002] [2021-11-02 17:44:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:13,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:13,304 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 17:44:13,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:13,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126433002] [2021-11-02 17:44:13,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126433002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:13,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:13,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 17:44:13,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127508744] [2021-11-02 17:44:13,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:13,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:13,312 INFO L87 Difference]: Start difference. First operand 725 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 17:44:15,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:18,181 INFO L93 Difference]: Finished difference Result 2157 states and 3014 transitions. [2021-11-02 17:44:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2021-11-02 17:44:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:18,185 INFO L225 Difference]: With dead ends: 2157 [2021-11-02 17:44:18,186 INFO L226 Difference]: Without dead ends: 1440 [2021-11-02 17:44:18,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:18,190 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4348.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4770.44ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:18,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 1045 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [4 Valid, 1040 Invalid, 1 Unknown, 0 Unchecked, 4770.44ms Time] [2021-11-02 17:44:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2021-11-02 17:44:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1428. [2021-11-02 17:44:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1423 states have (on average 1.4026704146170064) internal successors, (1996), 1427 states have internal predecessors, (1996), 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 17:44:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1996 transitions. [2021-11-02 17:44:18,219 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1996 transitions. Word has length 22 [2021-11-02 17:44:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:18,219 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 1996 transitions. [2021-11-02 17:44:18,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 17:44:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1996 transitions. [2021-11-02 17:44:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 17:44:18,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:18,220 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] [2021-11-02 17:44:18,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 17:44:18,220 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1579824603, now seen corresponding path program 1 times [2021-11-02 17:44:18,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:18,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109251164] [2021-11-02 17:44:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:18,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:18,391 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 17:44:18,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:18,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109251164] [2021-11-02 17:44:18,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109251164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:18,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:18,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 17:44:18,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715994748] [2021-11-02 17:44:18,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:18,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:18,393 INFO L87 Difference]: Start difference. First operand 1428 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 17:44:20,430 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:24,101 INFO L93 Difference]: Finished difference Result 4262 states and 5961 transitions. [2021-11-02 17:44:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2021-11-02 17:44:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:24,110 INFO L225 Difference]: With dead ends: 4262 [2021-11-02 17:44:24,110 INFO L226 Difference]: Without dead ends: 2842 [2021-11-02 17:44:24,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:24,112 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 499 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5115.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.67ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5591.73ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:24,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 0 Invalid, 1450 Unknown, 0 Unchecked, 7.67ms Time], IncrementalHoareTripleChecker [1 Valid, 1448 Invalid, 1 Unknown, 0 Unchecked, 5591.73ms Time] [2021-11-02 17:44:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2021-11-02 17:44:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2831. [2021-11-02 17:44:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2826 states have (on average 1.4012738853503184) internal successors, (3960), 2830 states have internal predecessors, (3960), 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 17:44:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3960 transitions. [2021-11-02 17:44:24,158 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3960 transitions. Word has length 23 [2021-11-02 17:44:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:24,158 INFO L470 AbstractCegarLoop]: Abstraction has 2831 states and 3960 transitions. [2021-11-02 17:44:24,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 17:44:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3960 transitions. [2021-11-02 17:44:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 17:44:24,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:24,159 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] [2021-11-02 17:44:24,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 17:44:24,160 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1729922142, now seen corresponding path program 1 times [2021-11-02 17:44:24,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:24,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451549733] [2021-11-02 17:44:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:24,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:24,275 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 17:44:24,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:24,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451549733] [2021-11-02 17:44:24,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451549733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:24,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:24,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 17:44:24,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722322270] [2021-11-02 17:44:24,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:24,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:24,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:24,277 INFO L87 Difference]: Start difference. First operand 2831 states and 3960 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 17:44:26,315 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:29,811 INFO L93 Difference]: Finished difference Result 2836 states and 3964 transitions. [2021-11-02 17:44:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2021-11-02 17:44:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:29,819 INFO L225 Difference]: With dead ends: 2836 [2021-11-02 17:44:29,819 INFO L226 Difference]: Without dead ends: 2834 [2021-11-02 17:44:29,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:29,820 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 496 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4964.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.60ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5439.38ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:29,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 0 Invalid, 1444 Unknown, 0 Unchecked, 5.60ms Time], IncrementalHoareTripleChecker [1 Valid, 1442 Invalid, 1 Unknown, 0 Unchecked, 5439.38ms Time] [2021-11-02 17:44:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-11-02 17:44:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2832. [2021-11-02 17:44:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2827 states have (on average 1.401131941987973) internal successors, (3961), 2831 states have internal predecessors, (3961), 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 17:44:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3961 transitions. [2021-11-02 17:44:29,919 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3961 transitions. Word has length 24 [2021-11-02 17:44:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:29,919 INFO L470 AbstractCegarLoop]: Abstraction has 2832 states and 3961 transitions. [2021-11-02 17:44:29,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 17:44:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3961 transitions. [2021-11-02 17:44:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 17:44:29,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:29,926 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] [2021-11-02 17:44:29,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 17:44:29,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2087978565, now seen corresponding path program 1 times [2021-11-02 17:44:29,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:29,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740215464] [2021-11-02 17:44:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:29,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:30,049 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 17:44:30,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:30,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740215464] [2021-11-02 17:44:30,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740215464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:30,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:30,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 17:44:30,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455337769] [2021-11-02 17:44:30,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:30,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:30,051 INFO L87 Difference]: Start difference. First operand 2832 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 17:44:32,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:33,645 INFO L93 Difference]: Finished difference Result 2832 states and 3961 transitions. [2021-11-02 17:44:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2021-11-02 17:44:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:33,652 INFO L225 Difference]: With dead ends: 2832 [2021-11-02 17:44:33,652 INFO L226 Difference]: Without dead ends: 2830 [2021-11-02 17:44:33,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.41ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:33,655 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3203.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3546.27ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:33,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 1 Unknown, 0 Unchecked, 3546.27ms Time] [2021-11-02 17:44:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2021-11-02 17:44:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2021-11-02 17:44:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2826 states have (on average 1.4009200283085634) internal successors, (3959), 2829 states have internal predecessors, (3959), 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 17:44:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3959 transitions. [2021-11-02 17:44:33,699 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3959 transitions. Word has length 25 [2021-11-02 17:44:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:33,700 INFO L470 AbstractCegarLoop]: Abstraction has 2830 states and 3959 transitions. [2021-11-02 17:44:33,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 17:44:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3959 transitions. [2021-11-02 17:44:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 17:44:33,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:33,701 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] [2021-11-02 17:44:33,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 17:44:33,701 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 302825800, now seen corresponding path program 1 times [2021-11-02 17:44:33,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:33,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627986651] [2021-11-02 17:44:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:33,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:33,789 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 17:44:33,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:33,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627986651] [2021-11-02 17:44:33,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627986651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:33,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:33,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 17:44:33,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778664549] [2021-11-02 17:44:33,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:33,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:33,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:33,791 INFO L87 Difference]: Start difference. First operand 2830 states and 3959 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 17:44:35,818 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 17:44:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:37,543 INFO L93 Difference]: Finished difference Result 2830 states and 3959 transitions. [2021-11-02 17:44:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:37,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2021-11-02 17:44:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:37,551 INFO L225 Difference]: With dead ends: 2830 [2021-11-02 17:44:37,551 INFO L226 Difference]: Without dead ends: 2821 [2021-11-02 17:44:37,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.52ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:37,553 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 498 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3426.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.69ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3682.17ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:37,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 1.69ms Time], IncrementalHoareTripleChecker [0 Valid, 521 Invalid, 1 Unknown, 0 Unchecked, 3682.17ms Time] [2021-11-02 17:44:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2021-11-02 17:44:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2821. [2021-11-02 17:44:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2818 states have (on average 1.400638750887154) internal successors, (3947), 2820 states have internal predecessors, (3947), 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 17:44:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3947 transitions. [2021-11-02 17:44:37,607 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3947 transitions. Word has length 26 [2021-11-02 17:44:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:37,607 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 3947 transitions. [2021-11-02 17:44:37,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 17:44:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3947 transitions. [2021-11-02 17:44:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 17:44:37,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:37,611 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 17:44:37,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 17:44:37,611 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -67576925, now seen corresponding path program 1 times [2021-11-02 17:44:37,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:37,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389765243] [2021-11-02 17:44:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:37,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 17:44:37,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:37,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389765243] [2021-11-02 17:44:37,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389765243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:37,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:37,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 17:44:37,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020544867] [2021-11-02 17:44:37,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:44:37,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:44:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:37,727 INFO L87 Difference]: Start difference. First operand 2821 states and 3947 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 17:44:39,754 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 17:44:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:42,244 INFO L93 Difference]: Finished difference Result 5756 states and 8057 transitions. [2021-11-02 17:44:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:44:42,245 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 17:44:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:42,252 INFO L225 Difference]: With dead ends: 5756 [2021-11-02 17:44:42,252 INFO L226 Difference]: Without dead ends: 2943 [2021-11-02 17:44:42,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.26ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:44:42,254 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4073.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.61ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4428.95ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:42,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 1041 Unknown, 0 Unchecked, 4.61ms Time], IncrementalHoareTripleChecker [2 Valid, 1038 Invalid, 1 Unknown, 0 Unchecked, 4428.95ms Time] [2021-11-02 17:44:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-11-02 17:44:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2921. [2021-11-02 17:44:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2918 states have (on average 1.4016449623029472) internal successors, (4090), 2920 states have internal predecessors, (4090), 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 17:44:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4090 transitions. [2021-11-02 17:44:42,298 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4090 transitions. Word has length 61 [2021-11-02 17:44:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:42,298 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 4090 transitions. [2021-11-02 17:44:42,298 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 17:44:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4090 transitions. [2021-11-02 17:44:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 17:44:42,300 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:42,301 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:44:42,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 17:44:42,301 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1531221519, now seen corresponding path program 1 times [2021-11-02 17:44:42,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:42,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294154051] [2021-11-02 17:44:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:42,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:44:42,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:42,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294154051] [2021-11-02 17:44:42,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294154051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:42,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:42,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 17:44:42,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555894074] [2021-11-02 17:44:42,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 17:44:42,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 17:44:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 17:44:42,739 INFO L87 Difference]: Start difference. First operand 2921 states and 4090 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 17:44:44,777 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:44:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:44:53,548 INFO L93 Difference]: Finished difference Result 11655 states and 16064 transitions. [2021-11-02 17:44:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 17:44:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 69 [2021-11-02 17:44:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:44:53,569 INFO L225 Difference]: With dead ends: 11655 [2021-11-02 17:44:53,569 INFO L226 Difference]: Without dead ends: 8742 [2021-11-02 17:44:53,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 314.83ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-02 17:44:53,572 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2987 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9464.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2987 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.87ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10269.64ms IncrementalHoareTripleChecker+Time [2021-11-02 17:44:53,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2987 Valid, 0 Invalid, 3753 Unknown, 0 Unchecked, 44.87ms Time], IncrementalHoareTripleChecker [20 Valid, 3732 Invalid, 1 Unknown, 0 Unchecked, 10269.64ms Time] [2021-11-02 17:44:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8742 states. [2021-11-02 17:44:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8742 to 3025. [2021-11-02 17:44:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.3904698874917274) internal successors, (4202), 3024 states have internal predecessors, (4202), 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 17:44:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4202 transitions. [2021-11-02 17:44:53,673 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4202 transitions. Word has length 69 [2021-11-02 17:44:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:44:53,673 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4202 transitions. [2021-11-02 17:44:53,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 17:44:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4202 transitions. [2021-11-02 17:44:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-02 17:44:53,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:44:53,675 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:44:53,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 17:44:53,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:44:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:44:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash 605807179, now seen corresponding path program 1 times [2021-11-02 17:44:53,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:44:53,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903553880] [2021-11-02 17:44:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:44:53,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:44:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:44:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:44:54,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:44:54,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903553880] [2021-11-02 17:44:54,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903553880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:44:54,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:44:54,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 17:44:54,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329599116] [2021-11-02 17:44:54,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 17:44:54,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:44:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 17:44:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-02 17:44:54,003 INFO L87 Difference]: Start difference. First operand 3025 states and 4202 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 17:44:56,039 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:45:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:45:05,908 INFO L93 Difference]: Finished difference Result 10578 states and 14567 transitions. [2021-11-02 17:45:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 17:45:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 71 [2021-11-02 17:45:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:45:05,921 INFO L225 Difference]: With dead ends: 10578 [2021-11-02 17:45:05,921 INFO L226 Difference]: Without dead ends: 7561 [2021-11-02 17:45:05,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 371.97ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-02 17:45:05,925 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2461 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 4283 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10487.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.70ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11303.34ms IncrementalHoareTripleChecker+Time [2021-11-02 17:45:05,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2461 Valid, 0 Invalid, 4297 Unknown, 0 Unchecked, 19.70ms Time], IncrementalHoareTripleChecker [13 Valid, 4283 Invalid, 1 Unknown, 0 Unchecked, 11303.34ms Time] [2021-11-02 17:45:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7561 states. [2021-11-02 17:45:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7561 to 3025. [2021-11-02 17:45:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.3904698874917274) internal successors, (4202), 3024 states have internal predecessors, (4202), 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 17:45:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4202 transitions. [2021-11-02 17:45:06,080 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4202 transitions. Word has length 71 [2021-11-02 17:45:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:45:06,080 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4202 transitions. [2021-11-02 17:45:06,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 17:45:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4202 transitions. [2021-11-02 17:45:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-02 17:45:06,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:45:06,082 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:45:06,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 17:45:06,082 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:45:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:45:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash 449215055, now seen corresponding path program 1 times [2021-11-02 17:45:06,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:45:06,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071360346] [2021-11-02 17:45:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:45:06,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:45:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:45:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:45:06,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 17:45:06,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071360346] [2021-11-02 17:45:06,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071360346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 17:45:06,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:45:06,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 17:45:06,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062612386] [2021-11-02 17:45:06,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 17:45:06,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 17:45:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 17:45:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:45:06,308 INFO L87 Difference]: Start difference. First operand 3025 states and 4202 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 17:45:08,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:45:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:45:12,821 INFO L93 Difference]: Finished difference Result 8679 states and 12120 transitions. [2021-11-02 17:45:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 17:45:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 73 [2021-11-02 17:45:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:45:12,830 INFO L225 Difference]: With dead ends: 8679 [2021-11-02 17:45:12,830 INFO L226 Difference]: Without dead ends: 5646 [2021-11-02 17:45:12,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 17:45:12,836 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 463 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5741.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.52ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6264.12ms IncrementalHoareTripleChecker+Time [2021-11-02 17:45:12,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 0 Invalid, 1666 Unknown, 0 Unchecked, 5.52ms Time], IncrementalHoareTripleChecker [6 Valid, 1659 Invalid, 1 Unknown, 0 Unchecked, 6264.12ms Time] [2021-11-02 17:45:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2021-11-02 17:45:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 3025. [2021-11-02 17:45:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3022 states have (on average 1.387822634017207) internal successors, (4194), 3024 states have internal predecessors, (4194), 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 17:45:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4194 transitions. [2021-11-02 17:45:12,947 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4194 transitions. Word has length 73 [2021-11-02 17:45:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:45:12,948 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4194 transitions. [2021-11-02 17:45:12,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 17:45:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4194 transitions. [2021-11-02 17:45:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 17:45:12,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:45:12,961 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:45:12,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 17:45:12,962 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:45:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:45:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 77040683, now seen corresponding path program 1 times [2021-11-02 17:45:12,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 17:45:12,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837365385] [2021-11-02 17:45:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:45:12,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 17:45:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 17:45:13,936 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 17:45:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 17:45:14,927 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 17:45:14,927 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 17:45:14,928 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-02 17:45:14,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-02 17:45:14,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-02 17:45:14,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-02 17:45:14,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-02 17:45:14,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 17:45:14,935 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:45:14,937 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 17:45:15,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 05:45:15 BoogieIcfgContainer [2021-11-02 17:45:15,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 17:45:15,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 17:45:15,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 17:45:15,456 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 17:45:15,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 05:44:00" (3/4) ... [2021-11-02 17:45:15,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 17:45:15,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 17:45:15,459 INFO L158 Benchmark]: Toolchain (without parser) took 79435.85ms. Allocated memory was 104.9MB in the beginning and 423.6MB in the end (delta: 318.8MB). Free memory was 66.2MB in the beginning and 265.0MB in the end (delta: -198.9MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,459 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 17:45:15,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 963.09ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 75.8MB in the end (delta: -9.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.40ms. Allocated memory is still 127.9MB. Free memory was 75.8MB in the beginning and 59.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,461 INFO L158 Benchmark]: Boogie Preprocessor took 115.87ms. Allocated memory was 127.9MB in the beginning and 239.1MB in the end (delta: 111.1MB). Free memory was 59.5MB in the beginning and 181.3MB in the end (delta: -121.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,461 INFO L158 Benchmark]: RCFGBuilder took 3058.88ms. Allocated memory was 239.1MB in the beginning and 341.8MB in the end (delta: 102.8MB). Free memory was 181.3MB in the beginning and 203.8MB in the end (delta: -22.6MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,461 INFO L158 Benchmark]: TraceAbstraction took 75153.82ms. Allocated memory was 341.8MB in the beginning and 423.6MB in the end (delta: 81.8MB). Free memory was 202.8MB in the beginning and 265.0MB in the end (delta: -62.3MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. [2021-11-02 17:45:15,461 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 423.6MB. Free memory is still 265.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 17:45:15,463 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.18ms. Allocated memory is still 104.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 963.09ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 66.0MB in the beginning and 75.8MB in the end (delta: -9.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.40ms. Allocated memory is still 127.9MB. Free memory was 75.8MB in the beginning and 59.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.87ms. Allocated memory was 127.9MB in the beginning and 239.1MB in the end (delta: 111.1MB). Free memory was 59.5MB in the beginning and 181.3MB in the end (delta: -121.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3058.88ms. Allocated memory was 239.1MB in the beginning and 341.8MB in the end (delta: 102.8MB). Free memory was 181.3MB in the beginning and 203.8MB in the end (delta: -22.6MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. * TraceAbstraction took 75153.82ms. Allocated memory was 341.8MB in the beginning and 423.6MB in the end (delta: 81.8MB). Free memory was 202.8MB in the beginning and 265.0MB in the end (delta: -62.3MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 423.6MB. Free memory is still 265.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 3766. Possible FailurePath: [L3758] int ldv_state_variable_1 ; [L3759] int LDV_IN_INTERRUPT = 1; [L3760] int usb_counter ; [L3761] struct usb_interface *gtco_driverinfo_table_group1 ; [L3762] int ref_cnt ; [L3763] int ldv_state_variable_0 ; [L3830-L3844] static struct usb_device_id const gtco_usbid_table[6U] = { {3U, 1932U, 1024U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 1025U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4096U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4097U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4098U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L3845] struct usb_device_id const __mod_usb_device_table ; [L4829-L4834] static struct usb_driver gtco_driverinfo_table = {"gtco", & gtco_probe, & gtco_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& gtco_usbid_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4850] int ldv_retval_0 ; [L4851] int ldv_retval_1 ; [L5064] int INTERF_STATE = 0; [L5065] int SERIAL_STATE = 0; [L5066] void *usb_intfdata = 0; [L5067] struct urb *usb_urb = 0; [L5068] struct usb_device *usb_dev = 0; [L5069] int dev_counter = 0; [L5070] int completeFnIntCounter = 0; [L5071] int completeFnBulkCounter = 0; [L5072] void (*completeFnInt)(struct urb * ) ; [L5073] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4865] struct usb_device_id *ldvarg0 ; [L4866] void *tmp ; [L4867] int tmp___0 ; [L4868] int tmp___1 ; [L4869] int tmp___2 ; [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] tmp = ldv_zalloc(32UL) [L4872] ldvarg0 = (struct usb_device_id *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4874] ldv_state_variable_1 = 0 [L4875] ref_cnt = 0 [L4876] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: [L4922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4923] COND TRUE ldv_state_variable_0 == 1 [L4837] int tmp ; [L5036] ldv_func_ret_type ldv_func_res ; [L5037] int tmp ; [L5370] return __VERIFIER_nondet_int(); [L5039] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5040] ldv_func_res = tmp [L5041] ldv_state_variable_1 = 1 [L5042] usb_counter = 0 [L4856] void *tmp ; [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] tmp = ldv_zalloc(1520UL) [L4859] gtco_driverinfo_table_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5044] return (ldv_func_res); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4839] tmp = ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4840] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4924] ldv_retval_1 = gtco_driverinfo_table_init() [L4925] COND TRUE ldv_retval_1 == 0 [L4926] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4929] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4881] COND TRUE ldv_state_variable_1 != 0 [L4882] tmp___1 = __VERIFIER_nondet_int() [L4884] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4885] COND TRUE ldv_state_variable_1 == 1 [L4569] struct gtco *gtco ; [L4570] struct input_dev *input_dev ; [L4571] struct hid_descriptor *hid_desc ; [L4572] char *report ; [L4573] int result ; [L4574] int retry ; [L4575] int error ; [L4576] struct usb_endpoint_descriptor *endpoint ; [L4577] void *tmp ; [L4578] struct usb_device *tmp___0 ; [L4579] void *tmp___1 ; [L4580] struct _ddebug descriptor ; [L4581] long tmp___2 ; [L4582] struct _ddebug descriptor___0 ; [L4583] long tmp___3 ; [L4584] struct _ddebug descriptor___1 ; [L4585] long tmp___4 ; [L4586] struct _ddebug descriptor___2 ; [L4587] long tmp___5 ; [L4588] struct _ddebug descriptor___3 ; [L4589] long tmp___6 ; [L4590] int tmp___7 ; [L4591] struct _ddebug descriptor___4 ; [L4592] long tmp___8 ; [L4593] int tmp___9 ; [L4594] struct _ddebug descriptor___5 ; [L4595] long tmp___10 ; [L4596] void *tmp___11 ; [L4597] unsigned int tmp___12 ; [L4598] struct _ddebug descriptor___6 ; [L4599] long tmp___13 ; [L4600] unsigned int tmp___14 ; [L4602] result = 0 [L3667] void *tmp ; [L3658] void *tmp___2 ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4603] tmp = kzalloc(152UL, 208U) [L4604] gtco = (struct gtco *)tmp [L3667] void *tmp ; [L3658] void *tmp___2 ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L4605] input_dev = input_allocate_device() [L4606] COND FALSE !((unsigned long )gtco == (unsigned long )((struct gtco *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L4612] gtco->inputdevice = input_dev [L4956] struct usb_device *tmp ; [L5177] void *result ; [L5178] void *tmp ; [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] tmp = ldv_malloc(sizeof(struct usb_device)) [L5181] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5182] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5186] return (result); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4958] tmp = ldv_interface_to_usbdev() [L4959] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4613] tmp___0 = interface_to_usbdev(usbinterface) [L4980] struct usb_device *tmp ; [L5191] int tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5193] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)0) [L3717] int tmp ; [L3719] tmp = __VERIFIER_nondet_int() [L3720] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] tmp = ldv_undef_int() [L5195] COND TRUE \read(tmp) [L5196] dev_counter = dev_counter + 1 [L5197] usb_dev = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5205] return (usb_dev); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4982] tmp = ldv_get_dev(ldv_func_arg1) [L4983] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4614] gtco->usbdev = ldv_usb_get_dev_4(tmp___0) [L4615] gtco->intf = usbinterface [L4616] EXPR gtco->usbdev [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND TRUE tmp___0 != 0 [L3689] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] return ldv_malloc(0UL); [L4616] tmp___1 = usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4617] gtco->buffer = (unsigned char *)tmp___1 [L4618] EXPR gtco->buffer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4618] COND TRUE (unsigned long )gtco->buffer == (unsigned long )((unsigned char *)0U) [L4620] error = -12 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4886] ldv_retval_0 = gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4887] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4915] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5051] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4917] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5283] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5287] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3735] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4103:4106}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={144:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={168:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 3735]: 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: 3735]: 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: 3735]: 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: 3735]: 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, 388 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 74592.03ms, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 36.90ms, AutomataDifference: 69322.51ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.43ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 9445 SdHoareTripleChecker+Valid, 66944.96ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9445 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 61378.67ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10692 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18294 IncrementalHoareTripleChecker+Invalid, 18356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 4 mSDtfsCounter, 18294 mSolverCounterSat, 119.35ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 814.96ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3025occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 778.04ms AutomataMinimizationTime, 11 MinimizatonAttempts, 13289 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 111.50ms SsaConstructionTime, 1814.88ms SatisfiabilityAnalysisTime, 1299.53ms InterpolantComputationTime, 506 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 29/29 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 17:45:15,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.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 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 17:45:17,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 17:45:17,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 17:45:17,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 17:45:17,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 17:45:17,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 17:45:17,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 17:45:17,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 17:45:17,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 17:45:17,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 17:45:17,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 17:45:17,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 17:45:17,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 17:45:17,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 17:45:17,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 17:45:17,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 17:45:17,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 17:45:17,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 17:45:17,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 17:45:17,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 17:45:17,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 17:45:17,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 17:45:17,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 17:45:17,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 17:45:17,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 17:45:17,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 17:45:17,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 17:45:17,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 17:45:17,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 17:45:17,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 17:45:17,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 17:45:17,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 17:45:17,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 17:45:17,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 17:45:17,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 17:45:17,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 17:45:17,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 17:45:17,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 17:45:17,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 17:45:17,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 17:45:17,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 17:45:17,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 17:45:17,357 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 17:45:17,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 17:45:17,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 17:45:17,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 17:45:17,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 17:45:17,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 17:45:17,360 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 17:45:17,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 17:45:17,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 17:45:17,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 17:45:17,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 17:45:17,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 17:45:17,361 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 17:45:17,361 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 17:45:17,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 17:45:17,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 17:45:17,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 17:45:17,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 17:45:17,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 17:45:17,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 17:45:17,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 17:45:17,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 17:45:17,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 17:45:17,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 17:45:17,363 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 17:45:17,363 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 17:45:17,363 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 17:45:17,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 17:45:17,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 17:45:17,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 17:45:17,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 17:45:17,364 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 -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-02 17:45:17,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 17:45:17,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 17:45:17,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 17:45:17,665 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 17:45:17,667 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 17:45:17,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:45:17,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb5ca8b/aa2f1e32c82e427c82ad6bd2cac35505/FLAGb572dad17 [2021-11-02 17:45:18,247 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 17:45:18,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:45:18,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb5ca8b/aa2f1e32c82e427c82ad6bd2cac35505/FLAGb572dad17 [2021-11-02 17:45:18,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb5ca8b/aa2f1e32c82e427c82ad6bd2cac35505 [2021-11-02 17:45:18,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 17:45:18,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 17:45:18,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 17:45:18,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 17:45:18,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 17:45:18,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 05:45:18" (1/1) ... [2021-11-02 17:45:18,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eac709d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:18, skipping insertion in model container [2021-11-02 17:45:18,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 05:45:18" (1/1) ... [2021-11-02 17:45:18,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 17:45:18,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 17:45:19,100 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-02 17:45:19,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 17:45:19,318 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 17:45:19,397 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-02 17:45:19,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 17:45:19,589 INFO L208 MainTranslator]: Completed translation [2021-11-02 17:45:19,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19 WrapperNode [2021-11-02 17:45:19,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 17:45:19,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 17:45:19,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 17:45:19,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 17:45:19,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 17:45:19,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 17:45:19,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 17:45:19,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 17:45:19,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 17:45:19,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 17:45:19,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 17:45:19,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 17:45:19,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (1/1) ... [2021-11-02 17:45:19,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 17:45:19,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 17:45:19,948 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 17:45:19,998 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 17:45:20,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 17:45:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 17:45:20,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 17:45:20,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 17:45:20,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 17:45:20,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-02 17:45:20,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 17:45:20,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 17:45:20,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 17:45:24,334 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 17:45:24,335 INFO L299 CfgBuilder]: Removed 310 assume(true) statements. [2021-11-02 17:45:24,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 05:45:24 BoogieIcfgContainer [2021-11-02 17:45:24,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 17:45:24,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 17:45:24,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 17:45:24,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 17:45:24,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 05:45:18" (1/3) ... [2021-11-02 17:45:24,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245e0796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 05:45:24, skipping insertion in model container [2021-11-02 17:45:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 05:45:19" (2/3) ... [2021-11-02 17:45:24,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245e0796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 05:45:24, skipping insertion in model container [2021-11-02 17:45:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 05:45:24" (3/3) ... [2021-11-02 17:45:24,341 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-02 17:45:24,344 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 17:45:24,344 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 17:45:24,372 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 17:45:24,375 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 17:45:24,375 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 17:45:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 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 17:45:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 17:45:24,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:45:24,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:45:24,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:45:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:45:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1148713798, now seen corresponding path program 1 times [2021-11-02 17:45:24,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:45:24,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266400639] [2021-11-02 17:45:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:45:24,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:45:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:45:24,409 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 17:45:24,434 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 17:45:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:45:26,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:45:26,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:45:26,211 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 17:45:26,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:45:26,258 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 17:45:26,259 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:45:26,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266400639] [2021-11-02 17:45:26,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266400639] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:45:26,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:45:26,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 17:45:26,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722446597] [2021-11-02 17:45:26,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 17:45:26,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:45:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 17:45:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:45:26,281 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 387 states have internal predecessors, (574), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 17:45:28,461 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:45:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:45:46,086 INFO L93 Difference]: Finished difference Result 1468 states and 2191 transitions. [2021-11-02 17:45:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 17:45:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 15 [2021-11-02 17:45:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:45:46,103 INFO L225 Difference]: With dead ends: 1468 [2021-11-02 17:45:46,103 INFO L226 Difference]: Without dead ends: 1069 [2021-11-02 17:45:46,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.81ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:45:46,115 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 1004 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18035.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.29ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19554.97ms IncrementalHoareTripleChecker+Time [2021-11-02 17:45:46,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 16 Invalid, 2053 Unknown, 0 Unchecked, 23.29ms Time], IncrementalHoareTripleChecker [6 Valid, 2046 Invalid, 1 Unknown, 0 Unchecked, 19554.97ms Time] [2021-11-02 17:45:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-11-02 17:45:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2021-11-02 17:45:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1064 states have (on average 1.4078947368421053) internal successors, (1498), 1068 states have internal predecessors, (1498), 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 17:45:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1498 transitions. [2021-11-02 17:45:46,217 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1498 transitions. Word has length 15 [2021-11-02 17:45:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:45:46,217 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1498 transitions. [2021-11-02 17:45:46,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 17:45:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1498 transitions. [2021-11-02 17:45:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-02 17:45:46,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:45:46,219 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] [2021-11-02 17:45:46,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-02 17:45:46,439 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 17:45:46,440 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:45:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:45:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1888760138, now seen corresponding path program 1 times [2021-11-02 17:45:46,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:45:46,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171493781] [2021-11-02 17:45:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:45:46,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:45:46,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:45:46,445 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 17:45:46,447 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 17:45:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:45:48,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:45:48,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:45:48,248 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 17:45:48,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:45:48,282 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 17:45:48,283 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:45:48,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171493781] [2021-11-02 17:45:48,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171493781] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:45:48,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:45:48,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-02 17:45:48,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594644531] [2021-11-02 17:45:48,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:45:48,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:45:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:45:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:45:48,285 INFO L87 Difference]: Start difference. First operand 1069 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 17:45:50,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:46:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:46:04,361 INFO L93 Difference]: Finished difference Result 1452 states and 2020 transitions. [2021-11-02 17:46:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:46:04,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-11-02 17:46:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:46:04,367 INFO L225 Difference]: With dead ends: 1452 [2021-11-02 17:46:04,367 INFO L226 Difference]: Without dead ends: 1437 [2021-11-02 17:46:04,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.79ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:46:04,368 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 513 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14705.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15908.97ms IncrementalHoareTripleChecker+Time [2021-11-02 17:46:04,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 0 Invalid, 1554 Unknown, 0 Unchecked, 10.08ms Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 1 Unknown, 0 Unchecked, 15908.97ms Time] [2021-11-02 17:46:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2021-11-02 17:46:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1069. [2021-11-02 17:46:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1064 states have (on average 1.406954887218045) internal successors, (1497), 1068 states have internal predecessors, (1497), 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 17:46:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1497 transitions. [2021-11-02 17:46:04,399 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1497 transitions. Word has length 22 [2021-11-02 17:46:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:46:04,399 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1497 transitions. [2021-11-02 17:46:04,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 17:46:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1497 transitions. [2021-11-02 17:46:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-02 17:46:04,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:46:04,401 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] [2021-11-02 17:46:04,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-02 17:46:04,603 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 17:46:04,603 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:46:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:46:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1888700556, now seen corresponding path program 1 times [2021-11-02 17:46:04,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:46:04,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729941896] [2021-11-02 17:46:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:46:04,606 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:46:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:46:04,616 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 17:46:04,617 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 17:46:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:46:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 17:46:06,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:46:06,820 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 17:46:06,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:46:07,011 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 17:46:07,012 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:46:07,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729941896] [2021-11-02 17:46:07,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729941896] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:46:07,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:46:07,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-02 17:46:07,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475720623] [2021-11-02 17:46:07,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 17:46:07,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:46:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 17:46:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:46:07,014 INFO L87 Difference]: Start difference. First operand 1069 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 17:46:09,162 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:46:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:46:20,826 INFO L93 Difference]: Finished difference Result 3189 states and 4472 transitions. [2021-11-02 17:46:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 17:46:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 22 [2021-11-02 17:46:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:46:20,834 INFO L225 Difference]: With dead ends: 3189 [2021-11-02 17:46:20,834 INFO L226 Difference]: Without dead ends: 2128 [2021-11-02 17:46:20,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.11ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:46:20,840 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1013 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12540.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.02ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13659.86ms IncrementalHoareTripleChecker+Time [2021-11-02 17:46:20,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 0 Invalid, 1048 Unknown, 0 Unchecked, 13.02ms Time], IncrementalHoareTripleChecker [7 Valid, 1040 Invalid, 1 Unknown, 0 Unchecked, 13659.86ms Time] [2021-11-02 17:46:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2021-11-02 17:46:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2116. [2021-11-02 17:46:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2111 states have (on average 1.4050213169114163) internal successors, (2966), 2115 states have internal predecessors, (2966), 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 17:46:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2966 transitions. [2021-11-02 17:46:20,888 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2966 transitions. Word has length 22 [2021-11-02 17:46:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:46:20,889 INFO L470 AbstractCegarLoop]: Abstraction has 2116 states and 2966 transitions. [2021-11-02 17:46:20,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 17:46:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2966 transitions. [2021-11-02 17:46:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 17:46:20,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:46:20,893 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] [2021-11-02 17:46:20,916 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 17:46:21,106 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 17:46:21,106 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:46:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:46:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1579824603, now seen corresponding path program 1 times [2021-11-02 17:46:21,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:46:21,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490646898] [2021-11-02 17:46:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:46:21,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:46:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:46:21,110 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 17:46:21,111 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 17:46:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:46:22,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 17:46:22,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:46:23,045 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 17:46:23,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:46:23,236 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 17:46:23,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:46:23,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490646898] [2021-11-02 17:46:23,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490646898] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:46:23,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:46:23,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-02 17:46:23,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607374026] [2021-11-02 17:46:23,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 17:46:23,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:46:23,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 17:46:23,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:46:23,238 INFO L87 Difference]: Start difference. First operand 2116 states and 2966 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 17:46:25,374 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:46:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:46:52,411 INFO L93 Difference]: Finished difference Result 8403 states and 11785 transitions. [2021-11-02 17:46:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 17:46:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 23 [2021-11-02 17:46:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:46:52,430 INFO L225 Difference]: With dead ends: 8403 [2021-11-02 17:46:52,430 INFO L226 Difference]: Without dead ends: 6295 [2021-11-02 17:46:52,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.57ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 17:46:52,440 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 992 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26657.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.85ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28894.95ms IncrementalHoareTripleChecker+Time [2021-11-02 17:46:52,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [992 Valid, 0 Invalid, 2459 Unknown, 0 Unchecked, 13.85ms Time], IncrementalHoareTripleChecker [4 Valid, 2454 Invalid, 1 Unknown, 0 Unchecked, 28894.95ms Time] [2021-11-02 17:46:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2021-11-02 17:46:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 4193. [2021-11-02 17:46:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4193 states, 4188 states have (on average 1.4030563514804202) internal successors, (5876), 4192 states have internal predecessors, (5876), 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 17:46:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 5876 transitions. [2021-11-02 17:46:52,538 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 5876 transitions. Word has length 23 [2021-11-02 17:46:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:46:52,539 INFO L470 AbstractCegarLoop]: Abstraction has 4193 states and 5876 transitions. [2021-11-02 17:46:52,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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 17:46:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 5876 transitions. [2021-11-02 17:46:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 17:46:52,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:46:52,543 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] [2021-11-02 17:46:52,571 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 17:46:52,759 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 17:46:52,760 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:46:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:46:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1729922142, now seen corresponding path program 1 times [2021-11-02 17:46:52,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:46:52,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324903809] [2021-11-02 17:46:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:46:52,762 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:46:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:46:52,766 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 17:46:52,767 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 17:46:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:46:54,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:46:54,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:46:54,710 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 17:46:54,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:46:54,858 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 17:46:54,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:46:54,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324903809] [2021-11-02 17:46:54,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324903809] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:46:54,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:46:54,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 17:46:54,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574913571] [2021-11-02 17:46:54,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:46:54,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:46:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:46:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:46:54,860 INFO L87 Difference]: Start difference. First operand 4193 states and 5876 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 17:46:57,037 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:03,009 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 17:47:04,398 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:05,733 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 17:47:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:47:16,295 INFO L93 Difference]: Finished difference Result 6287 states and 8808 transitions. [2021-11-02 17:47:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:47:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2021-11-02 17:47:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:47:16,314 INFO L225 Difference]: With dead ends: 6287 [2021-11-02 17:47:16,315 INFO L226 Difference]: Without dead ends: 6285 [2021-11-02 17:47:16,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.07ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:16,318 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 496 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19776.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.20ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21232.79ms IncrementalHoareTripleChecker+Time [2021-11-02 17:47:16,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 0 Invalid, 1444 Unknown, 0 Unchecked, 7.20ms Time], IncrementalHoareTripleChecker [1 Valid, 1442 Invalid, 1 Unknown, 0 Unchecked, 21232.79ms Time] [2021-11-02 17:47:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2021-11-02 17:47:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6283. [2021-11-02 17:47:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6283 states, 6278 states have (on average 1.4025167250716788) internal successors, (8805), 6282 states have internal predecessors, (8805), 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 17:47:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6283 states to 6283 states and 8805 transitions. [2021-11-02 17:47:16,477 INFO L78 Accepts]: Start accepts. Automaton has 6283 states and 8805 transitions. Word has length 24 [2021-11-02 17:47:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:47:16,478 INFO L470 AbstractCegarLoop]: Abstraction has 6283 states and 8805 transitions. [2021-11-02 17:47:16,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 17:47:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6283 states and 8805 transitions. [2021-11-02 17:47:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 17:47:16,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:47:16,479 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] [2021-11-02 17:47:16,504 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 17:47:16,704 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 17:47:16,704 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:47:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:47:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2087978565, now seen corresponding path program 1 times [2021-11-02 17:47:16,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:47:16,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118576873] [2021-11-02 17:47:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:47:16,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:47:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:47:16,709 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 17:47:16,710 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 17:47:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:47:18,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:47:18,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:47:18,566 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 17:47:18,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:47:18,679 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 17:47:18,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:47:18,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118576873] [2021-11-02 17:47:18,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118576873] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:47:18,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:47:18,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 17:47:18,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982978847] [2021-11-02 17:47:18,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:47:18,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:47:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:47:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:18,682 INFO L87 Difference]: Start difference. First operand 6283 states and 8805 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 17:47:20,825 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:47:26,453 INFO L93 Difference]: Finished difference Result 6283 states and 8805 transitions. [2021-11-02 17:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:47:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2021-11-02 17:47:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:47:26,469 INFO L225 Difference]: With dead ends: 6283 [2021-11-02 17:47:26,469 INFO L226 Difference]: Without dead ends: 6281 [2021-11-02 17:47:26,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:26,471 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7092.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7616.97ms IncrementalHoareTripleChecker+Time [2021-11-02 17:47:26,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 1.53ms Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 1 Unknown, 0 Unchecked, 7616.97ms Time] [2021-11-02 17:47:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2021-11-02 17:47:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6281. [2021-11-02 17:47:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6281 states, 6277 states have (on average 1.4024215389517285) internal successors, (8803), 6280 states have internal predecessors, (8803), 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 17:47:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8803 transitions. [2021-11-02 17:47:26,667 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8803 transitions. Word has length 25 [2021-11-02 17:47:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:47:26,668 INFO L470 AbstractCegarLoop]: Abstraction has 6281 states and 8803 transitions. [2021-11-02 17:47:26,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 17:47:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8803 transitions. [2021-11-02 17:47:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 17:47:26,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:47:26,669 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] [2021-11-02 17:47:26,692 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 17:47:26,888 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 17:47:26,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:47:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:47:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash 302825800, now seen corresponding path program 1 times [2021-11-02 17:47:26,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:47:26,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709524567] [2021-11-02 17:47:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:47:26,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:47:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:47:26,893 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 17:47:26,894 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 17:47:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:47:28,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:47:28,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:47:28,681 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 17:47:28,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:47:28,805 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 17:47:28,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:47:28,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709524567] [2021-11-02 17:47:28,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709524567] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:47:28,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:47:28,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 17:47:28,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474835500] [2021-11-02 17:47:28,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:47:28,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:47:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:47:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:28,807 INFO L87 Difference]: Start difference. First operand 6281 states and 8803 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 17:47:30,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:34,009 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:47:37,605 INFO L93 Difference]: Finished difference Result 6281 states and 8803 transitions. [2021-11-02 17:47:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:47:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2021-11-02 17:47:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:47:37,631 INFO L225 Difference]: With dead ends: 6281 [2021-11-02 17:47:37,631 INFO L226 Difference]: Without dead ends: 6272 [2021-11-02 17:47:37,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.76ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:37,634 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 498 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8102.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8664.10ms IncrementalHoareTripleChecker+Time [2021-11-02 17:47:37,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 0.76ms Time], IncrementalHoareTripleChecker [0 Valid, 521 Invalid, 1 Unknown, 0 Unchecked, 8664.10ms Time] [2021-11-02 17:47:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2021-11-02 17:47:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 6272. [2021-11-02 17:47:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6269 states have (on average 1.4022970170681128) internal successors, (8791), 6271 states have internal predecessors, (8791), 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 17:47:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 8791 transitions. [2021-11-02 17:47:37,856 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 8791 transitions. Word has length 26 [2021-11-02 17:47:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:47:37,856 INFO L470 AbstractCegarLoop]: Abstraction has 6272 states and 8791 transitions. [2021-11-02 17:47:37,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 17:47:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 8791 transitions. [2021-11-02 17:47:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 17:47:37,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:47:37,860 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 17:47:37,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 17:47:38,075 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 17:47:38,076 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:47:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:47:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -67576925, now seen corresponding path program 1 times [2021-11-02 17:47:38,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:47:38,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337624858] [2021-11-02 17:47:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:47:38,078 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:47:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:47:38,079 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 17:47:38,081 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 17:47:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:47:39,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 17:47:39,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:47:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 17:47:40,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:47:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 17:47:40,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:47:40,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337624858] [2021-11-02 17:47:40,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337624858] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:47:40,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:47:40,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-02 17:47:40,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535527557] [2021-11-02 17:47:40,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 17:47:40,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:47:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 17:47:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:40,231 INFO L87 Difference]: Start difference. First operand 6272 states and 8791 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 17:47:42,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:47,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:47:51,056 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 17:47:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:47:55,428 INFO L93 Difference]: Finished difference Result 12795 states and 17951 transitions. [2021-11-02 17:47:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 17:47:55,429 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 17:47:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:47:55,437 INFO L225 Difference]: With dead ends: 12795 [2021-11-02 17:47:55,437 INFO L226 Difference]: Without dead ends: 6531 [2021-11-02 17:47:55,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.96ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 17:47:55,443 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14116.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.19ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14987.05ms IncrementalHoareTripleChecker+Time [2021-11-02 17:47:55,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 1040 Unknown, 0 Unchecked, 4.19ms Time], IncrementalHoareTripleChecker [2 Valid, 1036 Invalid, 2 Unknown, 0 Unchecked, 14987.05ms Time] [2021-11-02 17:47:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2021-11-02 17:47:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 6487. [2021-11-02 17:47:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6487 states, 6484 states have (on average 1.4036088834053053) internal successors, (9101), 6486 states have internal predecessors, (9101), 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 17:47:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6487 states to 6487 states and 9101 transitions. [2021-11-02 17:47:55,583 INFO L78 Accepts]: Start accepts. Automaton has 6487 states and 9101 transitions. Word has length 61 [2021-11-02 17:47:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:47:55,583 INFO L470 AbstractCegarLoop]: Abstraction has 6487 states and 9101 transitions. [2021-11-02 17:47:55,583 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 17:47:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6487 states and 9101 transitions. [2021-11-02 17:47:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 17:47:55,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:47:55,586 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:47:55,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-02 17:47:55,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 17:47:55,810 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:47:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:47:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1531221519, now seen corresponding path program 1 times [2021-11-02 17:47:55,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:47:55,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315631002] [2021-11-02 17:47:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:47:55,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:47:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:47:55,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 17:47:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 17:47:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:47:57,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 17:47:57,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:47:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:47:58,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:47:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:47:58,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:47:58,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315631002] [2021-11-02 17:47:58,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315631002] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:47:58,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:47:58,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-02 17:47:58,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675195614] [2021-11-02 17:47:58,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 17:47:58,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:47:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 17:47:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-02 17:47:58,863 INFO L87 Difference]: Start difference. First operand 6487 states and 9101 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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 17:48:01,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:25,142 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 17:48:26,476 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:27,613 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 17:48:29,216 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:31,290 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 17:48:32,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:33,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:34,784 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:48:35,961 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 17:48:43,403 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 17:49:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:49:08,818 INFO L93 Difference]: Finished difference Result 25717 states and 35555 transitions. [2021-11-02 17:49:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 17:49:08,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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 69 [2021-11-02 17:49:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:49:08,851 INFO L225 Difference]: With dead ends: 25717 [2021-11-02 17:49:08,852 INFO L226 Difference]: Without dead ends: 19238 [2021-11-02 17:49:08,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1009.32ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-11-02 17:49:08,862 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3686 mSDsluCounter, 5446 mSDsCounter, 0 mSdLazyCounter, 6240 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63281.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 68.34ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6240 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68545.32ms IncrementalHoareTripleChecker+Time [2021-11-02 17:49:08,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3686 Valid, 0 Invalid, 6272 Unknown, 0 Unchecked, 68.34ms Time], IncrementalHoareTripleChecker [31 Valid, 6240 Invalid, 1 Unknown, 0 Unchecked, 68545.32ms Time] [2021-11-02 17:49:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19238 states. [2021-11-02 17:49:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19238 to 6721. [2021-11-02 17:49:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.392229830306639) internal successors, (9353), 6720 states have internal predecessors, (9353), 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 17:49:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9353 transitions. [2021-11-02 17:49:09,209 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9353 transitions. Word has length 69 [2021-11-02 17:49:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:49:09,211 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9353 transitions. [2021-11-02 17:49:09,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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 17:49:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9353 transitions. [2021-11-02 17:49:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-02 17:49:09,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:49:09,215 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:49:09,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-02 17:49:09,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 17:49:09,426 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:49:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:49:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash 605807179, now seen corresponding path program 1 times [2021-11-02 17:49:09,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:49:09,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633743536] [2021-11-02 17:49:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:49:09,429 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:49:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:49:09,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 17:49:09,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 17:49:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:49:11,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 17:49:11,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:49:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:49:11,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:49:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:49:12,416 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:49:12,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633743536] [2021-11-02 17:49:12,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633743536] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:49:12,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:49:12,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-11-02 17:49:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22954890] [2021-11-02 17:49:12,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 17:49:12,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:49:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 17:49:12,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-02 17:49:12,417 INFO L87 Difference]: Start difference. First operand 6721 states and 9353 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 17:49:14,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:50:14,746 INFO L93 Difference]: Finished difference Result 23384 states and 32304 transitions. [2021-11-02 17:50:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 17:50:14,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 71 [2021-11-02 17:50:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:50:14,769 INFO L225 Difference]: With dead ends: 23384 [2021-11-02 17:50:14,770 INFO L226 Difference]: Without dead ends: 16671 [2021-11-02 17:50:14,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1187.74ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-11-02 17:50:14,779 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4210 mSDsluCounter, 5392 mSDsCounter, 0 mSdLazyCounter, 6205 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55859.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.19ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60815.83ms IncrementalHoareTripleChecker+Time [2021-11-02 17:50:14,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4210 Valid, 0 Invalid, 6225 Unknown, 0 Unchecked, 49.19ms Time], IncrementalHoareTripleChecker [19 Valid, 6205 Invalid, 1 Unknown, 0 Unchecked, 60815.83ms Time] [2021-11-02 17:50:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16671 states. [2021-11-02 17:50:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16671 to 6721. [2021-11-02 17:50:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.392229830306639) internal successors, (9353), 6720 states have internal predecessors, (9353), 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 17:50:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9353 transitions. [2021-11-02 17:50:15,253 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9353 transitions. Word has length 71 [2021-11-02 17:50:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:50:15,254 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9353 transitions. [2021-11-02 17:50:15,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 17:50:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9353 transitions. [2021-11-02 17:50:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-02 17:50:15,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:50:15,255 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:50:15,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-02 17:50:15,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 17:50:15,456 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:50:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:50:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash 449215055, now seen corresponding path program 1 times [2021-11-02 17:50:15,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:50:15,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700484174] [2021-11-02 17:50:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:50:15,459 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:50:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:50:15,460 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 17:50:15,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-02 17:50:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 17:50:17,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 17:50:17,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 17:50:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:50:17,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 17:50:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 17:50:17,989 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 17:50:17,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700484174] [2021-11-02 17:50:17,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700484174] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 17:50:17,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 17:50:17,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 17:50:17,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018727185] [2021-11-02 17:50:17,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 17:50:17,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 17:50:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 17:50:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 17:50:17,990 INFO L87 Difference]: Start difference. First operand 6721 states and 9353 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 17:50:20,137 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:29,824 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 17:50:31,275 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:32,787 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:34,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:37,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 17:50:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 17:50:50,069 INFO L93 Difference]: Finished difference Result 19307 states and 27015 transitions. [2021-11-02 17:50:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 17:50:50,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 73 [2021-11-02 17:50:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 17:50:50,092 INFO L225 Difference]: With dead ends: 19307 [2021-11-02 17:50:50,092 INFO L226 Difference]: Without dead ends: 12558 [2021-11-02 17:50:50,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 133.93ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 17:50:50,101 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 926 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29088.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.70ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31310.26ms IncrementalHoareTripleChecker+Time [2021-11-02 17:50:50,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [926 Valid, 0 Invalid, 2245 Unknown, 0 Unchecked, 15.70ms Time], IncrementalHoareTripleChecker [12 Valid, 2232 Invalid, 1 Unknown, 0 Unchecked, 31310.26ms Time] [2021-11-02 17:50:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12558 states. [2021-11-02 17:50:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12558 to 6721. [2021-11-02 17:50:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6718 states have (on average 1.3895504614468592) internal successors, (9335), 6720 states have internal predecessors, (9335), 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 17:50:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 9335 transitions. [2021-11-02 17:50:50,510 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 9335 transitions. Word has length 73 [2021-11-02 17:50:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 17:50:50,510 INFO L470 AbstractCegarLoop]: Abstraction has 6721 states and 9335 transitions. [2021-11-02 17:50:50,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 17:50:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 9335 transitions. [2021-11-02 17:50:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 17:50:50,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 17:50:50,512 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 17:50:50,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-02 17:50:50,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 17:50:50,741 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 17:50:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 17:50:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash 77040683, now seen corresponding path program 1 times [2021-11-02 17:50:50,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 17:50:50,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363136638] [2021-11-02 17:50:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 17:50:50,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 17:50:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 17:50:50,744 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 17:50:50,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process Killed by 15