/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:00:20,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:00:20,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:00:20,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:00:20,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:00:20,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:00:20,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:00:20,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:00:20,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:00:20,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:00:20,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:00:20,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:00:20,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:00:20,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:00:20,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:00:20,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:00:20,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:00:20,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:00:20,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:00:20,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:00:20,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:00:20,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:00:20,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:00:20,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:00:20,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:00:20,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:00:20,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:00:20,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:00:20,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:00:20,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:00:20,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:00:20,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:00:20,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:00:20,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:00:20,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:00:20,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:00:20,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:00:20,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:00:20,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:00:20,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:00:20,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:00:20,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:00:20,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:00:20,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:00:20,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:00:20,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:00:20,127 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:00:20,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:00:20,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:00:20,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:00:20,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:00:20,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:00:20,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:00:20,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:00:20,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:00:20,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:00:20,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:00:20,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:00:20,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:00:20,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:00:20,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:00:20,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:00:20,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:00:20,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:20,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:00:20,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:00:20,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:00:20,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:00:20,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:00:20,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:00:20,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:00:20,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:00:20,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:00:20,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:00:20,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:00:20,419 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:00:20,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-27 03:00:20,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63006e0de/2bcd4ae175354457b230550fabb71759/FLAG850fd57a0 [2019-12-27 03:00:21,040 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:00:21,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-27 03:00:21,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63006e0de/2bcd4ae175354457b230550fabb71759/FLAG850fd57a0 [2019-12-27 03:00:21,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63006e0de/2bcd4ae175354457b230550fabb71759 [2019-12-27 03:00:21,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:00:21,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:00:21,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:21,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:00:21,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:00:21,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:21" (1/1) ... [2019-12-27 03:00:21,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:21, skipping insertion in model container [2019-12-27 03:00:21,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:21" (1/1) ... [2019-12-27 03:00:21,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:00:21,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:00:21,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:21,908 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:00:21,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:22,048 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:00:22,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22 WrapperNode [2019-12-27 03:00:22,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:22,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:22,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:00:22,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:00:22,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:22,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:00:22,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:00:22,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:00:22,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... [2019-12-27 03:00:22,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:00:22,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:00:22,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:00:22,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:00:22,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:00:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:00:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:00:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:00:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:00:22,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:00:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:00:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:00:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:00:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:00:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:00:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:00:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:00:22,221 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:00:22,919 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:00:22,920 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:00:22,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:22 BoogieIcfgContainer [2019-12-27 03:00:22,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:00:22,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:00:22,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:00:22,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:00:22,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:00:21" (1/3) ... [2019-12-27 03:00:22,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58045119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:22, skipping insertion in model container [2019-12-27 03:00:22,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:22" (2/3) ... [2019-12-27 03:00:22,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58045119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:22, skipping insertion in model container [2019-12-27 03:00:22,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:22" (3/3) ... [2019-12-27 03:00:22,929 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2019-12-27 03:00:22,939 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:00:22,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:00:22,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:00:22,951 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:00:22,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,028 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,028 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:23,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:00:23,090 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:00:23,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:00:23,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:00:23,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:00:23,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:00:23,091 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:00:23,091 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:00:23,091 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:00:23,108 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 03:00:23,109 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:00:23,217 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:00:23,217 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:23,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:00:23,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:00:23,290 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:00:23,290 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:23,296 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:00:23,309 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 03:00:23,310 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:00:28,121 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:00:28,235 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 03:00:28,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:00:28,238 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:00:29,138 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 03:00:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 03:00:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 03:00:29,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:29,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:29,149 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 03:00:29,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:29,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923233114] [2019-12-27 03:00:29,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:29,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923233114] [2019-12-27 03:00:29,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:29,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:00:29,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8192838] [2019-12-27 03:00:29,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:29,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:29,514 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 03:00:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:30,043 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 03:00:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:30,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 03:00:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:30,319 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 03:00:30,319 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 03:00:30,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 03:00:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 03:00:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 03:00:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 03:00:31,180 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 03:00:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:31,181 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 03:00:31,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 03:00:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:31,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:31,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:31,194 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 03:00:31,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:31,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404828651] [2019-12-27 03:00:31,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:31,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404828651] [2019-12-27 03:00:31,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:31,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:31,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310235583] [2019-12-27 03:00:31,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:31,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:31,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:31,325 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-27 03:00:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:31,922 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 03:00:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:31,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:00:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:32,022 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 03:00:32,023 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 03:00:32,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 03:00:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 03:00:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 03:00:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 03:00:34,142 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 03:00:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:34,142 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 03:00:34,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 03:00:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:34,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:34,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:34,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 03:00:34,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:34,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423476795] [2019-12-27 03:00:34,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:34,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423476795] [2019-12-27 03:00:34,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:34,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:34,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284331946] [2019-12-27 03:00:34,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:34,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:34,191 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 03:00:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:34,252 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 03:00:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:34,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:00:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:34,298 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 03:00:34,298 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 03:00:34,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 03:00:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 03:00:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 03:00:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 03:00:34,642 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 03:00:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:34,642 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 03:00:34,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 03:00:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:00:34,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:34,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:34,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 03:00:34,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:34,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194822493] [2019-12-27 03:00:34,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:34,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194822493] [2019-12-27 03:00:34,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:34,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:34,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606365591] [2019-12-27 03:00:34,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:34,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:34,700 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 03:00:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:34,726 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 03:00:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:00:34,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:00:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:34,731 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 03:00:34,731 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 03:00:34,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 03:00:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 03:00:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 03:00:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 03:00:34,766 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 03:00:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:34,766 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 03:00:34,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 03:00:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:00:34,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:34,769 INFO L411 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] [2019-12-27 03:00:34,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 03:00:34,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:34,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827989091] [2019-12-27 03:00:34,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827989091] [2019-12-27 03:00:34,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:34,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:34,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660832052] [2019-12-27 03:00:34,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:34,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:34,863 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-27 03:00:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:34,893 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 03:00:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:34,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 03:00:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:34,896 INFO L225 Difference]: With dead ends: 653 [2019-12-27 03:00:34,896 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 03:00:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 03:00:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 03:00:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 03:00:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 03:00:34,907 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 03:00:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:34,907 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 03:00:34,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 03:00:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:34,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:34,913 INFO L411 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] [2019-12-27 03:00:34,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 03:00:34,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:34,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747134187] [2019-12-27 03:00:34,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:35,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747134187] [2019-12-27 03:00:35,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:35,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:35,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912303058] [2019-12-27 03:00:35,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:35,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:35,024 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 03:00:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:35,079 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 03:00:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:35,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:35,081 INFO L225 Difference]: With dead ends: 607 [2019-12-27 03:00:35,081 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 03:00:35,081 INFO L631 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 [2019-12-27 03:00:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 03:00:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 03:00:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 03:00:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 03:00:35,091 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 03:00:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:35,092 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 03:00:35,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 03:00:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:35,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:35,094 INFO L411 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] [2019-12-27 03:00:35,094 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 03:00:35,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:35,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024077803] [2019-12-27 03:00:35,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:35,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024077803] [2019-12-27 03:00:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071917436] [2019-12-27 03:00:35,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:35,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:35,228 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-27 03:00:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:35,573 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-27 03:00:35,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:35,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 03:00:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:35,575 INFO L225 Difference]: With dead ends: 892 [2019-12-27 03:00:35,576 INFO L226 Difference]: Without dead ends: 892 [2019-12-27 03:00:35,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-27 03:00:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-27 03:00:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 03:00:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-27 03:00:35,589 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-27 03:00:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:35,589 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-27 03:00:35,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-27 03:00:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:35,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:35,591 INFO L411 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] [2019-12-27 03:00:35,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-27 03:00:35,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:35,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751242105] [2019-12-27 03:00:35,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:35,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751242105] [2019-12-27 03:00:35,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:35,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:35,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596096214] [2019-12-27 03:00:35,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:35,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:35,690 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-27 03:00:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:35,998 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-27 03:00:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:35,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 03:00:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:36,000 INFO L225 Difference]: With dead ends: 1189 [2019-12-27 03:00:36,000 INFO L226 Difference]: Without dead ends: 1189 [2019-12-27 03:00:36,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-27 03:00:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-27 03:00:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 03:00:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-27 03:00:36,017 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-27 03:00:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:36,017 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-27 03:00:36,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-27 03:00:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:36,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:36,020 INFO L411 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] [2019-12-27 03:00:36,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-27 03:00:36,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:36,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853710951] [2019-12-27 03:00:36,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:36,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853710951] [2019-12-27 03:00:36,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:36,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:36,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663896012] [2019-12-27 03:00:36,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:36,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:36,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:36,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:36,139 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 6 states. [2019-12-27 03:00:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:36,466 INFO L93 Difference]: Finished difference Result 1185 states and 2766 transitions. [2019-12-27 03:00:36,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:00:36,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 03:00:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:36,468 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 03:00:36,469 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 03:00:36,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:00:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 03:00:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 839. [2019-12-27 03:00:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-12-27 03:00:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1986 transitions. [2019-12-27 03:00:36,486 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1986 transitions. Word has length 55 [2019-12-27 03:00:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:36,486 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1986 transitions. [2019-12-27 03:00:36,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1986 transitions. [2019-12-27 03:00:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:36,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:36,489 INFO L411 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] [2019-12-27 03:00:36,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 817618467, now seen corresponding path program 4 times [2019-12-27 03:00:36,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:36,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694417883] [2019-12-27 03:00:36,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:36,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694417883] [2019-12-27 03:00:36,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:36,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049051260] [2019-12-27 03:00:36,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:36,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:36,540 INFO L87 Difference]: Start difference. First operand 839 states and 1986 transitions. Second operand 3 states. [2019-12-27 03:00:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:36,553 INFO L93 Difference]: Finished difference Result 737 states and 1703 transitions. [2019-12-27 03:00:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:36,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:36,555 INFO L225 Difference]: With dead ends: 737 [2019-12-27 03:00:36,555 INFO L226 Difference]: Without dead ends: 737 [2019-12-27 03:00:36,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-27 03:00:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-12-27 03:00:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-27 03:00:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1703 transitions. [2019-12-27 03:00:36,567 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1703 transitions. Word has length 55 [2019-12-27 03:00:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:36,567 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1703 transitions. [2019-12-27 03:00:36,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1703 transitions. [2019-12-27 03:00:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:00:36,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:36,570 INFO L411 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] [2019-12-27 03:00:36,570 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-27 03:00:36,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:36,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850983324] [2019-12-27 03:00:36,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:36,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850983324] [2019-12-27 03:00:36,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:36,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:36,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464341530] [2019-12-27 03:00:36,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:36,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:36,707 INFO L87 Difference]: Start difference. First operand 737 states and 1703 transitions. Second operand 3 states. [2019-12-27 03:00:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:36,760 INFO L93 Difference]: Finished difference Result 736 states and 1701 transitions. [2019-12-27 03:00:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 03:00:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:36,762 INFO L225 Difference]: With dead ends: 736 [2019-12-27 03:00:36,762 INFO L226 Difference]: Without dead ends: 736 [2019-12-27 03:00:36,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-27 03:00:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 473. [2019-12-27 03:00:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 03:00:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-27 03:00:36,778 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-27 03:00:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:36,778 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-27 03:00:36,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-27 03:00:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:36,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:36,782 INFO L411 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] [2019-12-27 03:00:36,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-27 03:00:36,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:36,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746601203] [2019-12-27 03:00:36,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:37,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746601203] [2019-12-27 03:00:37,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:37,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:37,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938156725] [2019-12-27 03:00:37,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:00:37,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:00:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:37,050 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 7 states. [2019-12-27 03:00:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:37,177 INFO L93 Difference]: Finished difference Result 879 states and 1872 transitions. [2019-12-27 03:00:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:00:37,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 03:00:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:37,179 INFO L225 Difference]: With dead ends: 879 [2019-12-27 03:00:37,179 INFO L226 Difference]: Without dead ends: 578 [2019-12-27 03:00:37,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:00:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-27 03:00:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-27 03:00:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 03:00:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 03:00:37,188 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-27 03:00:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:37,189 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 03:00:37,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:00:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 03:00:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:37,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:37,190 INFO L411 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] [2019-12-27 03:00:37,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-27 03:00:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375264873] [2019-12-27 03:00:37,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:37,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375264873] [2019-12-27 03:00:37,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:37,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:37,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815364973] [2019-12-27 03:00:37,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:37,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:37,350 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-27 03:00:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:37,425 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-27 03:00:37,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:37,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 03:00:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:37,426 INFO L225 Difference]: With dead ends: 644 [2019-12-27 03:00:37,426 INFO L226 Difference]: Without dead ends: 231 [2019-12-27 03:00:37,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:00:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-27 03:00:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-27 03:00:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 03:00:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 03:00:37,433 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 03:00:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 03:00:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 03:00:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:37,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:37,434 INFO L411 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] [2019-12-27 03:00:37,434 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-27 03:00:37,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:37,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502437591] [2019-12-27 03:00:37,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:37,721 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-12-27 03:00:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:37,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502437591] [2019-12-27 03:00:37,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:37,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:00:37,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779066524] [2019-12-27 03:00:37,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:00:37,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:00:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:00:37,900 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 17 states. [2019-12-27 03:00:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:39,070 INFO L93 Difference]: Finished difference Result 495 states and 855 transitions. [2019-12-27 03:00:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:00:39,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-12-27 03:00:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:39,071 INFO L225 Difference]: With dead ends: 495 [2019-12-27 03:00:39,071 INFO L226 Difference]: Without dead ends: 465 [2019-12-27 03:00:39,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:00:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-12-27 03:00:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 317. [2019-12-27 03:00:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 03:00:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-27 03:00:39,079 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 57 [2019-12-27 03:00:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:39,079 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-27 03:00:39,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:00:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-27 03:00:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:39,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:39,081 INFO L411 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] [2019-12-27 03:00:39,081 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash -154882273, now seen corresponding path program 4 times [2019-12-27 03:00:39,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:39,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948003112] [2019-12-27 03:00:39,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:39,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948003112] [2019-12-27 03:00:39,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:39,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:00:39,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662089259] [2019-12-27 03:00:39,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:00:39,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:00:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:00:39,325 INFO L87 Difference]: Start difference. First operand 317 states and 554 transitions. Second operand 14 states. [2019-12-27 03:00:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:40,013 INFO L93 Difference]: Finished difference Result 513 states and 867 transitions. [2019-12-27 03:00:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:00:40,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 03:00:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:40,014 INFO L225 Difference]: With dead ends: 513 [2019-12-27 03:00:40,014 INFO L226 Difference]: Without dead ends: 483 [2019-12-27 03:00:40,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 03:00:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-27 03:00:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 313. [2019-12-27 03:00:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-12-27 03:00:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 546 transitions. [2019-12-27 03:00:40,021 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 546 transitions. Word has length 57 [2019-12-27 03:00:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:40,021 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 546 transitions. [2019-12-27 03:00:40,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:00:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 546 transitions. [2019-12-27 03:00:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:40,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:40,023 INFO L411 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] [2019-12-27 03:00:40,023 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 618212177, now seen corresponding path program 5 times [2019-12-27 03:00:40,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:40,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537006918] [2019-12-27 03:00:40,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:40,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537006918] [2019-12-27 03:00:40,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:40,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:00:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420502101] [2019-12-27 03:00:40,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:00:40,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:00:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:00:40,307 INFO L87 Difference]: Start difference. First operand 313 states and 546 transitions. Second operand 12 states. [2019-12-27 03:00:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:40,710 INFO L93 Difference]: Finished difference Result 413 states and 699 transitions. [2019-12-27 03:00:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:00:40,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 03:00:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:40,712 INFO L225 Difference]: With dead ends: 413 [2019-12-27 03:00:40,712 INFO L226 Difference]: Without dead ends: 383 [2019-12-27 03:00:40,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:00:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-27 03:00:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 315. [2019-12-27 03:00:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 03:00:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-27 03:00:40,719 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-27 03:00:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:40,719 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-27 03:00:40,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:00:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-27 03:00:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:40,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:40,721 INFO L411 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] [2019-12-27 03:00:40,721 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 6 times [2019-12-27 03:00:40,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:40,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668149235] [2019-12-27 03:00:40,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:40,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:00:40,820 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:00:40,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= (select .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_26|) 0) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1498~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1498~0.base_26|) |v_ULTIMATE.start_main_~#t1498~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y$w_buff0_used~0_650 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1498~0.base_26| 4)) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1498~0.base_26|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= |v_ULTIMATE.start_main_~#t1498~0.offset_19| 0) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_26| 1)) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_26|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1498~0.base=|v_ULTIMATE.start_main_~#t1498~0.base_26|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ULTIMATE.start_main_~#t1498~0.offset=|v_ULTIMATE.start_main_~#t1498~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t1499~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1499~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1500~0.offset, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1500~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1498~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:00:40,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t1499~0.offset_11| 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1499~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13|) |v_ULTIMATE.start_main_~#t1499~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_13|, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1499~0.base, ULTIMATE.start_main_~#t1499~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 03:00:40,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t1500~0.offset_10| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1500~0.base_12| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12|) |v_ULTIMATE.start_main_~#t1500~0.offset_10| 2)) |v_#memory_int_15|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12| 1) |v_#valid_38|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1500~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1500~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1500~0.base] because there is no mapped edge [2019-12-27 03:00:40,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:00:40,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 03:00:40,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1645016635 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1645016635 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1645016635|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1645016635 |P2Thread1of1ForFork0_#t~ite11_Out1645016635|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1645016635, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1645016635} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1645016635, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1645016635|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1645016635} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 03:00:40,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In821807400 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In821807400 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out821807400| ~y$w_buff1~0_In821807400) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out821807400| ~y~0_In821807400) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In821807400, ~y$w_buff1~0=~y$w_buff1~0_In821807400, ~y~0=~y~0_In821807400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In821807400} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In821807400, ~y$w_buff1~0=~y$w_buff1~0_In821807400, ~y~0=~y~0_In821807400, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out821807400|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In821807400} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:00:40,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:00:40,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1004103431 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1004103431 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-1004103431| ~y$w_buff0_used~0_In-1004103431)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1004103431| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004103431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004103431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004103431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004103431, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1004103431|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:00:40,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In652403206 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In652403206 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In652403206 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In652403206 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out652403206| ~y$w_buff1_used~0_In652403206)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite6_Out652403206| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In652403206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In652403206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In652403206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In652403206} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In652403206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In652403206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In652403206, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out652403206|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In652403206} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:00:40,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1356830127 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1356830127 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1356830127| ~y$r_buff0_thd2~0_In1356830127)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out1356830127| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1356830127, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1356830127} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1356830127, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1356830127, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1356830127|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:00:40,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1435296545 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1435296545 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1435296545 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1435296545 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-1435296545|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1435296545 |P2Thread1of1ForFork0_#t~ite12_Out-1435296545|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1435296545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1435296545, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1435296545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1435296545} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1435296545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1435296545, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1435296545|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1435296545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1435296545} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 03:00:40,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In715836979 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In715836979 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In715836979 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In715836979 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out715836979| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite8_Out715836979| ~y$r_buff1_thd2~0_In715836979) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In715836979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In715836979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In715836979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In715836979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In715836979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In715836979, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out715836979|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In715836979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In715836979} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:00:40,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 03:00:40,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-452276678 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-452276678 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-452276678 ~y$r_buff0_thd3~0_In-452276678) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out-452276678 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-452276678, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-452276678} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-452276678, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-452276678, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-452276678|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 03:00:40,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1254092638 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1254092638 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1254092638 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1254092638 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1254092638|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out1254092638| ~y$r_buff1_thd3~0_In1254092638)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1254092638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1254092638, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1254092638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254092638} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1254092638|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1254092638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1254092638, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1254092638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254092638} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:00:40,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 03:00:40,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:00:40,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1248837731 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1248837731 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1248837731 |ULTIMATE.start_main_#t~ite18_Out-1248837731|)) (and (or .cse0 .cse1) (= ~y~0_In-1248837731 |ULTIMATE.start_main_#t~ite18_Out-1248837731|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1248837731, ~y~0=~y~0_In-1248837731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1248837731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1248837731} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1248837731, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1248837731|, ~y~0=~y~0_In-1248837731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1248837731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1248837731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:00:40,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 03:00:40,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In724936625 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In724936625 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out724936625|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out724936625| ~y$w_buff0_used~0_In724936625) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In724936625, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In724936625} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In724936625, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In724936625, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out724936625|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:00:40,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In432206974 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In432206974 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In432206974 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In432206974 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In432206974 |ULTIMATE.start_main_#t~ite21_Out432206974|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out432206974|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In432206974, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In432206974, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In432206974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432206974} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In432206974, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In432206974, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out432206974|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In432206974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432206974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:00:40,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-532199682 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-532199682 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-532199682| ~y$r_buff0_thd0~0_In-532199682) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-532199682|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-532199682, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532199682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-532199682, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532199682, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-532199682|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:00:40,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-635839008 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-635839008 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-635839008 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-635839008 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-635839008 |ULTIMATE.start_main_#t~ite23_Out-635839008|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite23_Out-635839008| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-635839008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-635839008, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-635839008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635839008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-635839008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-635839008, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-635839008, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-635839008|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635839008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:00:40,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1244534672 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-1244534672| |ULTIMATE.start_main_#t~ite30_Out-1244534672|) (= |ULTIMATE.start_main_#t~ite29_Out-1244534672| ~y$w_buff0~0_In-1244534672) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1244534672 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1244534672 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1244534672 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1244534672 256)) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite30_Out-1244534672| ~y$w_buff0~0_In-1244534672) (= |ULTIMATE.start_main_#t~ite29_In-1244534672| |ULTIMATE.start_main_#t~ite29_Out-1244534672|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1244534672, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1244534672|, ~y$w_buff0~0=~y$w_buff0~0_In-1244534672, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1244534672, ~weak$$choice2~0=~weak$$choice2~0_In-1244534672, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1244534672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1244534672} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1244534672|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1244534672, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1244534672|, ~y$w_buff0~0=~y$w_buff0~0_In-1244534672, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1244534672, ~weak$$choice2~0=~weak$$choice2~0_In-1244534672, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1244534672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1244534672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:00:40,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:00:40,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:00:40,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:00:40,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:00:40 BasicIcfg [2019-12-27 03:00:40,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:00:40,922 INFO L168 Benchmark]: Toolchain (without parser) took 19599.27 ms. Allocated memory was 137.9 MB in the beginning and 888.1 MB in the end (delta: 750.3 MB). Free memory was 100.7 MB in the beginning and 181.3 MB in the end (delta: -80.6 MB). Peak memory consumption was 669.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,922 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.08 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 154.2 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 202.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,924 INFO L168 Benchmark]: Boogie Preprocessor took 38.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,925 INFO L168 Benchmark]: RCFGBuilder took 765.46 ms. Allocated memory is still 202.4 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,926 INFO L168 Benchmark]: TraceAbstraction took 17997.52 ms. Allocated memory was 202.4 MB in the beginning and 888.1 MB in the end (delta: 685.8 MB). Free memory was 101.9 MB in the beginning and 181.3 MB in the end (delta: -79.4 MB). Peak memory consumption was 606.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:40,929 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.08 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 154.2 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.63 ms. Allocated memory is still 202.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.46 ms. Allocated memory is still 202.4 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17997.52 ms. Allocated memory was 202.4 MB in the beginning and 888.1 MB in the end (delta: 685.8 MB). Free memory was 101.9 MB in the beginning and 181.3 MB in the end (delta: -79.4 MB). Peak memory consumption was 606.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1581 SDtfs, 1670 SDslu, 4177 SDs, 0 SdLazy, 2692 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 4613 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 135259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...