./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.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 3d776a54fbebbd358d59ab0126298feae1e40360b6fb5e6158cd54ba5ef877f7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:40:25,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:40:25,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:40:25,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:40:25,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:40:25,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:40:25,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:40:25,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:40:25,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:40:25,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:40:25,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:40:25,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:40:25,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:40:25,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:40:25,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:40:25,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:40:25,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:40:25,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:40:25,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:40:25,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:40:25,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:40:25,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:40:25,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:40:25,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:40:25,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:40:25,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:40:25,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:40:25,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:40:25,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:40:25,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:40:25,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:40:25,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:40:25,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:40:25,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:40:25,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:40:25,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:40:25,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:40:25,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:40:25,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:40:25,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:40:25,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:40:25,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 21:40:25,694 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:40:25,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:40:25,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:40:25,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:40:25,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:40:25,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:40:25,696 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:40:25,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:40:25,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 21:40:25,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:40:25,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:40:25,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:40:25,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:40:25,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:40:25,697 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:40:25,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:40:25,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:40:25,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:40:25,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:40:25,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:40:25,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:40:25,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:40:25,699 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:40:25,700 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 -> 3d776a54fbebbd358d59ab0126298feae1e40360b6fb5e6158cd54ba5ef877f7 [2021-11-22 21:40:25,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:40:25,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:40:25,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:40:25,936 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:40:25,936 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:40:25,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:40:25,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afb0dea5/cf6156595ea24bb18cdbb39046df81f5/FLAG1a717f52b [2021-11-22 21:40:26,597 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:40:26,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:40:26,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afb0dea5/cf6156595ea24bb18cdbb39046df81f5/FLAG1a717f52b [2021-11-22 21:40:26,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afb0dea5/cf6156595ea24bb18cdbb39046df81f5 [2021-11-22 21:40:26,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:40:26,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:40:26,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:40:26,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:40:26,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:40:26,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:26" (1/1) ... [2021-11-22 21:40:26,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9bc1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:26, skipping insertion in model container [2021-11-22 21:40:26,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:26" (1/1) ... [2021-11-22 21:40:26,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:40:26,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:40:29,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i[462796,462809] [2021-11-22 21:40:29,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:40:29,226 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:40:29,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i[462796,462809] [2021-11-22 21:40:29,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:40:29,594 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:40:29,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29 WrapperNode [2021-11-22 21:40:29,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:40:29,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:40:29,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:40:29,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:40:29,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:29,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:30,487 INFO L137 Inliner]: procedures = 445, calls = 3482, calls flagged for inlining = 994, calls inlined = 3567, statements flattened = 45637 [2021-11-22 21:40:30,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:40:30,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:40:30,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:40:30,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:40:30,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:30,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:30,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:30,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:31,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:31,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:31,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:31,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:40:31,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:40:31,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:40:31,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:40:31,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (1/1) ... [2021-11-22 21:40:31,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:40:31,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:40:32,005 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-22 21:40:32,010 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-22 21:40:32,048 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 21:40:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:40:32,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:40:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:40:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:40:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:40:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 21:40:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 21:40:33,011 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:40:33,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-3: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-1: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-7: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-5: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-11: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-9: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := (if __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 else __copy_from_user_~tmp___2~3#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-22 21:41:02,414 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3772: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3773: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1037: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1038: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-3: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-2: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-1: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-5: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-4: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-5: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,415 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-5: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-4: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-4: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-3: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-3: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-2: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-2: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-2: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-2: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-5: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-5: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-4: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,416 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-4: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-3: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-3: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-3: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-3: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-2: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-2: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-5: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-5: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-4: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-4: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10 == __copy_from_user_~size#1; [2021-11-22 21:41:02,417 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-4: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-4: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-3: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-3: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-2: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-2: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-5: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-5: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16 == __copy_from_user_~size#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-1: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-1: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,418 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,419 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,419 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-5: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,419 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-5: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,419 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-4: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,419 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-4: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,420 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-3: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,420 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-3: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,420 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-2: assume 0 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,421 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-2: assume !(0 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,421 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,422 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,426 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,427 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,427 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-5: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,427 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-5: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,427 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-4: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,428 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-4: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,428 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-3: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,428 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-3: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,429 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-2: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_~ret~1#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:41:02,429 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-2: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:41:02,429 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-2: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-2: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-1: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-1: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,430 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-5: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,431 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-5: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,431 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-4: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,431 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-4: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,432 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-3: assume 0 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,434 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-3: assume !(0 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,434 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-2: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,434 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-2: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,434 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,435 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-1: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,436 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,436 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,436 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-5: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,436 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-5: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,439 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-4: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-4: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-3: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := copy_user_generic_~ret~0#1 % 4294967296; [2021-11-22 21:41:02,440 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-3: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:41:02,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##462: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5982: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,441 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5983: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,442 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3198: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,442 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3197: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,443 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6558: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2 == __copy_from_user_~size#1; [2021-11-22 21:41:02,443 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6557: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:41:02,444 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-32: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,444 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-31: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,444 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-86: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-85: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-248: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,451 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-247: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-302: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-301: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-464: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-465: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-518: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret209#1 && __copy_from_user_#t~ret209#1 <= 9223372036854775807;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:41:02,452 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-519: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_#t~ret210#1 && __copy_from_user_#t~ret210#1 <= 9223372036854775807;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:41:02,453 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:41:02,496 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:41:02,496 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:41:02,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02 BoogieIcfgContainer [2021-11-22 21:41:02,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:41:02,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:41:02,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:41:02,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:41:02,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:40:26" (1/3) ... [2021-11-22 21:41:02,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f411ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:02, skipping insertion in model container [2021-11-22 21:41:02,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:29" (2/3) ... [2021-11-22 21:41:02,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f411ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:02, skipping insertion in model container [2021-11-22 21:41:02,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02" (3/3) ... [2021-11-22 21:41:02,512 INFO L111 eAbstractionObserver]: Analyzing ICFG main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:41:02,516 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:41:02,516 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 137 error locations. [2021-11-22 21:41:02,585 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:41:02,591 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-22 21:41:02,592 INFO L340 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2021-11-22 21:41:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 8513 states, 8375 states have (on average 1.3946268656716418) internal successors, (11680), 8512 states have internal predecessors, (11680), 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-22 21:41:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 21:41:02,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:02,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:02,697 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1496895859, now seen corresponding path program 1 times [2021-11-22 21:41:02,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:02,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850709031] [2021-11-22 21:41:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:02,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:03,079 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-22 21:41:03,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850709031] [2021-11-22 21:41:03,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850709031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:03,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:03,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:03,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863288605] [2021-11-22 21:41:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:03,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:03,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:03,136 INFO L87 Difference]: Start difference. First operand has 8513 states, 8375 states have (on average 1.3946268656716418) internal successors, (11680), 8512 states have internal predecessors, (11680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:03,442 INFO L93 Difference]: Finished difference Result 16855 states and 23174 transitions. [2021-11-22 21:41:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-22 21:41:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:03,485 INFO L225 Difference]: With dead ends: 16855 [2021-11-22 21:41:03,485 INFO L226 Difference]: Without dead ends: 8300 [2021-11-22 21:41:03,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:03,505 INFO L933 BasicCegarLoop]: 11358 mSDtfsCounter, 11350 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11350 SdHoareTripleChecker+Valid, 11358 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:03,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11350 Valid, 11358 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2021-11-22 21:41:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 8300. [2021-11-22 21:41:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8300 states, 8164 states have (on average 1.3737138657520822) internal successors, (11215), 8299 states have internal predecessors, (11215), 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-22 21:41:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8300 states to 8300 states and 11215 transitions. [2021-11-22 21:41:03,707 INFO L78 Accepts]: Start accepts. Automaton has 8300 states and 11215 transitions. Word has length 11 [2021-11-22 21:41:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:03,707 INFO L470 AbstractCegarLoop]: Abstraction has 8300 states and 11215 transitions. [2021-11-22 21:41:03,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8300 states and 11215 transitions. [2021-11-22 21:41:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 21:41:03,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:03,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:03,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 21:41:03,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 840893923, now seen corresponding path program 1 times [2021-11-22 21:41:03,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:03,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358409474] [2021-11-22 21:41:03,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:03,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:03,810 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-22 21:41:03,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358409474] [2021-11-22 21:41:03,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358409474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:03,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:03,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:03,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014485500] [2021-11-22 21:41:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:03,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:03,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:03,816 INFO L87 Difference]: Start difference. First operand 8300 states and 11215 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-22 21:41:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:04,118 INFO L93 Difference]: Finished difference Result 8300 states and 11215 transitions. [2021-11-22 21:41:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-11-22 21:41:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:04,145 INFO L225 Difference]: With dead ends: 8300 [2021-11-22 21:41:04,145 INFO L226 Difference]: Without dead ends: 8298 [2021-11-22 21:41:04,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:04,149 INFO L933 BasicCegarLoop]: 11212 mSDtfsCounter, 11203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11203 SdHoareTripleChecker+Valid, 11212 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:04,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11203 Valid, 11212 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2021-11-22 21:41:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 8298. [2021-11-22 21:41:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8298 states, 8163 states have (on average 1.3736371432071541) internal successors, (11213), 8297 states have internal predecessors, (11213), 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-22 21:41:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8298 states to 8298 states and 11213 transitions. [2021-11-22 21:41:04,383 INFO L78 Accepts]: Start accepts. Automaton has 8298 states and 11213 transitions. Word has length 12 [2021-11-22 21:41:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:04,383 INFO L470 AbstractCegarLoop]: Abstraction has 8298 states and 11213 transitions. [2021-11-22 21:41:04,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-22 21:41:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 8298 states and 11213 transitions. [2021-11-22 21:41:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:41:04,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:04,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:04,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 21:41:04,385 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr133ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 297933144, now seen corresponding path program 1 times [2021-11-22 21:41:04,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:04,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984015657] [2021-11-22 21:41:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:04,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:41:04,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984015657] [2021-11-22 21:41:04,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984015657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:04,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:04,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:04,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425603138] [2021-11-22 21:41:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:04,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:04,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:04,484 INFO L87 Difference]: Start difference. First operand 8298 states and 11213 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-22 21:41:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:04,660 INFO L93 Difference]: Finished difference Result 8298 states and 11213 transitions. [2021-11-22 21:41:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-11-22 21:41:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:04,683 INFO L225 Difference]: With dead ends: 8298 [2021-11-22 21:41:04,683 INFO L226 Difference]: Without dead ends: 8296 [2021-11-22 21:41:04,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:04,688 INFO L933 BasicCegarLoop]: 11210 mSDtfsCounter, 11200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11200 SdHoareTripleChecker+Valid, 11210 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:04,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11200 Valid, 11210 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2021-11-22 21:41:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 8296. [2021-11-22 21:41:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8296 states, 8162 states have (on average 1.3735604018622887) internal successors, (11211), 8295 states have internal predecessors, (11211), 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-22 21:41:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 11211 transitions. [2021-11-22 21:41:04,877 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 11211 transitions. Word has length 13 [2021-11-22 21:41:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:04,878 INFO L470 AbstractCegarLoop]: Abstraction has 8296 states and 11211 transitions. [2021-11-22 21:41:04,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-22 21:41:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 11211 transitions. [2021-11-22 21:41:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:41:04,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:04,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:04,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 21:41:04,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr134ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 646018190, now seen corresponding path program 1 times [2021-11-22 21:41:04,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:04,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508886356] [2021-11-22 21:41:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:04,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:04,959 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-22 21:41:04,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:04,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508886356] [2021-11-22 21:41:04,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508886356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:04,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:04,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:04,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316298517] [2021-11-22 21:41:04,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:04,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:04,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:04,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:04,962 INFO L87 Difference]: Start difference. First operand 8296 states and 11211 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-22 21:41:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:05,467 INFO L93 Difference]: Finished difference Result 18198 states and 24572 transitions. [2021-11-22 21:41:05,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:05,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-11-22 21:41:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:05,486 INFO L225 Difference]: With dead ends: 18198 [2021-11-22 21:41:05,486 INFO L226 Difference]: Without dead ends: 9956 [2021-11-22 21:41:05,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:05,498 INFO L933 BasicCegarLoop]: 13372 mSDtfsCounter, 4357 mSDsluCounter, 8859 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 22231 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:05,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4357 Valid, 22231 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:41:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2021-11-22 21:41:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9908. [2021-11-22 21:41:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9908 states, 9787 states have (on average 1.3670174721569428) internal successors, (13379), 9907 states have internal predecessors, (13379), 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-22 21:41:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9908 states to 9908 states and 13379 transitions. [2021-11-22 21:41:05,669 INFO L78 Accepts]: Start accepts. Automaton has 9908 states and 13379 transitions. Word has length 14 [2021-11-22 21:41:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:05,669 INFO L470 AbstractCegarLoop]: Abstraction has 9908 states and 13379 transitions. [2021-11-22 21:41:05,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-22 21:41:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9908 states and 13379 transitions. [2021-11-22 21:41:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 21:41:05,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:05,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:05,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 21:41:05,671 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr135ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1448247261, now seen corresponding path program 1 times [2021-11-22 21:41:05,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:05,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962442589] [2021-11-22 21:41:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:05,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:05,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-22 21:41:05,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962442589] [2021-11-22 21:41:05,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962442589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:05,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:05,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:05,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718068945] [2021-11-22 21:41:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:05,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:05,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:05,748 INFO L87 Difference]: Start difference. First operand 9908 states and 13379 transitions. 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-22 21:41:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:05,940 INFO L93 Difference]: Finished difference Result 9908 states and 13379 transitions. [2021-11-22 21:41:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:05,940 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-22 21:41:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:05,956 INFO L225 Difference]: With dead ends: 9908 [2021-11-22 21:41:05,956 INFO L226 Difference]: Without dead ends: 9892 [2021-11-22 21:41:05,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:05,960 INFO L933 BasicCegarLoop]: 11161 mSDtfsCounter, 10992 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10992 SdHoareTripleChecker+Valid, 11291 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:05,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10992 Valid, 11291 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:41:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9892 states. [2021-11-22 21:41:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9892 to 9892. [2021-11-22 21:41:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9892 states, 9779 states have (on average 1.366295122200634) internal successors, (13361), 9891 states have internal predecessors, (13361), 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-22 21:41:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9892 states to 9892 states and 13361 transitions. [2021-11-22 21:41:06,251 INFO L78 Accepts]: Start accepts. Automaton has 9892 states and 13361 transitions. Word has length 15 [2021-11-22 21:41:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:06,252 INFO L470 AbstractCegarLoop]: Abstraction has 9892 states and 13361 transitions. [2021-11-22 21:41:06,252 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-22 21:41:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 9892 states and 13361 transitions. [2021-11-22 21:41:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 21:41:06,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:06,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:06,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 21:41:06,253 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1945966791, now seen corresponding path program 1 times [2021-11-22 21:41:06,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:06,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880718028] [2021-11-22 21:41:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:06,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:06,328 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-22 21:41:06,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:06,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880718028] [2021-11-22 21:41:06,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880718028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:06,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:06,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:06,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051223751] [2021-11-22 21:41:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:06,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:06,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:06,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:06,330 INFO L87 Difference]: Start difference. First operand 9892 states and 13361 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-22 21:41:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:06,697 INFO L93 Difference]: Finished difference Result 9892 states and 13361 transitions. [2021-11-22 21:41:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:06,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-22 21:41:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:06,714 INFO L225 Difference]: With dead ends: 9892 [2021-11-22 21:41:06,714 INFO L226 Difference]: Without dead ends: 9843 [2021-11-22 21:41:06,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:06,719 INFO L933 BasicCegarLoop]: 11125 mSDtfsCounter, 10801 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10801 SdHoareTripleChecker+Valid, 11321 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:06,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10801 Valid, 11321 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:41:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2021-11-22 21:41:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9843. [2021-11-22 21:41:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9745 states have (on average 1.3654181631605953) internal successors, (13306), 9842 states have internal predecessors, (13306), 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-22 21:41:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 13306 transitions. [2021-11-22 21:41:06,899 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 13306 transitions. Word has length 16 [2021-11-22 21:41:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:06,899 INFO L470 AbstractCegarLoop]: Abstraction has 9843 states and 13306 transitions. [2021-11-22 21:41:06,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-22 21:41:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 13306 transitions. [2021-11-22 21:41:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 21:41:06,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:06,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:06,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 21:41:06,902 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1410421287, now seen corresponding path program 1 times [2021-11-22 21:41:06,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:06,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610427319] [2021-11-22 21:41:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:06,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:06,989 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-22 21:41:06,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610427319] [2021-11-22 21:41:06,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610427319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:06,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:06,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:06,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665347038] [2021-11-22 21:41:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:06,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:06,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:06,991 INFO L87 Difference]: Start difference. First operand 9843 states and 13306 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-22 21:41:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:07,469 INFO L93 Difference]: Finished difference Result 27773 states and 37493 transitions. [2021-11-22 21:41:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:07,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2021-11-22 21:41:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:07,505 INFO L225 Difference]: With dead ends: 27773 [2021-11-22 21:41:07,505 INFO L226 Difference]: Without dead ends: 17984 [2021-11-22 21:41:07,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:07,529 INFO L933 BasicCegarLoop]: 11112 mSDtfsCounter, 8863 mSDsluCounter, 10995 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8863 SdHoareTripleChecker+Valid, 22107 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:07,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8863 Valid, 22107 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17984 states. [2021-11-22 21:41:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17984 to 11886. [2021-11-22 21:41:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11886 states, 11788 states have (on average 1.3579911774686122) internal successors, (16008), 11885 states have internal predecessors, (16008), 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-22 21:41:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 16008 transitions. [2021-11-22 21:41:07,826 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 16008 transitions. Word has length 33 [2021-11-22 21:41:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:07,827 INFO L470 AbstractCegarLoop]: Abstraction has 11886 states and 16008 transitions. [2021-11-22 21:41:07,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-22 21:41:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 16008 transitions. [2021-11-22 21:41:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 21:41:07,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:07,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:07,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 21:41:07,829 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1530001557, now seen corresponding path program 1 times [2021-11-22 21:41:07,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:07,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168337604] [2021-11-22 21:41:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:07,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:07,924 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-22 21:41:07,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:07,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168337604] [2021-11-22 21:41:07,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168337604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:07,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:07,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 21:41:07,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501701432] [2021-11-22 21:41:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:07,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:41:07,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:41:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:07,926 INFO L87 Difference]: Start difference. First operand 11886 states and 16008 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-22 21:41:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:08,179 INFO L93 Difference]: Finished difference Result 11886 states and 16008 transitions. [2021-11-22 21:41:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:41:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2021-11-22 21:41:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:08,188 INFO L225 Difference]: With dead ends: 11886 [2021-11-22 21:41:08,188 INFO L226 Difference]: Without dead ends: 5866 [2021-11-22 21:41:08,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:41:08,197 INFO L933 BasicCegarLoop]: 5053 mSDtfsCounter, 3096 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 6989 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:08,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3096 Valid, 6989 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:41:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2021-11-22 21:41:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2021-11-22 21:41:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5827 states have (on average 1.3331045134717694) internal successors, (7768), 5865 states have internal predecessors, (7768), 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-22 21:41:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7768 transitions. [2021-11-22 21:41:08,306 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7768 transitions. Word has length 33 [2021-11-22 21:41:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:08,307 INFO L470 AbstractCegarLoop]: Abstraction has 5866 states and 7768 transitions. [2021-11-22 21:41:08,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-22 21:41:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7768 transitions. [2021-11-22 21:41:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 21:41:08,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:08,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:08,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 21:41:08,309 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1633773968, now seen corresponding path program 1 times [2021-11-22 21:41:08,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:08,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598312528] [2021-11-22 21:41:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:08,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:08,410 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-22 21:41:08,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:08,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598312528] [2021-11-22 21:41:08,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598312528] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:08,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:08,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:41:08,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450483609] [2021-11-22 21:41:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:08,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:41:08,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:41:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:41:08,412 INFO L87 Difference]: Start difference. First operand 5866 states and 7768 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:08,565 INFO L93 Difference]: Finished difference Result 11681 states and 15467 transitions. [2021-11-22 21:41:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:41:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-22 21:41:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:08,575 INFO L225 Difference]: With dead ends: 11681 [2021-11-22 21:41:08,575 INFO L226 Difference]: Without dead ends: 5866 [2021-11-22 21:41:08,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:41:08,584 INFO L933 BasicCegarLoop]: 5082 mSDtfsCounter, 5 mSDsluCounter, 15233 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20315 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:08,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 20315 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2021-11-22 21:41:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2021-11-22 21:41:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5827 states have (on average 1.3329328985755964) internal successors, (7767), 5865 states have internal predecessors, (7767), 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-22 21:41:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7767 transitions. [2021-11-22 21:41:08,694 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7767 transitions. Word has length 42 [2021-11-22 21:41:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:08,694 INFO L470 AbstractCegarLoop]: Abstraction has 5866 states and 7767 transitions. [2021-11-22 21:41:08,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7767 transitions. [2021-11-22 21:41:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 21:41:08,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:08,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:08,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 21:41:08,696 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -986731544, now seen corresponding path program 1 times [2021-11-22 21:41:08,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:08,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129728000] [2021-11-22 21:41:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:08,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:08,868 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-22 21:41:08,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:08,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129728000] [2021-11-22 21:41:08,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129728000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:08,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:08,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 21:41:08,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481372773] [2021-11-22 21:41:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:08,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:41:08,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:41:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:41:08,870 INFO L87 Difference]: Start difference. First operand 5866 states and 7767 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:09,100 INFO L93 Difference]: Finished difference Result 11680 states and 15465 transitions. [2021-11-22 21:41:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:41:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-22 21:41:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:09,111 INFO L225 Difference]: With dead ends: 11680 [2021-11-22 21:41:09,111 INFO L226 Difference]: Without dead ends: 5860 [2021-11-22 21:41:09,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:41:09,119 INFO L933 BasicCegarLoop]: 5081 mSDtfsCounter, 8 mSDsluCounter, 15226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20307 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:09,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 20307 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2021-11-22 21:41:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 5860. [2021-11-22 21:41:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5860 states, 5821 states have (on average 1.3329324858271774) internal successors, (7759), 5859 states have internal predecessors, (7759), 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-22 21:41:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5860 states to 5860 states and 7759 transitions. [2021-11-22 21:41:09,244 INFO L78 Accepts]: Start accepts. Automaton has 5860 states and 7759 transitions. Word has length 47 [2021-11-22 21:41:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:09,245 INFO L470 AbstractCegarLoop]: Abstraction has 5860 states and 7759 transitions. [2021-11-22 21:41:09,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5860 states and 7759 transitions. [2021-11-22 21:41:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 21:41:09,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:09,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:09,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 21:41:09,249 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 619608577, now seen corresponding path program 1 times [2021-11-22 21:41:09,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613315355] [2021-11-22 21:41:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:09,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:09,725 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-22 21:41:09,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:09,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613315355] [2021-11-22 21:41:09,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613315355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:09,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:09,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 21:41:09,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603438203] [2021-11-22 21:41:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:09,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 21:41:09,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 21:41:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:41:09,728 INFO L87 Difference]: Start difference. First operand 5860 states and 7759 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:11,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:41:15,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:41:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:16,125 INFO L93 Difference]: Finished difference Result 17282 states and 22897 transitions. [2021-11-22 21:41:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 21:41:16,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 21:41:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:16,148 INFO L225 Difference]: With dead ends: 17282 [2021-11-22 21:41:16,148 INFO L226 Difference]: Without dead ends: 11465 [2021-11-22 21:41:16,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:41:16,159 INFO L933 BasicCegarLoop]: 7139 mSDtfsCounter, 4862 mSDsluCounter, 32895 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4862 SdHoareTripleChecker+Valid, 40034 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:16,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4862 Valid, 40034 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 882 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2021-11-22 21:41:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2021-11-22 21:41:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 5865. [2021-11-22 21:41:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5865 states, 5826 states have (on average 1.33264675592173) internal successors, (7764), 5864 states have internal predecessors, (7764), 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-22 21:41:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5865 states to 5865 states and 7764 transitions. [2021-11-22 21:41:16,406 INFO L78 Accepts]: Start accepts. Automaton has 5865 states and 7764 transitions. Word has length 56 [2021-11-22 21:41:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:16,406 INFO L470 AbstractCegarLoop]: Abstraction has 5865 states and 7764 transitions. [2021-11-22 21:41:16,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:41:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5865 states and 7764 transitions. [2021-11-22 21:41:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 21:41:16,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:16,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:16,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 21:41:16,410 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2132300948, now seen corresponding path program 1 times [2021-11-22 21:41:16,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:16,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397701422] [2021-11-22 21:41:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:16,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:16,550 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-22 21:41:16,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:16,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397701422] [2021-11-22 21:41:16,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397701422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:16,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:16,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 21:41:16,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785454935] [2021-11-22 21:41:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:16,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:41:16,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:41:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:41:16,552 INFO L87 Difference]: Start difference. First operand 5865 states and 7764 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-22 21:41:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:16,718 INFO L93 Difference]: Finished difference Result 11681 states and 15464 transitions. [2021-11-22 21:41:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:41:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2021-11-22 21:41:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:16,728 INFO L225 Difference]: With dead ends: 11681 [2021-11-22 21:41:16,728 INFO L226 Difference]: Without dead ends: 5865 [2021-11-22 21:41:16,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:41:16,734 INFO L933 BasicCegarLoop]: 5074 mSDtfsCounter, 3 mSDsluCounter, 10138 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15212 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:16,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 15212 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:41:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2021-11-22 21:41:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 5865. [2021-11-22 21:41:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5865 states, 5826 states have (on average 1.3324751115688294) internal successors, (7763), 5864 states have internal predecessors, (7763), 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-22 21:41:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5865 states to 5865 states and 7763 transitions. [2021-11-22 21:41:16,855 INFO L78 Accepts]: Start accepts. Automaton has 5865 states and 7763 transitions. Word has length 57 [2021-11-22 21:41:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:16,855 INFO L470 AbstractCegarLoop]: Abstraction has 5865 states and 7763 transitions. [2021-11-22 21:41:16,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-22 21:41:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5865 states and 7763 transitions. [2021-11-22 21:41:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 21:41:16,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:16,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:16,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 21:41:16,857 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -164068784, now seen corresponding path program 1 times [2021-11-22 21:41:16,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:16,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916429577] [2021-11-22 21:41:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:16,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:41:17,197 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-22 21:41:17,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 21:41:17,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916429577] [2021-11-22 21:41:17,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916429577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 21:41:17,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:41:17,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 21:41:17,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825278815] [2021-11-22 21:41:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 21:41:17,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 21:41:17,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 21:41:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 21:41:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-22 21:41:17,198 INFO L87 Difference]: Start difference. First operand 5865 states and 7763 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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-22 21:41:19,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:41:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:41:24,665 INFO L93 Difference]: Finished difference Result 18896 states and 24992 transitions. [2021-11-22 21:41:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 21:41:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 59 [2021-11-22 21:41:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:41:24,686 INFO L225 Difference]: With dead ends: 18896 [2021-11-22 21:41:24,686 INFO L226 Difference]: Without dead ends: 13079 [2021-11-22 21:41:24,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-11-22 21:41:24,698 INFO L933 BasicCegarLoop]: 11951 mSDtfsCounter, 9810 mSDsluCounter, 91743 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 86 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9810 SdHoareTripleChecker+Valid, 103694 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-22 21:41:24,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9810 Valid, 103694 Invalid, 2107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [86 Valid, 2020 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2021-11-22 21:41:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2021-11-22 21:41:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 5859. [2021-11-22 21:41:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5820 states have (on average 1.3326460481099656) internal successors, (7756), 5858 states have internal predecessors, (7756), 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-22 21:41:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 7756 transitions. [2021-11-22 21:41:24,864 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 7756 transitions. Word has length 59 [2021-11-22 21:41:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:41:24,864 INFO L470 AbstractCegarLoop]: Abstraction has 5859 states and 7756 transitions. [2021-11-22 21:41:24,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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-22 21:41:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 7756 transitions. [2021-11-22 21:41:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 21:41:24,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:41:24,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:24,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 21:41:24,866 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 134 more)] === [2021-11-22 21:41:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:41:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 39375719, now seen corresponding path program 1 times [2021-11-22 21:41:24,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 21:41:24,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508279776] [2021-11-22 21:41:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:41:24,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 21:41:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:41:25,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 21:41:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 21:41:26,907 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 21:41:26,907 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 21:41:26,908 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (136 of 137 remaining) [2021-11-22 21:41:26,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (135 of 137 remaining) [2021-11-22 21:41:26,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (134 of 137 remaining) [2021-11-22 21:41:26,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (133 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (132 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (131 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (130 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (129 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (128 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (127 of 137 remaining) [2021-11-22 21:41:26,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (126 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (125 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (124 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (123 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (122 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (121 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (120 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (119 of 137 remaining) [2021-11-22 21:41:26,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (118 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (117 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (116 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (115 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (114 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (113 of 137 remaining) [2021-11-22 21:41:26,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (112 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (111 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (110 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (109 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (108 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (107 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (106 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (105 of 137 remaining) [2021-11-22 21:41:26,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (104 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (103 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (102 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (101 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (100 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (99 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (98 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (97 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (96 of 137 remaining) [2021-11-22 21:41:26,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (95 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (94 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (93 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (92 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (91 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (90 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (89 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (88 of 137 remaining) [2021-11-22 21:41:26,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (87 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (86 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (85 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (84 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (83 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (82 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (81 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (80 of 137 remaining) [2021-11-22 21:41:26,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (79 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (78 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (77 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (76 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (75 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (74 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (73 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (72 of 137 remaining) [2021-11-22 21:41:26,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (71 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (70 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (69 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (68 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (67 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION (66 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION (65 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION (64 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION (63 of 137 remaining) [2021-11-22 21:41:26,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION (62 of 137 remaining) [2021-11-22 21:41:26,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION (61 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION (60 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION (59 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION (58 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION (57 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION (56 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION (55 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION (54 of 137 remaining) [2021-11-22 21:41:26,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION (53 of 137 remaining) [2021-11-22 21:41:26,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION (52 of 137 remaining) [2021-11-22 21:41:26,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION (51 of 137 remaining) [2021-11-22 21:41:26,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION (50 of 137 remaining) [2021-11-22 21:41:26,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION (49 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION (48 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION (47 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION (46 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION (45 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION (44 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION (43 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION (42 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION (41 of 137 remaining) [2021-11-22 21:41:26,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION (40 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION (39 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION (38 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION (37 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (36 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION (35 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION (34 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONERROR_FUNCTION (33 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONERROR_FUNCTION (32 of 137 remaining) [2021-11-22 21:41:26,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONERROR_FUNCTION (31 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONERROR_FUNCTION (30 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONERROR_FUNCTION (29 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONERROR_FUNCTION (28 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONERROR_FUNCTION (27 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONERROR_FUNCTION (26 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONERROR_FUNCTION (25 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONERROR_FUNCTION (24 of 137 remaining) [2021-11-22 21:41:26,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONERROR_FUNCTION (23 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONERROR_FUNCTION (22 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONERROR_FUNCTION (21 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONERROR_FUNCTION (20 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (19 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONERROR_FUNCTION (18 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONERROR_FUNCTION (17 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONERROR_FUNCTION (16 of 137 remaining) [2021-11-22 21:41:26,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION (15 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONERROR_FUNCTION (14 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONERROR_FUNCTION (13 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONERROR_FUNCTION (12 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONERROR_FUNCTION (11 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONERROR_FUNCTION (10 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONERROR_FUNCTION (9 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONERROR_FUNCTION (8 of 137 remaining) [2021-11-22 21:41:26,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONERROR_FUNCTION (7 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONERROR_FUNCTION (6 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONERROR_FUNCTION (5 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONERROR_FUNCTION (4 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONERROR_FUNCTION (3 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONERROR_FUNCTION (2 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONERROR_FUNCTION (1 of 137 remaining) [2021-11-22 21:41:26,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONERROR_FUNCTION (0 of 137 remaining) [2021-11-22 21:41:26,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 21:41:26,933 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:41:26,935 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 21:41:27,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:41:27 BoogieIcfgContainer [2021-11-22 21:41:27,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 21:41:27,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 21:41:27,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 21:41:27,043 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 21:41:27,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:02" (3/4) ... [2021-11-22 21:41:27,046 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 21:41:27,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 21:41:27,046 INFO L158 Benchmark]: Toolchain (without parser) took 60308.04ms. Allocated memory was 107.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 73.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-11-22 21:41:27,046 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:41:27,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2855.94ms. Allocated memory was 107.0MB in the beginning and 230.7MB in the end (delta: 123.7MB). Free memory was 73.8MB in the beginning and 142.6MB in the end (delta: -68.8MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2021-11-22 21:41:27,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 891.19ms. Allocated memory was 230.7MB in the beginning and 402.7MB in the end (delta: 172.0MB). Free memory was 142.6MB in the beginning and 218.4MB in the end (delta: -75.8MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2021-11-22 21:41:27,048 INFO L158 Benchmark]: Boogie Preprocessor took 1447.43ms. Allocated memory is still 402.7MB. Free memory was 218.4MB in the beginning and 149.2MB in the end (delta: 69.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2021-11-22 21:41:27,048 INFO L158 Benchmark]: RCFGBuilder took 30568.43ms. Allocated memory was 402.7MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 149.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-22 21:41:27,048 INFO L158 Benchmark]: TraceAbstraction took 24535.81ms. Allocated memory was 1.6GB in the beginning and 3.1GB in the end (delta: 1.5GB). Free memory was 1.2GB in the beginning and 1.8GB in the end (delta: -628.6MB). Peak memory consumption was 999.9MB. Max. memory is 16.1GB. [2021-11-22 21:41:27,048 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 3.1GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 21:41:27,050 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.17ms. Allocated memory is still 107.0MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2855.94ms. Allocated memory was 107.0MB in the beginning and 230.7MB in the end (delta: 123.7MB). Free memory was 73.8MB in the beginning and 142.6MB in the end (delta: -68.8MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 891.19ms. Allocated memory was 230.7MB in the beginning and 402.7MB in the end (delta: 172.0MB). Free memory was 142.6MB in the beginning and 218.4MB in the end (delta: -75.8MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1447.43ms. Allocated memory is still 402.7MB. Free memory was 218.4MB in the beginning and 149.2MB in the end (delta: 69.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * RCFGBuilder took 30568.43ms. Allocated memory was 402.7MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 149.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * TraceAbstraction took 24535.81ms. Allocated memory was 1.6GB in the beginning and 3.1GB in the end (delta: 1.5GB). Free memory was 1.2GB in the beginning and 1.8GB in the end (delta: -628.6MB). Peak memory consumption was 999.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 3.1GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13668]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of __builtin_object_size at line 7404, overapproximation of large string literal at line 12845, overapproximation of bitwiseAnd at line 12077. Possible FailurePath: [L7687] static unsigned int vhost_zcopy_mask ; [L10792] static struct target_fabric_configfs *tcm_vhost_fabric_configfs ; [L10793] static struct workqueue_struct *tcm_vhost_workqueue ; [L10794-L10797] static struct mutex tcm_vhost_mutex = {{1}, {{{{{0U}}, 3735899821U, 4294967295U, 0xffffffffffffffffUL, {0, {0, 0}, "tcm_vhost_mutex.wait_lock", 0, 0UL}}}}, {& tcm_vhost_mutex.wait_list, & tcm_vhost_mutex.wait_list}, 0, 0, (void *)(& tcm_vhost_mutex), {0, {0, 0}, "tcm_vhost_mutex", 0, 0UL}}; [L10798] static struct list_head tcm_vhost_list = {& tcm_vhost_list, & tcm_vhost_list}; [L12183-L12186] static struct file_operations const vhost_scsi_fops = {& __this_module, & noop_llseek, 0, 0, 0, 0, 0, 0, & vhost_scsi_ioctl, & vhost_scsi_compat_ioctl, 0, & vhost_scsi_open, 0, & vhost_scsi_release, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L12187-L12188] static struct miscdevice vhost_scsi_misc = {255, "vhost-scsi", & vhost_scsi_fops, {0, 0}, 0, 0, 0, (unsigned short)0}; [L12540] static struct target_fabric_tpg_attribute tcm_vhost_tpg_nexus = {{"nexus", & __this_module, 420U}, & tcm_vhost_tpg_show_nexus, & tcm_vhost_tpg_store_nexus}; [L12541] static struct configfs_attribute *tcm_vhost_tpg_attrs[2U] = { & tcm_vhost_tpg_nexus.attr, 0}; [L12732] static struct target_fabric_wwn_attribute tcm_vhost_wwn_version = {{"version", & __this_module, 292U}, & tcm_vhost_wwn_show_attr_version, 0}; [L12733] static struct configfs_attribute *tcm_vhost_wwn_attrs[2U] = { & tcm_vhost_wwn_version.attr, 0}; [L12734-L12745] static struct target_core_fabric_ops tcm_vhost_ops = {0, & tcm_vhost_get_fabric_name, & tcm_vhost_get_fabric_proto_ident, & tcm_vhost_get_fabric_wwn, & tcm_vhost_get_tag, & tcm_vhost_get_default_depth, & tcm_vhost_get_pr_transport_id, & tcm_vhost_get_pr_transport_id_len, & tcm_vhost_parse_pr_out_transport_id, & tcm_vhost_check_true, & tcm_vhost_check_true, & tcm_vhost_check_false, & tcm_vhost_check_false, 0, & tcm_vhost_alloc_fabric_acl, & tcm_vhost_release_fabric_acl, & tcm_vhost_tpg_get_inst_index, 0, & tcm_vhost_release_cmd, 0, & tcm_vhost_shutdown_session, & tcm_vhost_close_session, & tcm_vhost_sess_get_index, 0, & tcm_vhost_write_pending, & tcm_vhost_write_pending_status, & tcm_vhost_set_default_node_attrs, & tcm_vhost_get_task_tag, & tcm_vhost_get_cmd_state, & tcm_vhost_queue_data_in, & tcm_vhost_queue_status, & tcm_vhost_queue_tm_rsp, & tcm_vhost_make_tport, & tcm_vhost_drop_tport, & tcm_vhost_make_tpg, & tcm_vhost_drop_tpg, & tcm_vhost_port_link, & tcm_vhost_port_unlink, 0, 0, & tcm_vhost_make_nodeacl, & tcm_vhost_drop_nodeacl}; [L12885] int LDV_IN_INTERRUPT ; [L13678] static int ldv_mutex_cred_guard_mutex ; [L13785] static int ldv_mutex_lock ; [L13892] static int ldv_mutex_mtx ; [L13999] static int ldv_mutex_mutex ; [L14106] static int ldv_mutex_tcm_vhost_mutex ; [L14213] static int ldv_mutex_tv_tpg_mutex ; VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=0, ldv_mutex_cred_guard_mutex=0, ldv_mutex_lock=0, ldv_mutex_mtx=0, ldv_mutex_mutex=0, ldv_mutex_tcm_vhost_mutex=0, ldv_mutex_tv_tpg_mutex=0, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={0:0}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12888] struct inode *var_group1 ; [L12889] struct file *var_group2 ; [L12890] unsigned int var_vhost_scsi_ioctl_44_p1 ; [L12891] unsigned long var_vhost_scsi_ioctl_44_p2 ; [L12892] unsigned int var_vhost_scsi_compat_ioctl_45_p1 ; [L12893] unsigned long var_vhost_scsi_compat_ioctl_45_p2 ; [L12894] int res_vhost_scsi_open_39 ; [L12895] struct se_portal_group *var_group3 ; [L12896] struct se_node_acl *var_group4 ; [L12897] struct t10_pr_registration *var_tcm_vhost_get_pr_transport_id_7_p2 ; [L12898] int *var_tcm_vhost_get_pr_transport_id_7_p3 ; [L12899] unsigned char *var_tcm_vhost_get_pr_transport_id_7_p4 ; [L12900] struct t10_pr_registration *var_tcm_vhost_get_pr_transport_id_len_8_p2 ; [L12901] int *var_tcm_vhost_get_pr_transport_id_len_8_p3 ; [L12902] char const *var_tcm_vhost_parse_pr_out_transport_id_9_p1 ; [L12903] u32 *var_tcm_vhost_parse_pr_out_transport_id_9_p2 ; [L12904] char **var_tcm_vhost_parse_pr_out_transport_id_9_p3 ; [L12905] struct se_cmd *var_group5 ; [L12906] struct se_session *var_group6 ; [L12907] struct target_fabric_configfs *var_group7 ; [L12908] struct config_group *var_group8 ; [L12909] char const *var_tcm_vhost_make_tport_59_p2 ; [L12910] struct se_wwn *var_group9 ; [L12911] char const *var_tcm_vhost_make_tpg_57_p2 ; [L12912] struct se_lun *var_group10 ; [L12913] char const *var_tcm_vhost_make_nodeacl_51_p2 ; [L12914] int ldv_s_vhost_scsi_fops_file_operations ; [L12915] int tmp ; [L12916] int tmp___0 ; [L12917] int tmp___1 ; [L12919] ldv_s_vhost_scsi_fops_file_operations = 0 [L12920] LDV_IN_INTERRUPT = 1 [L12921] CALL ldv_initialize() [L14323] ldv_mutex_cred_guard_mutex = 1 [L14324] ldv_mutex_lock = 1 [L14325] ldv_mutex_mtx = 1 [L14326] ldv_mutex_mutex = 1 [L14327] ldv_mutex_tcm_vhost_mutex = 1 [L14328] ldv_mutex_tv_tpg_mutex = 1 VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={0:0}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12921] RET ldv_initialize() [L12922] FCALL ldv_handler_precall() [L12923] CALL, EXPR tcm_vhost_init() [L12839] int ret ; [L12840] struct lock_class_key __key ; [L12841] char const *__lock_name ; [L12842] struct workqueue_struct *tmp ; [L12844] ret = -12 [L12845] __lock_name = "tcm_vhost" [L12846] tmp = __alloc_workqueue_key("tcm_vhost", 0U, 0, & __key, __lock_name) [L12847] tcm_vhost_workqueue = tmp VAL [__alloc_workqueue_key("tcm_vhost", 0U, 0, & __key, __lock_name)={366:-365}, __key={368:0}, __lock_name={354:0}, __this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ret=-12, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp={366:-365}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12848] COND FALSE !((unsigned long )tcm_vhost_workqueue == (unsigned long )((struct workqueue_struct *)0)) [L12852] CALL, EXPR vhost_scsi_register() [L12191] int tmp ; [L12193] CALL, EXPR misc_register(& vhost_scsi_misc) [L14561] return __VERIFIER_nondet_int(); [L12193] RET, EXPR misc_register(& vhost_scsi_misc) [L12193] tmp = misc_register(& vhost_scsi_misc) [L12194] return (tmp); VAL [\result=374, __this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=374, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12852] RET, EXPR vhost_scsi_register() [L12852] ret = vhost_scsi_register() [L12853] COND FALSE !(ret < 0) [L12857] CALL, EXPR tcm_vhost_register_configfs() [L12748] struct target_fabric_configfs *fabric ; [L12749] int ret ; [L12750] struct _ddebug descriptor ; [L12751] struct new_utsname *tmp ; [L12752] struct new_utsname *tmp___0 ; [L12753] long tmp___1 ; [L12754] long tmp___2 ; [L12755] long tmp___3 ; [L12756] struct _ddebug descriptor___0 ; [L12757] long tmp___4 ; [L12759] descriptor.modname = "tcm_vhost" [L12760] descriptor.function = "tcm_vhost_register_configfs" [L12761] descriptor.filename = "/work/vladimir/UFO/Work/test/work/current--X--drivers/vhost/tcm_vhost.ko--X--defaultlinux-3.7.3--X--32_7a--X--ufo/linux-3.7.3/csd_deg_dscv/12/dscv_tempdir/dscv/ri/32_7a/drivers/vhost/tcm_vhost.c.prepared" [L12762] descriptor.format = "TCM_VHOST fabric module %s on %s/%s on 3.7.3\n" [L12763] descriptor.lineno = 1561U [L12764] descriptor.flags = 0U [L12765] EXPR descriptor.flags [L12765] CALL, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) [L13675] return (exp); VAL [\old(c)=0, \old(exp)=0, \result=0, __this_module={18446744073709551640:18446744073709551675}, c=0, exp=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12765] RET, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) [L12765] tmp___1 = ldv__builtin_expect((long )descriptor.flags & 1L, 0L) [L12766] COND FALSE !(tmp___1 != 0L) VAL [__this_module={18446744073709551640:18446744073709551675}, descriptor={367:0}, descriptor___0={369:0}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp___1=0, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12773] CALL, EXPR target_fabric_configfs_init(& __this_module, "vhost") [L14636] CALL, EXPR ldv_malloc(sizeof(struct target_fabric_configfs)) [L7220] COND FALSE !(__VERIFIER_nondet_int()) [L7225] return ((void *)0); VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, size=1300, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L14636] RET, EXPR ldv_malloc(sizeof(struct target_fabric_configfs)) [L14636] return ldv_malloc(sizeof(struct target_fabric_configfs)); [L12773] RET, EXPR target_fabric_configfs_init(& __this_module, "vhost") [L12773] fabric = target_fabric_configfs_init(& __this_module, "vhost") [L12774] CALL, EXPR IS_ERR((void const *)fabric) [L6795] long tmp ; [L6797] CALL, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L13675] return (exp); VAL [\old(c)=0, \old(exp)=0, \result=0, __this_module={18446744073709551640:18446744073709551675}, c=0, exp=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L6797] RET, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L6797] tmp = ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L6798] return (tmp); VAL [\result=0, __this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ptr={0:0}, ptr={0:0}, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=0, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12774] RET, EXPR IS_ERR((void const *)fabric) [L12774] tmp___3 = IS_ERR((void const *)fabric) [L12775] COND FALSE !(tmp___3 != 0L) [L12781] fabric->tf_ops = tcm_vhost_ops [L12782] fabric->tf_cit_tmpl.tfc_wwn_cit.ct_attrs = (struct configfs_attribute **)(& tcm_vhost_wwn_attrs) [L12783] fabric->tf_cit_tmpl.tfc_tpg_base_cit.ct_attrs = (struct configfs_attribute **)(& tcm_vhost_tpg_attrs) [L12784] fabric->tf_cit_tmpl.tfc_tpg_attrib_cit.ct_attrs = 0 [L12785] fabric->tf_cit_tmpl.tfc_tpg_param_cit.ct_attrs = 0 [L12786] fabric->tf_cit_tmpl.tfc_tpg_np_base_cit.ct_attrs = 0 [L12787] fabric->tf_cit_tmpl.tfc_tpg_nacl_base_cit.ct_attrs = 0 [L12788] fabric->tf_cit_tmpl.tfc_tpg_nacl_attrib_cit.ct_attrs = 0 [L12789] fabric->tf_cit_tmpl.tfc_tpg_nacl_auth_cit.ct_attrs = 0 [L12790] fabric->tf_cit_tmpl.tfc_tpg_nacl_param_cit.ct_attrs = 0 [L12791] CALL, EXPR target_fabric_configfs_register(fabric) [L14640] return __VERIFIER_nondet_int(); [L12791] RET, EXPR target_fabric_configfs_register(fabric) [L12791] ret = target_fabric_configfs_register(fabric) [L12792] COND FALSE !(ret < 0) [L12797] tcm_vhost_fabric_configfs = fabric [L12798] descriptor___0.modname = "tcm_vhost" [L12799] descriptor___0.function = "tcm_vhost_register_configfs" [L12800] descriptor___0.filename = "/work/vladimir/UFO/Work/test/work/current--X--drivers/vhost/tcm_vhost.ko--X--defaultlinux-3.7.3--X--32_7a--X--ufo/linux-3.7.3/csd_deg_dscv/12/dscv_tempdir/dscv/ri/32_7a/drivers/vhost/tcm_vhost.c.prepared" [L12801] descriptor___0.format = "TCM_VHOST[0] - Set fabric -> tcm_vhost_fabric_configfs\n" [L12802] descriptor___0.lineno = 1599U [L12803] descriptor___0.flags = 0U [L12804] EXPR descriptor___0.flags [L12804] CALL, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) [L13675] return (exp); VAL [\old(c)=0, \old(exp)=-2, \result=-2, __this_module={18446744073709551640:18446744073709551675}, c=0, exp=-2, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12804] RET, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) [L12804] tmp___4 = ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) [L12805] COND TRUE tmp___4 != 0L [L12809] return (0); [L12809] return (0); [L12809] return (0); VAL [\result=0, __this_module={18446744073709551640:18446744073709551675}, fabric={0:0}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ret=0, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp___1=0, tmp___3=0, tmp___4=-2, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12857] RET, EXPR tcm_vhost_register_configfs() [L12857] ret = tcm_vhost_register_configfs() [L12858] COND FALSE !(ret < 0) [L12862] return (0); [L12862] return (0); VAL [\result=0, __alloc_workqueue_key("tcm_vhost", 0U, 0, & __key, __lock_name)={366:-365}, __lock_name={354:0}, __this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ret=0, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp={366:-365}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12923] RET, EXPR tcm_vhost_init() [L12923] tmp = tcm_vhost_init() [L12924] COND FALSE !(tmp != 0) VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ldv_s_vhost_scsi_fops_file_operations=0, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=0, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L13102] tmp___1 = __VERIFIER_nondet_int() [L13103] COND TRUE tmp___1 != 0 || ldv_s_vhost_scsi_fops_file_operations != 0 VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, ldv_s_vhost_scsi_fops_file_operations=0, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=0, tmp___1=-3, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12930] tmp___0 = __VERIFIER_nondet_int() [L12932] case 0: [L12945] case 1: [L12953] case 2: [L12954] FCALL ldv_handler_precall() [L12955] CALL vhost_scsi_ioctl(var_group2, var_vhost_scsi_ioctl_44_p1, var_vhost_scsi_ioctl_44_p2) [L12095] struct vhost_scsi *vs ; [L12096] struct vhost_scsi_target backend ; [L12097] void *argp ; [L12098] u64 *featurep ; [L12099] u64 features ; [L12100] int r ; [L12101] int abi_version ; [L12102] unsigned long tmp ; [L12103] int tmp___0 ; [L12104] unsigned long tmp___1 ; [L12105] int tmp___2 ; [L12106] int tmp___3 ; [L12107] int tmp___4 ; [L12108] unsigned long tmp___5 ; [L12109] int tmp___6 ; [L12110] long tmp___7 ; [L12112] EXPR f->private_data [L12112] vs = (struct vhost_scsi *)f->private_data [L12113] argp = (void *)arg [L12114] featurep = (u64 *)argp [L12115] abi_version = 0 [L12117] case 1088991040U: [L12129] case 1088991041U: [L12141] case 1074048834U: [L12148] case 2148052736U: [L12156] case 1074310912U: [L12157] CALL, EXPR copy_from_user((void *)(& features), (void const *)featurep, 8UL) [L7397] int sz ; [L7398] unsigned long tmp ; [L7399] int __ret_warn_on ; [L7400] long tmp___0 ; [L7401] long tmp___1 ; [L7402] long tmp___2 ; [L7404] tmp = __builtin_object_size((void const *)to, 0) [L7405] sz = (int )tmp [L7406] FCALL might_fault() [L7407] CALL, EXPR ldv__builtin_expect(sz == -1, 1L) [L13675] return (exp); VAL [\old(c)=1, \old(exp)=1, \result=1, __this_module={18446744073709551640:18446744073709551675}, c=1, exp=1, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L7407] RET, EXPR ldv__builtin_expect(sz == -1, 1L) [L7407] tmp___1 = ldv__builtin_expect(sz == -1, 1L) [L7408] COND TRUE tmp___1 != 0L [L7409] CALL, EXPR _copy_from_user(to, from, (unsigned int )n) [L14395] return __VERIFIER_nondet_ulong(); [L7409] RET, EXPR _copy_from_user(to, from, (unsigned int )n) [L7409] n = _copy_from_user(to, from, (unsigned int )n) [L7425] return (n); VAL [\old(n)=8, \result=18446744073709551616, __this_module={18446744073709551640:18446744073709551675}, from={0:-4}, from={0:-4}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, n=18446744073709551616, sz=-1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=4294967295, tmp___1=1, to={373:0}, to={373:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L12157] RET, EXPR copy_from_user((void *)(& features), (void const *)featurep, 8UL) [L12157] tmp___5 = copy_from_user((void *)(& features), (void const *)featurep, 8UL) [L12158] COND FALSE !(tmp___5 != 0UL) [L12162] EXPR \read(features) [L12162] CALL vhost_scsi_set_features(vs, features) [L12070] int tmp ; VAL [\old(features)=51, __this_module={18446744073709551640:18446744073709551675}, features=51, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0, vs={18446744073709551666:375}, vs={18446744073709551666:375}] [L12072] COND FALSE !((features & 0xffffffffcaffffffULL) != 0ULL) [L12076] CALL ldv_mutex_lock_41(& vs->dev.mutex) [L13443] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L14037] COND TRUE ldv_mutex_mutex == 1 VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=1, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, lock={18446744073709551666:399}, lock={18446744073709551666:399}, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L14041] ldv_mutex_mutex = 2 VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, lock={18446744073709551666:399}, lock={18446744073709551666:399}, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L13443] RET ldv_mutex_lock_mutex(ldv_func_arg1) [L13444] FCALL mutex_lock(ldv_func_arg1) [L12076] RET ldv_mutex_lock_41(& vs->dev.mutex) [L12077] COND TRUE (features & 67108864ULL) != 0ULL [L12078] CALL vhost_log_access_ok(& vs->dev) [L8496] struct vhost_memory *mp ; [L8497] bool __warned ; [L8498] int tmp ; [L8499] int tmp___0 ; [L8500] int tmp___1 ; [L8502] CALL, EXPR debug_lockdep_rcu_enabled() [L14447] return __VERIFIER_nondet_int(); [L8502] RET, EXPR debug_lockdep_rcu_enabled() [L8502] tmp = debug_lockdep_rcu_enabled() [L8503] COND FALSE !(tmp != 0 && ! __warned) VAL [__this_module={18446744073709551640:18446744073709551675}, __warned=1, dev={18446744073709551666:383}, dev={18446744073709551666:383}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, tmp=0, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L8513] EXPR dev->memory [L8513] mp = dev->memory [L8514] CALL memory_access_ok(dev, mp, 1) [L8418] int i ; [L8419] int ok ; [L8421] i = 0 VAL [\old(log_all)=1, __this_module={18446744073709551640:18446744073709551675}, d={18446744073709551666:383}, d={18446744073709551666:383}, i=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, log_all=1, mem={18446744073709551658:18446744073709551648}, mem={18446744073709551658:18446744073709551648}, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L8437] EXPR d->nvqs VAL [\old(log_all)=1, __this_module={18446744073709551640:18446744073709551675}, d={18446744073709551666:383}, d={18446744073709551666:383}, d->nvqs=365, i=0, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, log_all=1, mem={18446744073709551658:18446744073709551648}, mem={18446744073709551658:18446744073709551648}, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] [L8437] COND TRUE d->nvqs > i [L8424] EXPR d->vqs [L8424] CALL ldv_mutex_lock_12(& (d->vqs + (unsigned long )i)->mutex) [L13211] CALL ldv_mutex_lock_mutex(ldv_func_arg1) [L14037] COND FALSE !(ldv_mutex_mutex == 1) [L14039] CALL ldv_error() [L13668] reach_error() VAL [__this_module={18446744073709551640:18446744073709551675}, LDV_IN_INTERRUPT=1, ldv_mutex_cred_guard_mutex=1, ldv_mutex_lock=1, ldv_mutex_mtx=1, ldv_mutex_mutex=2, ldv_mutex_tcm_vhost_mutex=1, ldv_mutex_tv_tpg_mutex=1, tcm_vhost_fabric_configfs={0:0}, tcm_vhost_list={357:0}, tcm_vhost_mutex={356:0}, tcm_vhost_ops={364:0}, tcm_vhost_tpg_attrs={361:0}, tcm_vhost_tpg_nexus={360:0}, tcm_vhost_workqueue={366:-365}, tcm_vhost_wwn_attrs={363:0}, tcm_vhost_wwn_version={362:0}, vhost_scsi_fops={358:0}, vhost_scsi_misc={359:0}, vhost_zcopy_mask=0] - UnprovableResult [Line: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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: 13668]: 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, 8513 locations, 137 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 86550 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86550 mSDsluCounter, 307281 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187351 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3307 IncrementalHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 119930 mSDtfsCounter, 3307 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 18966 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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-22 21:41:27,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.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 3d776a54fbebbd358d59ab0126298feae1e40360b6fb5e6158cd54ba5ef877f7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 21:41:29,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 21:41:29,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 21:41:29,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 21:41:29,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 21:41:29,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 21:41:29,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 21:41:29,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 21:41:29,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 21:41:29,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 21:41:29,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 21:41:29,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 21:41:29,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 21:41:29,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 21:41:29,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 21:41:29,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 21:41:29,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 21:41:29,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 21:41:29,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 21:41:29,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 21:41:29,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 21:41:29,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 21:41:29,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 21:41:29,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 21:41:29,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 21:41:29,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 21:41:29,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 21:41:29,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 21:41:29,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 21:41:29,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 21:41:29,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 21:41:29,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 21:41:29,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 21:41:29,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 21:41:29,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 21:41:29,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 21:41:29,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 21:41:29,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 21:41:29,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 21:41:29,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 21:41:29,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 21:41:29,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 21:41:29,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 21:41:29,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 21:41:29,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 21:41:29,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 21:41:29,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 21:41:29,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 21:41:29,140 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 21:41:29,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 21:41:29,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 21:41:29,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 21:41:29,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 21:41:29,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 21:41:29,141 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 21:41:29,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 21:41:29,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 21:41:29,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:41:29,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 21:41:29,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 21:41:29,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 21:41:29,143 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 21:41:29,143 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 21:41:29,144 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 21:41:29,144 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 21:41:29,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 21:41:29,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 21:41:29,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 21:41:29,144 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 -> 3d776a54fbebbd358d59ab0126298feae1e40360b6fb5e6158cd54ba5ef877f7 [2021-11-22 21:41:29,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 21:41:29,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 21:41:29,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 21:41:29,507 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 21:41:29,508 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 21:41:29,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:41:29,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38e7a831/af76673ee5a14f8590dbeaebe6fbf26c/FLAG6c52d629c [2021-11-22 21:41:30,263 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 21:41:30,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:41:30,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38e7a831/af76673ee5a14f8590dbeaebe6fbf26c/FLAG6c52d629c [2021-11-22 21:41:30,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38e7a831/af76673ee5a14f8590dbeaebe6fbf26c [2021-11-22 21:41:30,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 21:41:30,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 21:41:30,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 21:41:30,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 21:41:30,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 21:41:30,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:30" (1/1) ... [2021-11-22 21:41:30,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32618312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30, skipping insertion in model container [2021-11-22 21:41:30,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:30" (1/1) ... [2021-11-22 21:41:30,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 21:41:30,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:41:32,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i[462796,462809] [2021-11-22 21:41:32,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:33,001 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 21:41:33,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 21:41:33,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i[462796,462809] [2021-11-22 21:41:33,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:33,376 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 21:41:33,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.7.3/main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i[462796,462809] [2021-11-22 21:41:33,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 21:41:33,793 INFO L208 MainTranslator]: Completed translation [2021-11-22 21:41:33,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33 WrapperNode [2021-11-22 21:41:33,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 21:41:33,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 21:41:33,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 21:41:33,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 21:41:33,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:33,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,172 INFO L137 Inliner]: procedures = 460, calls = 3477, calls flagged for inlining = 989, calls inlined = 2181, statements flattened = 24667 [2021-11-22 21:41:34,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 21:41:34,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 21:41:34,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 21:41:34,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 21:41:34,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 21:41:34,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 21:41:34,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 21:41:34,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 21:41:34,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (1/1) ... [2021-11-22 21:41:34,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 21:41:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 21:41:34,852 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-22 21:41:34,924 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-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 21:41:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 21:41:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 21:41:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 21:41:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 21:41:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-22 21:41:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-22 21:41:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 21:41:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-22 21:41:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-22 21:41:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-22 21:41:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-22 21:41:35,841 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 21:41:35,843 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 21:43:33,861 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-3: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := __copy_from_user_~tmp___2~3#1[32:0]; [2021-11-22 21:43:33,864 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390-1: __copy_from_user_#t~ret211#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_~tmp___2~3#1 := __copy_from_user_#t~ret211#1;havoc __copy_from_user_#t~ret211#1;__copy_from_user_#res#1 := __copy_from_user_~tmp___2~3#1[32:0]; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1037: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1038: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449-1: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7449: havoc __copy_from_user_#t~switch208#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,865 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 4bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7460: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 8bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,866 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-1: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 10bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,867 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:43:33,868 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,868 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:43:33,868 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 16bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,868 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-1: assume 0bv64 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,869 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475-1: assume !(0bv64 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,869 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: assume 0bv64 != __copy_from_user_~tmp___0~9#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,869 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7475: assume !(0bv64 != __copy_from_user_~tmp___0~9#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,869 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:43:33,869 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483-1: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:43:33,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := ~sign_extendFrom32To64((if 0bv32 != __copy_from_user_~ret~1#1 then 1bv32 else 0bv32)), 0bv64;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-22 21:43:33,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := true; [2021-11-22 21:43:33,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-1: assume 0bv64 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488-1: assume !(0bv64 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488: assume 0bv64 != __copy_from_user_~tmp___1~4#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,872 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7488: assume !(0bv64 != __copy_from_user_~tmp___1~4#1);__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,873 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-1: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:43:33,873 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496-1: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:43:33,873 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496: assume __copy_from_user_#t~switch208#1;assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_~dst#1.base, __copy_from_user_~dst#1.offset, __copy_from_user_~src#1.base, __copy_from_user_~src#1.offset, __copy_from_user_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~0#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~0#1;copy_user_generic_#res#1 := ~zero_extendFrom32To64(copy_user_generic_~ret~0#1); [2021-11-22 21:43:33,873 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7496: assume !__copy_from_user_#t~switch208#1; [2021-11-22 21:43:33,873 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume !__copy_from_user_#t~switch208#1;__copy_from_user_#t~switch208#1 := __copy_from_user_#t~switch208#1 || 2bv32 == __copy_from_user_~size#1; [2021-11-22 21:43:33,874 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##462: assume __copy_from_user_#t~switch208#1;__copy_from_user_#res#1 := __copy_from_user_~ret~1#1; [2021-11-22 21:43:33,875 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-32: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:43:33,875 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-31: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:43:33,876 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-86: __copy_from_user_#t~ret210#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___1~4#1 := __copy_from_user_#t~ret210#1;havoc __copy_from_user_#t~ret210#1; [2021-11-22 21:43:33,876 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L13675-85: __copy_from_user_#t~ret209#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;__copy_from_user_~tmp___0~9#1 := __copy_from_user_#t~ret209#1;havoc __copy_from_user_#t~ret209#1; [2021-11-22 21:43:33,876 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:43:33,924 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:43:33,925 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 21:43:33,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:33 BoogieIcfgContainer [2021-11-22 21:43:33,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:43:33,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:43:33,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:43:33,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:43:33,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:30" (1/3) ... [2021-11-22 21:43:33,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45745cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:33, skipping insertion in model container [2021-11-22 21:43:33,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:33" (2/3) ... [2021-11-22 21:43:33,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45745cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:43:33, skipping insertion in model container [2021-11-22 21:43:33,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:43:33" (3/3) ... [2021-11-22 21:43:33,937 INFO L111 eAbstractionObserver]: Analyzing ICFG main0_drivers-vhost-tcm_vhost-ko--32_7a--linux-3.7.3.i [2021-11-22 21:43:33,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:43:33,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 101 error locations. [2021-11-22 21:43:33,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:43:33,991 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-22 21:43:33,991 INFO L340 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2021-11-22 21:43:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 5009 states, 4907 states have (on average 1.3853678418585693) internal successors, (6798), 5008 states have internal predecessors, (6798), 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-22 21:43:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 21:43:34,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:34,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:34,045 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1508267695, now seen corresponding path program 1 times [2021-11-22 21:43:34,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116855726] [2021-11-22 21:43:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:34,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:34,061 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-22 21:43:34,089 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-22 21:43:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:34,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:34,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:35,142 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-22 21:43:35,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:35,273 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-22 21:43:35,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:35,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116855726] [2021-11-22 21:43:35,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116855726] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:35,274 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:35,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:35,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234085431] [2021-11-22 21:43:35,276 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:35,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:35,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:35,318 INFO L87 Difference]: Start difference. First operand has 5009 states, 4907 states have (on average 1.3853678418585693) internal successors, (6798), 5008 states have internal predecessors, (6798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:43:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:35,670 INFO L93 Difference]: Finished difference Result 9883 states and 13446 transitions. [2021-11-22 21:43:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-22 21:43:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:35,699 INFO L225 Difference]: With dead ends: 9883 [2021-11-22 21:43:35,700 INFO L226 Difference]: Without dead ends: 4872 [2021-11-22 21:43:35,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:35,715 INFO L933 BasicCegarLoop]: 6554 mSDtfsCounter, 6546 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6546 SdHoareTripleChecker+Valid, 6554 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:35,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6546 Valid, 6554 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:43:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2021-11-22 21:43:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2021-11-22 21:43:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4772 states have (on average 1.3602263202011735) internal successors, (6491), 4871 states have internal predecessors, (6491), 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-22 21:43:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 6491 transitions. [2021-11-22 21:43:35,872 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 6491 transitions. Word has length 11 [2021-11-22 21:43:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:35,872 INFO L470 AbstractCegarLoop]: Abstraction has 4872 states and 6491 transitions. [2021-11-22 21:43:35,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:43:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 6491 transitions. [2021-11-22 21:43:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 21:43:35,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:35,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:35,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 21:43:36,092 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-22 21:43:36,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 488355555, now seen corresponding path program 1 times [2021-11-22 21:43:36,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:36,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743316011] [2021-11-22 21:43:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:36,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:36,111 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-22 21:43:36,113 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-22 21:43:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:36,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:37,142 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-22 21:43:37,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:37,317 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-22 21:43:37,317 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:37,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743316011] [2021-11-22 21:43:37,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743316011] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:37,318 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:37,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:37,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024717988] [2021-11-22 21:43:37,318 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:37,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:37,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:37,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:37,319 INFO L87 Difference]: Start difference. First operand 4872 states and 6491 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-22 21:43:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:37,600 INFO L93 Difference]: Finished difference Result 4872 states and 6491 transitions. [2021-11-22 21:43:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-11-22 21:43:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:37,614 INFO L225 Difference]: With dead ends: 4872 [2021-11-22 21:43:37,614 INFO L226 Difference]: Without dead ends: 4870 [2021-11-22 21:43:37,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:37,618 INFO L933 BasicCegarLoop]: 6488 mSDtfsCounter, 6479 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6479 SdHoareTripleChecker+Valid, 6488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:37,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6479 Valid, 6488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:43:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2021-11-22 21:43:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4870. [2021-11-22 21:43:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4771 states have (on average 1.3600922238524418) internal successors, (6489), 4869 states have internal predecessors, (6489), 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-22 21:43:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 6489 transitions. [2021-11-22 21:43:37,870 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 6489 transitions. Word has length 12 [2021-11-22 21:43:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:37,875 INFO L470 AbstractCegarLoop]: Abstraction has 4870 states and 6489 transitions. [2021-11-22 21:43:37,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-22 21:43:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 6489 transitions. [2021-11-22 21:43:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 21:43:37,876 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:37,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:37,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-22 21:43:38,092 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-22 21:43:38,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2040833124, now seen corresponding path program 1 times [2021-11-22 21:43:38,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:38,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266663822] [2021-11-22 21:43:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:38,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:38,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:38,097 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-22 21:43:38,099 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-22 21:43:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:38,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:38,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:39,104 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-22 21:43:39,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:39,253 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-22 21:43:39,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266663822] [2021-11-22 21:43:39,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266663822] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:39,254 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:39,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:39,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221980229] [2021-11-22 21:43:39,254 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:39,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:39,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:39,255 INFO L87 Difference]: Start difference. First operand 4870 states and 6489 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-22 21:43:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:39,469 INFO L93 Difference]: Finished difference Result 4870 states and 6489 transitions. [2021-11-22 21:43:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-11-22 21:43:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:39,482 INFO L225 Difference]: With dead ends: 4870 [2021-11-22 21:43:39,482 INFO L226 Difference]: Without dead ends: 4868 [2021-11-22 21:43:39,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:39,484 INFO L933 BasicCegarLoop]: 6486 mSDtfsCounter, 6476 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6476 SdHoareTripleChecker+Valid, 6486 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:39,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6476 Valid, 6486 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:43:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2021-11-22 21:43:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4868. [2021-11-22 21:43:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4770 states have (on average 1.359958071278826) internal successors, (6487), 4867 states have internal predecessors, (6487), 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-22 21:43:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 6487 transitions. [2021-11-22 21:43:39,611 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 6487 transitions. Word has length 13 [2021-11-22 21:43:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:39,615 INFO L470 AbstractCegarLoop]: Abstraction has 4868 states and 6487 transitions. [2021-11-22 21:43:39,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-22 21:43:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 6487 transitions. [2021-11-22 21:43:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:43:39,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:39,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:39,634 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-22 21:43:39,833 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-22 21:43:39,834 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1158696462, now seen corresponding path program 1 times [2021-11-22 21:43:39,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613493143] [2021-11-22 21:43:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:39,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:39,846 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-22 21:43:39,848 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-22 21:43:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:40,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:40,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:40,844 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-22 21:43:40,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:41,032 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-22 21:43:41,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:41,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613493143] [2021-11-22 21:43:41,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613493143] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:41,035 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:41,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:41,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239736466] [2021-11-22 21:43:41,035 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:41,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:41,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:41,036 INFO L87 Difference]: Start difference. First operand 4868 states and 6487 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-22 21:43:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:42,425 INFO L93 Difference]: Finished difference Result 9990 states and 13292 transitions. [2021-11-22 21:43:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-11-22 21:43:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:42,439 INFO L225 Difference]: With dead ends: 9990 [2021-11-22 21:43:42,440 INFO L226 Difference]: Without dead ends: 5176 [2021-11-22 21:43:42,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:42,449 INFO L933 BasicCegarLoop]: 6824 mSDtfsCounter, 2511 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 11009 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:42,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2511 Valid, 11009 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 21:43:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2021-11-22 21:43:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 5164. [2021-11-22 21:43:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 5079 states have (on average 1.3477062413860996) internal successors, (6845), 5163 states have internal predecessors, (6845), 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-22 21:43:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 6845 transitions. [2021-11-22 21:43:42,593 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 6845 transitions. Word has length 14 [2021-11-22 21:43:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:42,594 INFO L470 AbstractCegarLoop]: Abstraction has 5164 states and 6845 transitions. [2021-11-22 21:43:42,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-22 21:43:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 6845 transitions. [2021-11-22 21:43:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 21:43:42,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:42,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:42,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-22 21:43:42,812 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-22 21:43:42,813 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1559865831, now seen corresponding path program 1 times [2021-11-22 21:43:42,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550068616] [2021-11-22 21:43:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:42,816 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:42,817 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-22 21:43:42,831 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-22 21:43:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:43,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:43,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:43,835 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-22 21:43:43,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:44,022 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-22 21:43:44,023 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:44,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550068616] [2021-11-22 21:43:44,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550068616] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:44,023 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:44,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:44,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352043728] [2021-11-22 21:43:44,023 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:44,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:44,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:44,024 INFO L87 Difference]: Start difference. First operand 5164 states and 6845 transitions. 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-22 21:43:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:44,421 INFO L93 Difference]: Finished difference Result 5164 states and 6845 transitions. [2021-11-22 21:43:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:44,421 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-22 21:43:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:44,437 INFO L225 Difference]: With dead ends: 5164 [2021-11-22 21:43:44,437 INFO L226 Difference]: Without dead ends: 5152 [2021-11-22 21:43:44,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:44,439 INFO L933 BasicCegarLoop]: 6443 mSDtfsCounter, 6290 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6290 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:44,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6290 Valid, 6563 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 21:43:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2021-11-22 21:43:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 5152. [2021-11-22 21:43:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5152 states, 5073 states have (on average 1.3469347526118667) internal successors, (6833), 5151 states have internal predecessors, (6833), 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-22 21:43:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 6833 transitions. [2021-11-22 21:43:44,575 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 6833 transitions. Word has length 15 [2021-11-22 21:43:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:44,575 INFO L470 AbstractCegarLoop]: Abstraction has 5152 states and 6833 transitions. [2021-11-22 21:43:44,575 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-22 21:43:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 6833 transitions. [2021-11-22 21:43:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 21:43:44,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:44,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:44,595 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-22 21:43:44,795 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-22 21:43:44,795 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1111214393, now seen corresponding path program 1 times [2021-11-22 21:43:44,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:44,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058233282] [2021-11-22 21:43:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:44,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:44,799 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-22 21:43:44,801 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-22 21:43:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:45,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:43:45,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:45,856 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-22 21:43:45,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:46,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-22 21:43:46,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:46,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058233282] [2021-11-22 21:43:46,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058233282] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:46,046 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:46,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:43:46,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369263481] [2021-11-22 21:43:46,046 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:46,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:43:46,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:43:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:46,047 INFO L87 Difference]: Start difference. First operand 5152 states and 6833 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-22 21:43:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:46,679 INFO L93 Difference]: Finished difference Result 5152 states and 6833 transitions. [2021-11-22 21:43:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:43:46,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-22 21:43:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:46,693 INFO L225 Difference]: With dead ends: 5152 [2021-11-22 21:43:46,694 INFO L226 Difference]: Without dead ends: 5115 [2021-11-22 21:43:46,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:43:46,695 INFO L933 BasicCegarLoop]: 6423 mSDtfsCounter, 6233 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6233 SdHoareTripleChecker+Valid, 6533 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:46,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6233 Valid, 6533 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 21:43:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2021-11-22 21:43:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 5115. [2021-11-22 21:43:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 5045 states have (on average 1.3462834489593658) internal successors, (6792), 5114 states have internal predecessors, (6792), 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-22 21:43:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6792 transitions. [2021-11-22 21:43:46,824 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6792 transitions. Word has length 16 [2021-11-22 21:43:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:46,825 INFO L470 AbstractCegarLoop]: Abstraction has 5115 states and 6792 transitions. [2021-11-22 21:43:46,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-22 21:43:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6792 transitions. [2021-11-22 21:43:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 21:43:46,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:46,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:46,849 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-22 21:43:47,049 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-22 21:43:47,050 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1649845849, now seen corresponding path program 1 times [2021-11-22 21:43:47,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:47,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170310625] [2021-11-22 21:43:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:47,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:47,053 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-22 21:43:47,054 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-22 21:43:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:47,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:43:47,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:48,247 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-22 21:43:48,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:48,702 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-22 21:43:48,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:48,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170310625] [2021-11-22 21:43:48,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170310625] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:48,703 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:48,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 21:43:48,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409557899] [2021-11-22 21:43:48,703 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:48,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 21:43:48,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:48,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 21:43:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 21:43:48,704 INFO L87 Difference]: Start difference. First operand 5115 states and 6792 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:43:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:43:49,750 INFO L93 Difference]: Finished difference Result 10181 states and 13517 transitions. [2021-11-22 21:43:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 21:43:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-22 21:43:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:43:49,772 INFO L225 Difference]: With dead ends: 10181 [2021-11-22 21:43:49,772 INFO L226 Difference]: Without dead ends: 5109 [2021-11-22 21:43:49,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:43:49,778 INFO L933 BasicCegarLoop]: 6406 mSDtfsCounter, 13 mSDsluCounter, 32000 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38406 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 21:43:49,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 38406 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 21:43:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2021-11-22 21:43:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5109. [2021-11-22 21:43:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 5039 states have (on average 1.346100416749355) internal successors, (6783), 5108 states have internal predecessors, (6783), 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-22 21:43:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 6783 transitions. [2021-11-22 21:43:49,907 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 6783 transitions. Word has length 33 [2021-11-22 21:43:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:43:49,908 INFO L470 AbstractCegarLoop]: Abstraction has 5109 states and 6783 transitions. [2021-11-22 21:43:49,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:43:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 6783 transitions. [2021-11-22 21:43:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 21:43:49,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:43:49,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:43:49,943 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-22 21:43:50,129 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-22 21:43:50,130 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:43:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:43:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -145948938, now seen corresponding path program 1 times [2021-11-22 21:43:50,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:43:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794455012] [2021-11-22 21:43:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:43:50,132 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:43:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:43:50,145 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-22 21:43:50,145 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-22 21:43:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:43:51,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 21:43:51,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:43:51,868 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-22 21:43:51,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:43:52,651 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-22 21:43:52,651 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:43:52,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794455012] [2021-11-22 21:43:52,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794455012] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:43:52,651 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:43:52,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-22 21:43:52,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116684178] [2021-11-22 21:43:52,652 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:43:52,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 21:43:52,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:43:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 21:43:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 21:43:52,652 INFO L87 Difference]: Start difference. First operand 5109 states and 6783 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-22 21:43:55,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:44:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:19,155 INFO L93 Difference]: Finished difference Result 17337 states and 22974 transitions. [2021-11-22 21:44:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 21:44:19,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-22 21:44:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:19,176 INFO L225 Difference]: With dead ends: 17337 [2021-11-22 21:44:19,176 INFO L226 Difference]: Without dead ends: 12271 [2021-11-22 21:44:19,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-22 21:44:19,186 INFO L933 BasicCegarLoop]: 14234 mSDtfsCounter, 8357 mSDsluCounter, 67526 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 104 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8357 SdHoareTripleChecker+Valid, 81760 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:19,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8357 Valid, 81760 Invalid, 2336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2231 Invalid, 1 Unknown, 0 Unchecked, 25.1s Time] [2021-11-22 21:44:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12271 states. [2021-11-22 21:44:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12271 to 5114. [2021-11-22 21:44:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 5044 states have (on average 1.3457573354480572) internal successors, (6788), 5113 states have internal predecessors, (6788), 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-22 21:44:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 6788 transitions. [2021-11-22 21:44:19,393 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 6788 transitions. Word has length 47 [2021-11-22 21:44:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:19,394 INFO L470 AbstractCegarLoop]: Abstraction has 5114 states and 6788 transitions. [2021-11-22 21:44:19,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-22 21:44:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 6788 transitions. [2021-11-22 21:44:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 21:44:19,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:19,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:19,423 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-22 21:44:19,621 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-22 21:44:19,621 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:44:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1647207171, now seen corresponding path program 1 times [2021-11-22 21:44:19,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288470687] [2021-11-22 21:44:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:19,623 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:19,625 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-22 21:44:19,626 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-22 21:44:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:20,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:44:20,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:21,154 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-22 21:44:21,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:21,396 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-22 21:44:21,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288470687] [2021-11-22 21:44:21,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288470687] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:21,397 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:21,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 21:44:21,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294101547] [2021-11-22 21:44:21,397 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:21,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:44:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:44:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:44:21,398 INFO L87 Difference]: Start difference. First operand 5114 states and 6788 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:44:21,918 INFO L93 Difference]: Finished difference Result 10179 states and 13512 transitions. [2021-11-22 21:44:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:44:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 21:44:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:44:21,928 INFO L225 Difference]: With dead ends: 10179 [2021-11-22 21:44:21,928 INFO L226 Difference]: Without dead ends: 5114 [2021-11-22 21:44:21,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:44:21,936 INFO L933 BasicCegarLoop]: 6398 mSDtfsCounter, 3 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19184 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 21:44:21,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 19184 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 21:44:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2021-11-22 21:44:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 5114. [2021-11-22 21:44:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 5044 states have (on average 1.3455590800951627) internal successors, (6787), 5113 states have internal predecessors, (6787), 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-22 21:44:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 6787 transitions. [2021-11-22 21:44:22,145 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 6787 transitions. Word has length 48 [2021-11-22 21:44:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:44:22,145 INFO L470 AbstractCegarLoop]: Abstraction has 5114 states and 6787 transitions. [2021-11-22 21:44:22,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 6787 transitions. [2021-11-22 21:44:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-22 21:44:22,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:44:22,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:44:22,175 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-22 21:44:22,365 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-22 21:44:22,365 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:44:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:44:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1499238855, now seen corresponding path program 1 times [2021-11-22 21:44:22,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:44:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231185882] [2021-11-22 21:44:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:44:22,367 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:44:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:44:22,369 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-22 21:44:22,372 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-22 21:44:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:44:23,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-22 21:44:23,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:44:25,469 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-22 21:44:25,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:44:27,213 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-22 21:44:27,214 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:44:27,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231185882] [2021-11-22 21:44:27,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231185882] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:44:27,214 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:44:27,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 17 [2021-11-22 21:44:27,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535054932] [2021-11-22 21:44:27,215 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:44:27,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 21:44:27,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:44:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 21:44:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-22 21:44:27,216 INFO L87 Difference]: Start difference. First operand 5114 states and 6787 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:44:33,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:23,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:28,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:33,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:46:37,339 WARN L534 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-22 21:46:40,891 WARN L534 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-22 21:46:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:46:51,936 INFO L93 Difference]: Finished difference Result 22527 states and 29917 transitions. [2021-11-22 21:46:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 21:46:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-22 21:46:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:46:51,964 INFO L225 Difference]: With dead ends: 22527 [2021-11-22 21:46:51,964 INFO L226 Difference]: Without dead ends: 17461 [2021-11-22 21:46:51,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2021-11-22 21:46:51,974 INFO L933 BasicCegarLoop]: 21570 mSDtfsCounter, 14441 mSDsluCounter, 249153 mSDsCounter, 0 mSdLazyCounter, 7667 mSolverCounterSat, 178 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14441 SdHoareTripleChecker+Valid, 270723 SdHoareTripleChecker+Invalid, 7851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 7667 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 137.9s IncrementalHoareTripleChecker+Time [2021-11-22 21:46:51,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14441 Valid, 270723 Invalid, 7851 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [178 Valid, 7667 Invalid, 4 Unknown, 2 Unchecked, 137.9s Time] [2021-11-22 21:46:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17461 states. [2021-11-22 21:46:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17461 to 5108. [2021-11-22 21:46:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5108 states, 5038 states have (on average 1.3457721317983327) internal successors, (6780), 5107 states have internal predecessors, (6780), 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-22 21:46:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 6780 transitions. [2021-11-22 21:46:52,232 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 6780 transitions. Word has length 50 [2021-11-22 21:46:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:46:52,232 INFO L470 AbstractCegarLoop]: Abstraction has 5108 states and 6780 transitions. [2021-11-22 21:46:52,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:46:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 6780 transitions. [2021-11-22 21:46:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 21:46:52,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:46:52,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:46:52,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-22 21:46:52,447 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-22 21:46:52,447 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:46:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:46:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1805428016, now seen corresponding path program 1 times [2021-11-22 21:46:52,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:46:52,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649755298] [2021-11-22 21:46:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:46:52,449 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:46:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:46:52,451 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-22 21:46:52,452 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-22 21:46:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:46:53,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 21:46:53,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:46:54,069 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-22 21:46:54,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:46:54,324 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-22 21:46:54,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:46:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649755298] [2021-11-22 21:46:54,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649755298] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:46:54,325 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:46:54,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 21:46:54,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254850967] [2021-11-22 21:46:54,325 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:46:54,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:46:54,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:46:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:46:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:46:54,326 INFO L87 Difference]: Start difference. First operand 5108 states and 6780 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-22 21:47:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:47:00,574 INFO L93 Difference]: Finished difference Result 11324 states and 15003 transitions. [2021-11-22 21:47:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:47:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2021-11-22 21:47:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:47:00,584 INFO L225 Difference]: With dead ends: 11324 [2021-11-22 21:47:00,584 INFO L226 Difference]: Without dead ends: 6258 [2021-11-22 21:47:00,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:47:00,591 INFO L933 BasicCegarLoop]: 6465 mSDtfsCounter, 9668 mSDsluCounter, 5396 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9668 SdHoareTripleChecker+Valid, 11861 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-22 21:47:00,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9668 Valid, 11861 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-11-22 21:47:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6258 states. [2021-11-22 21:47:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6258 to 5108. [2021-11-22 21:47:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5108 states, 5038 states have (on average 1.3455736403334657) internal successors, (6779), 5107 states have internal predecessors, (6779), 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-22 21:47:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 6779 transitions. [2021-11-22 21:47:00,829 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 6779 transitions. Word has length 51 [2021-11-22 21:47:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:47:00,829 INFO L470 AbstractCegarLoop]: Abstraction has 5108 states and 6779 transitions. [2021-11-22 21:47:00,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-22 21:47:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 6779 transitions. [2021-11-22 21:47:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 21:47:00,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:47:00,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:47:00,871 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-22 21:47:01,049 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-22 21:47:01,049 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:47:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:47:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1103828142, now seen corresponding path program 1 times [2021-11-22 21:47:01,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:47:01,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394856960] [2021-11-22 21:47:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:47:01,051 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:47:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:47:01,053 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-22 21:47:01,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-22 21:47:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:47:02,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:47:02,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:47:02,952 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-22 21:47:02,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:47:03,501 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-22 21:47:03,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:47:03,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394856960] [2021-11-22 21:47:03,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394856960] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:47:03,502 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:47:03,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-22 21:47:03,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425681524] [2021-11-22 21:47:03,502 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:47:03,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:47:03,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:47:03,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:47:03,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:47:03,503 INFO L87 Difference]: Start difference. First operand 5108 states and 6779 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-22 21:47:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:47:04,181 INFO L93 Difference]: Finished difference Result 16995 states and 22377 transitions. [2021-11-22 21:47:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:47:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 51 [2021-11-22 21:47:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:47:04,195 INFO L225 Difference]: With dead ends: 16995 [2021-11-22 21:47:04,195 INFO L226 Difference]: Without dead ends: 11934 [2021-11-22 21:47:04,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:47:04,202 INFO L933 BasicCegarLoop]: 6391 mSDtfsCounter, 12295 mSDsluCounter, 10337 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12295 SdHoareTripleChecker+Valid, 16728 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:47:04,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12295 Valid, 16728 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:47:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11934 states. [2021-11-22 21:47:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11934 to 9194. [2021-11-22 21:47:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9194 states, 9124 states have (on average 1.3353792196405085) internal successors, (12184), 9193 states have internal predecessors, (12184), 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-22 21:47:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9194 states to 9194 states and 12184 transitions. [2021-11-22 21:47:04,606 INFO L78 Accepts]: Start accepts. Automaton has 9194 states and 12184 transitions. Word has length 51 [2021-11-22 21:47:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:47:04,607 INFO L470 AbstractCegarLoop]: Abstraction has 9194 states and 12184 transitions. [2021-11-22 21:47:04,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-22 21:47:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9194 states and 12184 transitions. [2021-11-22 21:47:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 21:47:04,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:47:04,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:47:04,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-22 21:47:04,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:47:04,819 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:47:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:47:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash 250716310, now seen corresponding path program 1 times [2021-11-22 21:47:04,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:47:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458338892] [2021-11-22 21:47:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:47:04,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:47:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:47:04,823 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:47:04,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-22 21:47:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:47:06,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:47:06,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:47:06,374 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-22 21:47:06,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:47:06,495 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-22 21:47:06,495 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:47:06,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458338892] [2021-11-22 21:47:06,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458338892] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:47:06,495 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:47:06,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:47:06,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66179839] [2021-11-22 21:47:06,495 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:47:06,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:47:06,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:47:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:47:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:47:06,496 INFO L87 Difference]: Start difference. First operand 9194 states and 12184 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 21:47:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:47:07,548 INFO L93 Difference]: Finished difference Result 9194 states and 12184 transitions. [2021-11-22 21:47:07,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:47:07,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2021-11-22 21:47:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:47:07,559 INFO L225 Difference]: With dead ends: 9194 [2021-11-22 21:47:07,559 INFO L226 Difference]: Without dead ends: 7902 [2021-11-22 21:47:07,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:47:07,568 INFO L933 BasicCegarLoop]: 5040 mSDtfsCounter, 3096 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 21:47:07,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3096 Valid, 6963 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 21:47:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2021-11-22 21:47:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7902. [2021-11-22 21:47:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7902 states, 7863 states have (on average 1.327737504769172) internal successors, (10440), 7901 states have internal predecessors, (10440), 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-22 21:47:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7902 states to 7902 states and 10440 transitions. [2021-11-22 21:47:07,971 INFO L78 Accepts]: Start accepts. Automaton has 7902 states and 10440 transitions. Word has length 51 [2021-11-22 21:47:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:47:07,972 INFO L470 AbstractCegarLoop]: Abstraction has 7902 states and 10440 transitions. [2021-11-22 21:47:07,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 21:47:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7902 states and 10440 transitions. [2021-11-22 21:47:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 21:47:07,974 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:47:07,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:47:08,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-22 21:47:08,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:47:08,187 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 98 more)] === [2021-11-22 21:47:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:47:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -657646171, now seen corresponding path program 1 times [2021-11-22 21:47:08,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:47:08,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739606640] [2021-11-22 21:47:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:47:08,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:47:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:47:08,191 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:47:08,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process Killed by 15