/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:12:41,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:12:41,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:12:41,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:12:41,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:12:41,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:12:41,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:12:41,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:12:41,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:12:41,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:12:41,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:12:41,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:12:41,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:12:41,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:12:41,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:12:41,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:12:41,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:12:41,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:12:41,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:12:41,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:12:41,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:12:41,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:12:41,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:12:41,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:12:41,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:12:41,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:12:41,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:12:41,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:12:41,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:12:41,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:12:41,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:12:41,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:12:41,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:12:41,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:12:41,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:12:41,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:12:41,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:12:41,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:12:41,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:12:41,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:12:41,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:12:41,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:12:41,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:12:41,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:12:41,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:12:41,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:12:41,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:12:41,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:12:41,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:12:41,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:12:41,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:12:41,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:12:41,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:12:41,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:12:41,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:12:41,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:12:41,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:12:41,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:12:41,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:12:41,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:12:41,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:12:41,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:12:41,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:12:41,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:12:41,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:12:41,458 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:12:41,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:12:41,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:12:41,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:12:41,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:12:41,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:12:41,739 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:12:41,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 00:12:41,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd3e9189/61b810701579408f808562205a91f372/FLAGae46cd524 [2019-12-27 00:12:42,368 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:12:42,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 00:12:42,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd3e9189/61b810701579408f808562205a91f372/FLAGae46cd524 [2019-12-27 00:12:42,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd3e9189/61b810701579408f808562205a91f372 [2019-12-27 00:12:42,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:12:42,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:12:42,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:42,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:12:42,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:12:42,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:42" (1/1) ... [2019-12-27 00:12:42,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c126812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:42, skipping insertion in model container [2019-12-27 00:12:42,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:42" (1/1) ... [2019-12-27 00:12:42,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:12:42,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:12:43,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:43,156 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:12:43,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:43,326 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:12:43,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43 WrapperNode [2019-12-27 00:12:43,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:43,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:43,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:12:43,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:12:43,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:43,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:12:43,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:12:43,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:12:43,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (1/1) ... [2019-12-27 00:12:43,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:12:43,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:12:43,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:12:43,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:12:43,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (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 00:12:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:12:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:12:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:12:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:12:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:12:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:12:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:12:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:12:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:12:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:12:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:12:43,504 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 00:12:44,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:12:44,178 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:12:44,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:44 BoogieIcfgContainer [2019-12-27 00:12:44,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:12:44,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:12:44,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:12:44,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:12:44,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:12:42" (1/3) ... [2019-12-27 00:12:44,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:44, skipping insertion in model container [2019-12-27 00:12:44,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:43" (2/3) ... [2019-12-27 00:12:44,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cda5f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:44, skipping insertion in model container [2019-12-27 00:12:44,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:44" (3/3) ... [2019-12-27 00:12:44,188 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-27 00:12:44,200 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:12:44,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:12:44,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:12:44,210 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:12:44,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,270 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,270 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:44,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:12:44,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:12:44,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:12:44,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:12:44,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:12:44,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:12:44,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:12:44,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:12:44,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:12:44,332 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 00:12:44,333 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:44,442 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:44,442 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:44,459 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:44,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:44,523 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:44,523 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:44,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:44,543 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 00:12:44,544 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:12:49,378 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 00:12:49,499 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 00:12:49,556 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 00:12:49,556 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 00:12:49,563 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 00:12:50,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 00:12:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 00:12:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:12:50,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:50,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:12:50,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 00:12:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:50,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928031858] [2019-12-27 00:12:50,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:50,329 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 00:12:50,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928031858] [2019-12-27 00:12:50,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:50,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:12:50,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878108681] [2019-12-27 00:12:50,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:50,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:50,356 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 00:12:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:50,644 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 00:12:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:50,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:12:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:50,781 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 00:12:50,781 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 00:12:50,782 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 00:12:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 00:12:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 00:12:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 00:12:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 00:12:51,281 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 00:12:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:51,282 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 00:12:51,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 00:12:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:12:51,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:51,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:51,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 00:12:51,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:51,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772115478] [2019-12-27 00:12:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:51,487 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 00:12:51,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772115478] [2019-12-27 00:12:51,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:51,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:12:51,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188450610] [2019-12-27 00:12:51,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:12:51,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:12:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:12:51,492 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 00:12:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:51,852 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 00:12:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:12:51,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:12:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:51,932 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 00:12:51,933 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 00:12:51,934 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 00:12:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 00:12:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 00:12:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 00:12:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 00:12:52,955 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 00:12:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:52,955 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 00:12:52,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:12:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 00:12:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:12:52,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:52,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:52,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 00:12:52,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:52,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383917369] [2019-12-27 00:12:52,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,096 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 00:12:53,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383917369] [2019-12-27 00:12:53,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:12:53,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868056235] [2019-12-27 00:12:53,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:12:53,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:12:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:12:53,099 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 00:12:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:53,136 INFO L93 Difference]: Finished difference Result 1910 states and 4431 transitions. [2019-12-27 00:12:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:12:53,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:12:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:53,141 INFO L225 Difference]: With dead ends: 1910 [2019-12-27 00:12:53,141 INFO L226 Difference]: Without dead ends: 1633 [2019-12-27 00:12:53,142 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 00:12:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-12-27 00:12:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2019-12-27 00:12:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-12-27 00:12:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3665 transitions. [2019-12-27 00:12:53,177 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3665 transitions. Word has length 11 [2019-12-27 00:12:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,178 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 3665 transitions. [2019-12-27 00:12:53,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:12:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3665 transitions. [2019-12-27 00:12:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:12:53,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:53,180 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] [2019-12-27 00:12:53,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1924498971, now seen corresponding path program 1 times [2019-12-27 00:12:53,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:53,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942369162] [2019-12-27 00:12:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,287 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 00:12:53,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942369162] [2019-12-27 00:12:53,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:12:53,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444675035] [2019-12-27 00:12:53,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:12:53,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:12:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:53,289 INFO L87 Difference]: Start difference. First operand 1633 states and 3665 transitions. Second operand 5 states. [2019-12-27 00:12:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:53,336 INFO L93 Difference]: Finished difference Result 392 states and 732 transitions. [2019-12-27 00:12:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:12:53,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 00:12:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:53,338 INFO L225 Difference]: With dead ends: 392 [2019-12-27 00:12:53,338 INFO L226 Difference]: Without dead ends: 347 [2019-12-27 00:12:53,339 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 00:12:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-12-27 00:12:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2019-12-27 00:12:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 00:12:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 592 transitions. [2019-12-27 00:12:53,347 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 592 transitions. Word has length 23 [2019-12-27 00:12:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,347 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 592 transitions. [2019-12-27 00:12:53,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:12:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 592 transitions. [2019-12-27 00:12:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 00:12:53,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:53,350 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 00:12:53,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -955543376, now seen corresponding path program 1 times [2019-12-27 00:12:53,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:53,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573590866] [2019-12-27 00:12:53,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,465 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 00:12:53,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573590866] [2019-12-27 00:12:53,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:12:53,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472576254] [2019-12-27 00:12:53,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:53,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:53,468 INFO L87 Difference]: Start difference. First operand 319 states and 592 transitions. Second operand 3 states. [2019-12-27 00:12:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:53,515 INFO L93 Difference]: Finished difference Result 329 states and 602 transitions. [2019-12-27 00:12:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:53,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 00:12:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:53,517 INFO L225 Difference]: With dead ends: 329 [2019-12-27 00:12:53,517 INFO L226 Difference]: Without dead ends: 329 [2019-12-27 00:12:53,518 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 00:12:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-27 00:12:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2019-12-27 00:12:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-27 00:12:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 598 transitions. [2019-12-27 00:12:53,524 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 598 transitions. Word has length 52 [2019-12-27 00:12:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,526 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 598 transitions. [2019-12-27 00:12:53,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 598 transitions. [2019-12-27 00:12:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 00:12:53,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:53,528 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 00:12:53,528 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1093435048, now seen corresponding path program 1 times [2019-12-27 00:12:53,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:53,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442408634] [2019-12-27 00:12:53,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,657 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 00:12:53,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442408634] [2019-12-27 00:12:53,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:12:53,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144310356] [2019-12-27 00:12:53,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:53,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:53,660 INFO L87 Difference]: Start difference. First operand 325 states and 598 transitions. Second operand 3 states. [2019-12-27 00:12:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:53,679 INFO L93 Difference]: Finished difference Result 313 states and 562 transitions. [2019-12-27 00:12:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:53,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 00:12:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:53,681 INFO L225 Difference]: With dead ends: 313 [2019-12-27 00:12:53,681 INFO L226 Difference]: Without dead ends: 313 [2019-12-27 00:12:53,681 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 00:12:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-27 00:12:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-12-27 00:12:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-12-27 00:12:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 562 transitions. [2019-12-27 00:12:53,688 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 562 transitions. Word has length 52 [2019-12-27 00:12:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,688 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 562 transitions. [2019-12-27 00:12:53,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 562 transitions. [2019-12-27 00:12:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:12:53,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:53,690 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 00:12:53,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 456891136, now seen corresponding path program 1 times [2019-12-27 00:12:53,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507797489] [2019-12-27 00:12:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,775 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 00:12:53,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507797489] [2019-12-27 00:12:53,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:12:53,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416383339] [2019-12-27 00:12:53,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:12:53,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:12:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:53,778 INFO L87 Difference]: Start difference. First operand 313 states and 562 transitions. Second operand 5 states. [2019-12-27 00:12:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:53,987 INFO L93 Difference]: Finished difference Result 469 states and 844 transitions. [2019-12-27 00:12:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:12:53,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 00:12:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:53,989 INFO L225 Difference]: With dead ends: 469 [2019-12-27 00:12:53,990 INFO L226 Difference]: Without dead ends: 469 [2019-12-27 00:12:53,990 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 00:12:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-12-27 00:12:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-12-27 00:12:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-27 00:12:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 655 transitions. [2019-12-27 00:12:53,998 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 655 transitions. Word has length 53 [2019-12-27 00:12:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,999 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 655 transitions. [2019-12-27 00:12:53,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:12:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 655 transitions. [2019-12-27 00:12:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:12:54,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:54,001 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 00:12:54,001 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash 923557156, now seen corresponding path program 2 times [2019-12-27 00:12:54,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:54,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257665621] [2019-12-27 00:12:54,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:54,078 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 00:12:54,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257665621] [2019-12-27 00:12:54,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:12:54,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899587979] [2019-12-27 00:12:54,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:54,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:54,084 INFO L87 Difference]: Start difference. First operand 361 states and 655 transitions. Second operand 3 states. [2019-12-27 00:12:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:54,123 INFO L93 Difference]: Finished difference Result 360 states and 653 transitions. [2019-12-27 00:12:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:54,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:12:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:54,124 INFO L225 Difference]: With dead ends: 360 [2019-12-27 00:12:54,124 INFO L226 Difference]: Without dead ends: 360 [2019-12-27 00:12:54,125 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 00:12:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-27 00:12:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 259. [2019-12-27 00:12:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-27 00:12:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 468 transitions. [2019-12-27 00:12:54,132 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 468 transitions. Word has length 53 [2019-12-27 00:12:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:54,132 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 468 transitions. [2019-12-27 00:12:54,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 468 transitions. [2019-12-27 00:12:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:12:54,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:54,134 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 00:12:54,134 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1896622654, now seen corresponding path program 1 times [2019-12-27 00:12:54,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:54,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229079941] [2019-12-27 00:12:54,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:54,298 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 00:12:54,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229079941] [2019-12-27 00:12:54,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:54,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:12:54,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266640895] [2019-12-27 00:12:54,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:12:54,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:12:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:54,302 INFO L87 Difference]: Start difference. First operand 259 states and 468 transitions. Second operand 5 states. [2019-12-27 00:12:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:54,346 INFO L93 Difference]: Finished difference Result 436 states and 778 transitions. [2019-12-27 00:12:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:12:54,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 00:12:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:54,348 INFO L225 Difference]: With dead ends: 436 [2019-12-27 00:12:54,348 INFO L226 Difference]: Without dead ends: 219 [2019-12-27 00:12:54,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:12:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-12-27 00:12:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-12-27 00:12:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 00:12:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 00:12:54,356 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 54 [2019-12-27 00:12:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:54,356 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 00:12:54,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:12:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 00:12:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:12:54,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:54,357 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 00:12:54,358 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 2 times [2019-12-27 00:12:54,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:54,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745230894] [2019-12-27 00:12:54,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:54,717 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 00:12:54,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745230894] [2019-12-27 00:12:54,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:12:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735299678] [2019-12-27 00:12:54,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:12:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:12:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:12:54,721 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 14 states. [2019-12-27 00:12:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:55,408 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-27 00:12:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:12:55,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 00:12:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:55,409 INFO L225 Difference]: With dead ends: 384 [2019-12-27 00:12:55,410 INFO L226 Difference]: Without dead ends: 353 [2019-12-27 00:12:55,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:12:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-27 00:12:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-27 00:12:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 00:12:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 00:12:55,417 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 00:12:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:55,418 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 00:12:55,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:12:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 00:12:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:12:55,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:55,420 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 00:12:55,420 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 3 times [2019-12-27 00:12:55,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:55,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896627629] [2019-12-27 00:12:55,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:55,733 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 00:12:55,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896627629] [2019-12-27 00:12:55,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:55,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:12:55,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519479346] [2019-12-27 00:12:55,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:12:55,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:55,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:12:55,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:12:55,735 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 12 states. [2019-12-27 00:12:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:56,021 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-27 00:12:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 00:12:56,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 00:12:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:56,023 INFO L225 Difference]: With dead ends: 420 [2019-12-27 00:12:56,024 INFO L226 Difference]: Without dead ends: 389 [2019-12-27 00:12:56,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:12:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-27 00:12:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-27 00:12:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 00:12:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-27 00:12:56,032 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-27 00:12:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:56,033 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-27 00:12:56,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:12:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-27 00:12:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:12:56,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:56,034 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 00:12:56,034 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:56,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 4 times [2019-12-27 00:12:56,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:56,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158693330] [2019-12-27 00:12:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:12:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:12:56,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:12:56,180 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:12:56,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~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_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~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_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #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, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #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_~#t2474~0.offset, 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, ULTIMATE.start_main_~#t2473~0.offset, ~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_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:12:56,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-27 00:12:56,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} 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 00:12:56,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-393547118 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-393547118 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-393547118| ~y$w_buff0_used~0_In-393547118)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-393547118|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-393547118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-393547118} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-393547118|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-393547118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-393547118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 00:12:56,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In538659940 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In538659940 256)))) (or (and (= ~y~0_In538659940 |P1Thread1of1ForFork1_#t~ite9_Out538659940|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In538659940 |P1Thread1of1ForFork1_#t~ite9_Out538659940|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In538659940, ~y$w_buff1~0=~y$w_buff1~0_In538659940, ~y~0=~y~0_In538659940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538659940} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In538659940, ~y$w_buff1~0=~y$w_buff1~0_In538659940, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out538659940|, ~y~0=~y~0_In538659940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538659940} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 00:12:56,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 00:12:56,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1434709042 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1434709042 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1434709042| ~y$w_buff0_used~0_In-1434709042) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1434709042| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1434709042, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1434709042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1434709042, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1434709042, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1434709042|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 00:12:56,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-661981076 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-661981076 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-661981076 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-661981076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-661981076| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-661981076| ~y$w_buff1_used~0_In-661981076)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-661981076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-661981076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-661981076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-661981076} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-661981076|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-661981076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-661981076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-661981076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-661981076} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 00:12:56,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In436245673 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In436245673 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out436245673 ~y$r_buff0_thd1~0_In436245673)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out436245673)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In436245673, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In436245673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In436245673, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out436245673|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out436245673} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 00:12:56,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1162361204 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1162361204 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1162361204 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1162361204 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1162361204| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1162361204 |P1Thread1of1ForFork1_#t~ite12_Out1162361204|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1162361204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1162361204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1162361204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1162361204} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1162361204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1162361204, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1162361204, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1162361204|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1162361204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 00:12:56,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2003265296 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2003265296 256)))) (or (and (= ~y$r_buff0_thd2~0_In2003265296 |P1Thread1of1ForFork1_#t~ite13_Out2003265296|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out2003265296|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2003265296, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003265296} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2003265296, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003265296, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2003265296|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 00:12:56,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In839008742 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In839008742 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In839008742 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In839008742 256)))) (or (and (= ~y$r_buff1_thd2~0_In839008742 |P1Thread1of1ForFork1_#t~ite14_Out839008742|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out839008742|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In839008742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In839008742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In839008742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In839008742} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In839008742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In839008742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In839008742, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out839008742|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In839008742} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 00:12:56,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, 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 00:12:56,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In845603686 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In845603686 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In845603686 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In845603686 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In845603686 |P0Thread1of1ForFork0_#t~ite8_Out845603686|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out845603686|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845603686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845603686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845603686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845603686} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845603686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845603686, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out845603686|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845603686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845603686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 00:12:56,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} 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 00:12:56,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 00:12:56,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-932515593 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-932515593 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-932515593 |ULTIMATE.start_main_#t~ite17_Out-932515593|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-932515593 |ULTIMATE.start_main_#t~ite17_Out-932515593|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-932515593, ~y~0=~y~0_In-932515593, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-932515593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-932515593} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-932515593|, ~y$w_buff1~0=~y$w_buff1~0_In-932515593, ~y~0=~y~0_In-932515593, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-932515593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-932515593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 00:12:56,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 00:12:56,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-485223309 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-485223309 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-485223309 |ULTIMATE.start_main_#t~ite19_Out-485223309|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-485223309| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-485223309, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485223309} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-485223309, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-485223309|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485223309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:12:56,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1754320868 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1754320868 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1754320868 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1754320868 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1754320868 |ULTIMATE.start_main_#t~ite20_Out-1754320868|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1754320868|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754320868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1754320868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1754320868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754320868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754320868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1754320868, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1754320868|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1754320868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754320868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:12:56,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-971807600 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-971807600 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-971807600| ~y$r_buff0_thd0~0_In-971807600) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-971807600| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-971807600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-971807600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-971807600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-971807600, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-971807600|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:12:56,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1805831278 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1805831278 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1805831278 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1805831278 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1805831278| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1805831278| ~y$r_buff1_thd0~0_In-1805831278) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805831278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805831278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1805831278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805831278} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805831278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805831278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1805831278, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1805831278|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805831278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:12:56,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1261308012 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out1261308012| |ULTIMATE.start_main_#t~ite35_Out1261308012|) (= ~y$w_buff0_used~0_In1261308012 |ULTIMATE.start_main_#t~ite34_Out1261308012|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1261308012 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1261308012 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In1261308012 256) 0)) (= (mod ~y$w_buff0_used~0_In1261308012 256) 0))) .cse1) (and (not .cse1) (= ~y$w_buff0_used~0_In1261308012 |ULTIMATE.start_main_#t~ite35_Out1261308012|) (= |ULTIMATE.start_main_#t~ite34_In1261308012| |ULTIMATE.start_main_#t~ite34_Out1261308012|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1261308012, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1261308012, ~weak$$choice2~0=~weak$$choice2~0_In1261308012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1261308012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1261308012, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In1261308012|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1261308012, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1261308012, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1261308012|, ~weak$$choice2~0=~weak$$choice2~0_In1261308012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1261308012, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1261308012|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1261308012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 00:12:56,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} 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 00:12:56,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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 00:12:56,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:12:56,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:12:56 BasicIcfg [2019-12-27 00:12:56,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:12:56,293 INFO L168 Benchmark]: Toolchain (without parser) took 13690.08 ms. Allocated memory was 138.9 MB in the beginning and 563.6 MB in the end (delta: 424.7 MB). Free memory was 102.3 MB in the beginning and 421.4 MB in the end (delta: -319.1 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,296 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.10 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.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 00:12:56,298 INFO L168 Benchmark]: Boogie Preprocessor took 36.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,302 INFO L168 Benchmark]: RCFGBuilder took 743.29 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,303 INFO L168 Benchmark]: TraceAbstraction took 12104.30 ms. Allocated memory was 201.9 MB in the beginning and 563.6 MB in the end (delta: 361.8 MB). Free memory was 106.9 MB in the beginning and 421.4 MB in the end (delta: -314.5 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:12:56,312 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.10 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.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 36.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.29 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12104.30 ms. Allocated memory was 201.9 MB in the beginning and 563.6 MB in the end (delta: 361.8 MB). Free memory was 106.9 MB in the beginning and 421.4 MB in the end (delta: -314.5 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=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] [L734] 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, 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] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L734] 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) [L754] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 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) [L797] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 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)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 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)) [L799] 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)) [L800] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 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)) [L802] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 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)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1007 SDtfs, 944 SDslu, 2321 SDs, 0 SdLazy, 1009 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11467occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 78811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...