/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/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:37:42,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:37:42,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:37:42,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:37:42,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:37:42,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:37:42,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:37:42,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:37:42,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:37:42,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:37:42,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:37:42,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:37:42,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:37:42,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:37:42,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:37:42,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:37:42,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:37:42,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:37:42,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:37:42,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:37:42,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:37:42,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:37:42,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:37:42,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:37:42,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:37:42,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:37:42,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:37:42,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:37:42,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:37:42,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:37:42,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:37:42,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:37:42,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:37:42,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:37:42,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:37:42,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:37:42,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:37:42,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:37:42,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:37:42,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:37:42,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:37:42,197 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:37:42,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:37:42,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:37:42,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:37:42,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:37:42,223 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:37:42,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:37:42,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:37:42,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:37:42,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:37:42,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:37:42,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:37:42,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:37:42,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:37:42,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:37:42,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:37:42,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:37:42,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:37:42,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:37:42,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:37:42,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:37:42,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:37:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:37:42,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:37:42,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:37:42,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:37:42,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:37:42,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:37:42,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:37:42,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:37:42,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:37:42,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:37:42,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:37:42,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:37:42,570 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:37:42,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 03:37:42,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b2fcf92/9417d89bcdfb4fe3a119d811c767b705/FLAGb4a1a5534 [2019-12-27 03:37:43,215 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:37:43,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 03:37:43,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b2fcf92/9417d89bcdfb4fe3a119d811c767b705/FLAGb4a1a5534 [2019-12-27 03:37:43,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b2fcf92/9417d89bcdfb4fe3a119d811c767b705 [2019-12-27 03:37:43,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:37:43,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:37:43,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:43,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:37:43,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:37:43,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:43" (1/1) ... [2019-12-27 03:37:43,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a84e0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:43, skipping insertion in model container [2019-12-27 03:37:43,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:43" (1/1) ... [2019-12-27 03:37:43,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:37:43,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:37:44,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:44,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:37:44,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:44,273 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:37:44,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44 WrapperNode [2019-12-27 03:37:44,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:44,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:44,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:37:44,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:37:44,285 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:37:44" (1/1) ... [2019-12-27 03:37:44,306 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:37:44" (1/1) ... [2019-12-27 03:37:44,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:44,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:37:44,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:37:44,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:37:44,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (1/1) ... [2019-12-27 03:37:44,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:37:44,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:37:44,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:37:44,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:37:44,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (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:37:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:37:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:37:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:37:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:37:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:37:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:37:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:37:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:37:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:37:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:37:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:37:44,461 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:37:45,216 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:37:45,216 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:37:45,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:45 BoogieIcfgContainer [2019-12-27 03:37:45,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:37:45,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:37:45,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:37:45,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:37:45,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:37:43" (1/3) ... [2019-12-27 03:37:45,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59683fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:45, skipping insertion in model container [2019-12-27 03:37:45,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:44" (2/3) ... [2019-12-27 03:37:45,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59683fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:45, skipping insertion in model container [2019-12-27 03:37:45,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:45" (3/3) ... [2019-12-27 03:37:45,227 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-27 03:37:45,238 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:37:45,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:37:45,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:37:45,247 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:37:45,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,286 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,286 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:45,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:37:45,360 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:37:45,361 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:37:45,361 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:37:45,361 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:37:45,361 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:37:45,361 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:37:45,362 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:37:45,362 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:37:45,380 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 03:37:45,382 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 03:37:45,503 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 03:37:45,504 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:45,519 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:37:45,538 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 03:37:45,585 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 03:37:45,586 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:45,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:37:45,603 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 03:37:45,604 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:37:50,132 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 03:37:50,237 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 03:37:50,269 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-27 03:37:50,269 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 03:37:50,273 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-27 03:37:50,801 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-27 03:37:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-27 03:37:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:37:50,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:50,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:37:50,813 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-27 03:37:50,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:50,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371407455] [2019-12-27 03:37:50,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:51,054 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:37:51,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371407455] [2019-12-27 03:37:51,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:51,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:37:51,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289616080] [2019-12-27 03:37:51,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:51,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:51,074 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-27 03:37:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:51,375 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-27 03:37:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:37:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:51,466 INFO L225 Difference]: With dead ends: 8604 [2019-12-27 03:37:51,466 INFO L226 Difference]: Without dead ends: 8436 [2019-12-27 03:37:51,467 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:37:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-27 03:37:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-27 03:37:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 03:37:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-27 03:37:51,973 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-27 03:37:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:51,974 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-27 03:37:51,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-27 03:37:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:37:51,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:51,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:51,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-27 03:37:51,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:51,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042536038] [2019-12-27 03:37:51,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:52,145 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:37:52,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042536038] [2019-12-27 03:37:52,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402898492] [2019-12-27 03:37:52,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:52,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:52,150 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-27 03:37:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:52,601 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-27 03:37:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:52,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:37:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:52,682 INFO L225 Difference]: With dead ends: 13130 [2019-12-27 03:37:52,682 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 03:37:52,683 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:37:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 03:37:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-27 03:37:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-27 03:37:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-27 03:37:53,782 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-27 03:37:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:53,782 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-27 03:37:53,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-27 03:37:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:37:53,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:53,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:53,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-27 03:37:53,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:53,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418834667] [2019-12-27 03:37:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:53,895 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:37:53,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418834667] [2019-12-27 03:37:53,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:53,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:53,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535910645] [2019-12-27 03:37:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:53,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:53,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:53,897 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-27 03:37:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:54,124 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-27 03:37:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:54,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:37:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:54,180 INFO L225 Difference]: With dead ends: 14736 [2019-12-27 03:37:54,181 INFO L226 Difference]: Without dead ends: 14736 [2019-12-27 03:37:54,181 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:37:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-27 03:37:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-27 03:37:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-27 03:37:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-27 03:37:54,729 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-27 03:37:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:54,730 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-27 03:37:54,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-27 03:37:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:37:54,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:54,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:54,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-27 03:37:54,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:54,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465320913] [2019-12-27 03:37:54,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:54,803 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:37:54,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465320913] [2019-12-27 03:37:54,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:54,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:54,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874764357] [2019-12-27 03:37:54,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:54,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:54,805 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-27 03:37:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:55,223 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-27 03:37:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:37:55,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 03:37:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:55,280 INFO L225 Difference]: With dead ends: 17572 [2019-12-27 03:37:55,281 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 03:37:55,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:37:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 03:37:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-27 03:37:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-27 03:37:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-27 03:37:55,833 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-27 03:37:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:55,833 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-27 03:37:55,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-27 03:37:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:37:55,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:55,848 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] [2019-12-27 03:37:55,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-27 03:37:55,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:55,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487225572] [2019-12-27 03:37:55,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:55,942 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:37:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487225572] [2019-12-27 03:37:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095009667] [2019-12-27 03:37:55,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:55,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:55,944 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-27 03:37:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:56,058 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-27 03:37:56,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:56,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 03:37:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:56,111 INFO L225 Difference]: With dead ends: 16057 [2019-12-27 03:37:56,111 INFO L226 Difference]: Without dead ends: 16057 [2019-12-27 03:37:56,112 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:37:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-27 03:37:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-27 03:37:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-27 03:37:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-27 03:37:56,525 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-27 03:37:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:56,527 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-27 03:37:56,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-27 03:37:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:37:56,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:56,540 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] [2019-12-27 03:37:56,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-27 03:37:56,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:56,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388989018] [2019-12-27 03:37:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:57,338 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:37:57,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388989018] [2019-12-27 03:37:57,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:57,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:57,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306347840] [2019-12-27 03:37:57,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:57,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:57,343 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-27 03:37:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:57,377 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-27 03:37:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:37:57,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:37:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:57,382 INFO L225 Difference]: With dead ends: 2296 [2019-12-27 03:37:57,382 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 03:37:57,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 03:37:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-27 03:37:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 03:37:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-27 03:37:57,417 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-27 03:37:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:57,418 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-27 03:37:57,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-27 03:37:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:37:57,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:57,422 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] [2019-12-27 03:37:57,422 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-27 03:37:57,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:57,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423057123] [2019-12-27 03:37:57,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:57,522 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:37:57,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423057123] [2019-12-27 03:37:57,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:57,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:37:57,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074356671] [2019-12-27 03:37:57,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:57,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:57,525 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-27 03:37:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:57,574 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-27 03:37:57,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:57,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:37:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:57,575 INFO L225 Difference]: With dead ends: 416 [2019-12-27 03:37:57,575 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 03:37:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 03:37:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-27 03:37:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 03:37:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-27 03:37:57,587 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-27 03:37:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:57,588 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-27 03:37:57,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-27 03:37:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:37:57,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:57,594 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] [2019-12-27 03:37:57,594 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-27 03:37:57,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:57,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866789169] [2019-12-27 03:37:57,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:57,682 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:37:57,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866789169] [2019-12-27 03:37:57,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:57,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:57,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668167516] [2019-12-27 03:37:57,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:57,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:57,684 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-27 03:37:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:57,698 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-27 03:37:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:57,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:37:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:57,699 INFO L225 Difference]: With dead ends: 331 [2019-12-27 03:37:57,700 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 03:37:57,700 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:37:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 03:37:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-27 03:37:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 03:37:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-27 03:37:57,705 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-27 03:37:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:57,707 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-27 03:37:57,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-27 03:37:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:57,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:57,711 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] [2019-12-27 03:37:57,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-27 03:37:57,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:57,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130116253] [2019-12-27 03:37:57,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:57,791 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:37:57,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130116253] [2019-12-27 03:37:57,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:57,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:57,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710612444] [2019-12-27 03:37:57,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:57,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:57,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:57,794 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-27 03:37:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:57,969 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-27 03:37:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:37:57,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 03:37:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:57,970 INFO L225 Difference]: With dead ends: 487 [2019-12-27 03:37:57,971 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 03:37:57,971 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:37:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 03:37:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-27 03:37:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 03:37:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-27 03:37:57,978 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-27 03:37:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:57,978 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-27 03:37:57,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-27 03:37:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:57,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:57,980 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] [2019-12-27 03:37:57,980 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-27 03:37:57,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:57,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037784041] [2019-12-27 03:37:57,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:58,068 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:37:58,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037784041] [2019-12-27 03:37:58,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:58,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:37:58,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058792099] [2019-12-27 03:37:58,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:58,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:58,071 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 5 states. [2019-12-27 03:37:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:58,205 INFO L93 Difference]: Finished difference Result 511 states and 903 transitions. [2019-12-27 03:37:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:37:58,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 03:37:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:58,207 INFO L225 Difference]: With dead ends: 511 [2019-12-27 03:37:58,207 INFO L226 Difference]: Without dead ends: 511 [2019-12-27 03:37:58,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-27 03:37:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 429. [2019-12-27 03:37:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-27 03:37:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 761 transitions. [2019-12-27 03:37:58,214 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 761 transitions. Word has length 53 [2019-12-27 03:37:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:58,215 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 761 transitions. [2019-12-27 03:37:58,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 761 transitions. [2019-12-27 03:37:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:58,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:58,216 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] [2019-12-27 03:37:58,216 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash -681731879, now seen corresponding path program 3 times [2019-12-27 03:37:58,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:58,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634238638] [2019-12-27 03:37:58,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:58,429 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:37:58,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634238638] [2019-12-27 03:37:58,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:58,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:37:58,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569088426] [2019-12-27 03:37:58,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:37:58,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:37:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:37:58,433 INFO L87 Difference]: Start difference. First operand 429 states and 761 transitions. Second operand 9 states. [2019-12-27 03:37:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:58,914 INFO L93 Difference]: Finished difference Result 695 states and 1209 transitions. [2019-12-27 03:37:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:37:58,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 03:37:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:58,915 INFO L225 Difference]: With dead ends: 695 [2019-12-27 03:37:58,916 INFO L226 Difference]: Without dead ends: 695 [2019-12-27 03:37:58,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:37:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-12-27 03:37:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 417. [2019-12-27 03:37:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-27 03:37:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 732 transitions. [2019-12-27 03:37:58,923 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 732 transitions. Word has length 53 [2019-12-27 03:37:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:58,923 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 732 transitions. [2019-12-27 03:37:58,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:37:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 732 transitions. [2019-12-27 03:37:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:37:58,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:58,925 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] [2019-12-27 03:37:58,925 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 31866971, now seen corresponding path program 4 times [2019-12-27 03:37:58,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:58,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746323645] [2019-12-27 03:37:58,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:59,012 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:37:59,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746323645] [2019-12-27 03:37:59,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:59,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:59,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132672902] [2019-12-27 03:37:59,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:59,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:59,014 INFO L87 Difference]: Start difference. First operand 417 states and 732 transitions. Second operand 3 states. [2019-12-27 03:37:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:59,050 INFO L93 Difference]: Finished difference Result 417 states and 731 transitions. [2019-12-27 03:37:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:59,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:37:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:59,051 INFO L225 Difference]: With dead ends: 417 [2019-12-27 03:37:59,051 INFO L226 Difference]: Without dead ends: 417 [2019-12-27 03:37:59,052 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:37:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-27 03:37:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2019-12-27 03:37:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 03:37:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 580 transitions. [2019-12-27 03:37:59,057 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 580 transitions. Word has length 53 [2019-12-27 03:37:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:59,057 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 580 transitions. [2019-12-27 03:37:59,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 580 transitions. [2019-12-27 03:37:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:59,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:59,058 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] [2019-12-27 03:37:59,059 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-27 03:37:59,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:59,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476671886] [2019-12-27 03:37:59,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:59,364 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:37:59,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476671886] [2019-12-27 03:37:59,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:59,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:37:59,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420940753] [2019-12-27 03:37:59,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:37:59,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:37:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:59,367 INFO L87 Difference]: Start difference. First operand 336 states and 580 transitions. Second operand 13 states. [2019-12-27 03:37:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:59,990 INFO L93 Difference]: Finished difference Result 734 states and 1220 transitions. [2019-12-27 03:37:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:37:59,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 03:37:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:59,992 INFO L225 Difference]: With dead ends: 734 [2019-12-27 03:37:59,992 INFO L226 Difference]: Without dead ends: 237 [2019-12-27 03:37:59,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:37:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-27 03:37:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2019-12-27 03:37:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-27 03:37:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 367 transitions. [2019-12-27 03:37:59,997 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 367 transitions. Word has length 54 [2019-12-27 03:37:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:59,997 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 367 transitions. [2019-12-27 03:37:59,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:37:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 367 transitions. [2019-12-27 03:37:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:37:59,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:59,998 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] [2019-12-27 03:37:59,998 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-27 03:37:59,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:59,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667704649] [2019-12-27 03:37:59,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:00,205 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:38:00,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667704649] [2019-12-27 03:38:00,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:00,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:38:00,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291110242] [2019-12-27 03:38:00,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:38:00,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:38:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:38:00,207 INFO L87 Difference]: Start difference. First operand 213 states and 367 transitions. Second operand 13 states. [2019-12-27 03:38:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:38:00,677 INFO L93 Difference]: Finished difference Result 380 states and 641 transitions. [2019-12-27 03:38:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:38:00,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 03:38:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:38:00,679 INFO L225 Difference]: With dead ends: 380 [2019-12-27 03:38:00,679 INFO L226 Difference]: Without dead ends: 347 [2019-12-27 03:38:00,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:38:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-12-27 03:38:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 313. [2019-12-27 03:38:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-12-27 03:38:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 538 transitions. [2019-12-27 03:38:00,688 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 538 transitions. Word has length 54 [2019-12-27 03:38:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:38:00,690 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 538 transitions. [2019-12-27 03:38:00,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:38:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 538 transitions. [2019-12-27 03:38:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:38:00,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:00,692 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] [2019-12-27 03:38:00,692 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-27 03:38:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:00,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633998458] [2019-12-27 03:38:00,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:01,019 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:38:01,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633998458] [2019-12-27 03:38:01,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:01,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:38:01,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309851136] [2019-12-27 03:38:01,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:38:01,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:01,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:38:01,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:38:01,021 INFO L87 Difference]: Start difference. First operand 313 states and 538 transitions. Second operand 14 states. [2019-12-27 03:38:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:38:01,590 INFO L93 Difference]: Finished difference Result 418 states and 695 transitions. [2019-12-27 03:38:01,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:38:01,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 03:38:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:38:01,592 INFO L225 Difference]: With dead ends: 418 [2019-12-27 03:38:01,592 INFO L226 Difference]: Without dead ends: 383 [2019-12-27 03:38:01,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:38:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-27 03:38:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 321. [2019-12-27 03:38:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 03:38:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 552 transitions. [2019-12-27 03:38:01,598 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 552 transitions. Word has length 54 [2019-12-27 03:38:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:38:01,598 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 552 transitions. [2019-12-27 03:38:01,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:38:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 552 transitions. [2019-12-27 03:38:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:38:01,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:01,600 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] [2019-12-27 03:38:01,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 4 times [2019-12-27 03:38:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830222231] [2019-12-27 03:38:01,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:38:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:38:01,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:38:01,701 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:38:01,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= 0 |v_ULTIMATE.start_main_~#t2017~0.offset_19|) (= 0 v_~__unbuffered_cnt~0_61) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24| 1)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2017~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24|)) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2017~0.base_24| 4) |v_#length_13|) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24|) |v_ULTIMATE.start_main_~#t2017~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ULTIMATE.start_main_~#t2017~0.base=|v_ULTIMATE.start_main_~#t2017~0.base_24|, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~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_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~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_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2017~0.offset=|v_ULTIMATE.start_main_~#t2017~0.offset_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} 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, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2017~0.base, #length, 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, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2018~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2018~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t2017~0.offset, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:38:01,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) |v_ULTIMATE.start_main_~#t2018~0.offset_10| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2018~0.base_11| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t2018~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2018~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2018~0.offset, #length] because there is no mapped edge [2019-12-27 03:38:01,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:38:01,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In69355449 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In69355449 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out69355449| ~y$w_buff1~0_In69355449)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out69355449| ~y~0_In69355449) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In69355449, ~y$w_buff1~0=~y$w_buff1~0_In69355449, ~y~0=~y~0_In69355449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In69355449} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In69355449, ~y$w_buff1~0=~y$w_buff1~0_In69355449, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out69355449|, ~y~0=~y~0_In69355449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In69355449} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 03:38:01,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 03:38:01,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1717635954 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1717635954 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1717635954 |P1Thread1of1ForFork1_#t~ite11_Out1717635954|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1717635954|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1717635954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717635954} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1717635954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717635954, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1717635954|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:38:01,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In948280932 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In948280932 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In948280932 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In948280932 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In948280932 |P1Thread1of1ForFork1_#t~ite12_Out948280932|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out948280932|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In948280932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In948280932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In948280932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In948280932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In948280932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In948280932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In948280932, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out948280932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In948280932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:38:01,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-402181720 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-402181720 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-402181720| ~y$r_buff0_thd2~0_In-402181720) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-402181720| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-402181720, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-402181720} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-402181720, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-402181720, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-402181720|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:38:01,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1196808911 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1196808911 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1196808911 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1196808911 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out1196808911| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1196808911| ~y$r_buff1_thd2~0_In1196808911)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1196808911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196808911, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196808911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196808911} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1196808911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1196808911, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1196808911, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1196808911|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196808911} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:38:01,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:38:01,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1009531532 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1009531532 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009531532| ~y$w_buff0_used~0_In-1009531532) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1009531532| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009531532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009531532} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1009531532|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009531532, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1009531532} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:38:01,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In-889090833 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-889090833 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-889090833 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-889090833 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-889090833 |P0Thread1of1ForFork0_#t~ite6_Out-889090833|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-889090833|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-889090833, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-889090833, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-889090833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-889090833} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-889090833|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-889090833, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-889090833, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-889090833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-889090833} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:38:01,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-9435949 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-9435949 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-9435949 ~y$r_buff0_thd1~0_In-9435949)) (and (= ~y$r_buff0_thd1~0_Out-9435949 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-9435949, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-9435949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-9435949, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-9435949|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-9435949} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:38:01,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In865413830 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In865413830 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In865413830 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In865413830 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out865413830|)) (and (= ~y$r_buff1_thd1~0_In865413830 |P0Thread1of1ForFork0_#t~ite8_Out865413830|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In865413830, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865413830, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In865413830, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865413830} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In865413830, ~y$w_buff0_used~0=~y$w_buff0_used~0_In865413830, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out865413830|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In865413830, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865413830} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:38:01,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:38:01,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:38:01,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In346336927 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In346336927 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out346336927| |ULTIMATE.start_main_#t~ite17_Out346336927|))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In346336927 |ULTIMATE.start_main_#t~ite17_Out346336927|)) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite17_Out346336927| ~y$w_buff1~0_In346336927)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In346336927, ~y~0=~y~0_In346336927, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In346336927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346336927} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out346336927|, ~y$w_buff1~0=~y$w_buff1~0_In346336927, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out346336927|, ~y~0=~y~0_In346336927, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In346336927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346336927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:38:01,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-112913448 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-112913448 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-112913448| 0)) (and (= ~y$w_buff0_used~0_In-112913448 |ULTIMATE.start_main_#t~ite19_Out-112913448|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112913448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112913448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112913448, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-112913448|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112913448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:38:01,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In964628958 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In964628958 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In964628958 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In964628958 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out964628958| ~y$w_buff1_used~0_In964628958) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out964628958| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In964628958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In964628958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In964628958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In964628958} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In964628958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In964628958, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out964628958|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In964628958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In964628958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:38:01,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In491665839 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In491665839 256)))) (or (and (= ~y$r_buff0_thd0~0_In491665839 |ULTIMATE.start_main_#t~ite21_Out491665839|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out491665839|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In491665839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In491665839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In491665839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In491665839, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out491665839|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:38:01,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1889817972 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1889817972 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1889817972 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1889817972 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-1889817972| ~y$r_buff1_thd0~0_In-1889817972)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1889817972| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1889817972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1889817972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1889817972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889817972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1889817972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1889817972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1889817972, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1889817972|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889817972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:38:01,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1269005386 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1269005386 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In1269005386 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1269005386 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1269005386 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite31_Out1269005386| ~y$w_buff1~0_In1269005386) (= |ULTIMATE.start_main_#t~ite31_Out1269005386| |ULTIMATE.start_main_#t~ite32_Out1269005386|)) (and (= |ULTIMATE.start_main_#t~ite31_In1269005386| |ULTIMATE.start_main_#t~ite31_Out1269005386|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out1269005386| ~y$w_buff1~0_In1269005386)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1269005386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1269005386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1269005386, ~weak$$choice2~0=~weak$$choice2~0_In1269005386, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1269005386|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1269005386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1269005386} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1269005386, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1269005386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1269005386, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1269005386|, ~weak$$choice2~0=~weak$$choice2~0_In1269005386, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1269005386|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1269005386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1269005386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 03:38:01,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 03:38:01,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:38:01,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:38:01,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:38:01 BasicIcfg [2019-12-27 03:38:01,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:38:01,788 INFO L168 Benchmark]: Toolchain (without parser) took 18254.37 ms. Allocated memory was 144.7 MB in the beginning and 780.1 MB in the end (delta: 635.4 MB). Free memory was 100.7 MB in the beginning and 280.5 MB in the end (delta: -179.8 MB). Peak memory consumption was 455.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:38:01,789 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 144.7 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:38:01,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.54 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:38:01,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.13 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.4 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:38:01,790 INFO L168 Benchmark]: Boogie Preprocessor took 38.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.7 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:38:01,791 INFO L168 Benchmark]: RCFGBuilder took 836.51 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:38:01,792 INFO L168 Benchmark]: TraceAbstraction took 16566.93 ms. Allocated memory was 202.9 MB in the beginning and 780.1 MB in the end (delta: 577.2 MB). Free memory was 107.6 MB in the beginning and 280.5 MB in the end (delta: -172.9 MB). Peak memory consumption was 404.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:38:01,796 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.66 ms. Allocated memory is still 144.7 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 740.54 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.13 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.4 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.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.51 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16566.93 ms. Allocated memory was 202.9 MB in the beginning and 780.1 MB in the end (delta: 577.2 MB). Free memory was 107.6 MB in the beginning and 280.5 MB in the end (delta: -172.9 MB). Peak memory consumption was 404.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L798] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L798] 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) [L799] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L799] 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)) [L800] 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)) [L801] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L801] 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)) [L802] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L802] 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)) [L804] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L804] 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)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1594 SDtfs, 1833 SDslu, 3924 SDs, 0 SdLazy, 2340 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 9696 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 105739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...