/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:44:41,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:44:41,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:44:41,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:44:41,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:44:41,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:44:41,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:44:41,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:44:41,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:44:41,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:44:41,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:44:41,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:44:41,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:44:41,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:44:41,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:44:41,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:44:41,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:44:41,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:44:41,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:44:41,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:44:41,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:44:41,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:44:41,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:44:41,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:44:41,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:44:41,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:44:41,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:44:41,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:44:41,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:44:41,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:44:41,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:44:41,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:44:41,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:44:41,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:44:41,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:44:41,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:44:41,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:44:41,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:44:41,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:44:41,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:44:41,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:44:41,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:44:41,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:44:41,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:44:41,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:44:41,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:44:41,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:44:41,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:44:41,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:44:41,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:44:41,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:44:41,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:44:41,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:44:41,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:44:41,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:44:41,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:44:41,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:44:41,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:44:41,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:44:41,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:44:41,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:44:41,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:44:41,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:44:41,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:44:41,457 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:44:41,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:44:41,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:44:41,458 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:44:41,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:44:41,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:44:41,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:44:41,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:44:41,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:44:41,739 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:44:41,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-27 20:44:41,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81484ef11/21c4535fc5e14c4aadaa689fe45a429b/FLAG7e7f9acdf [2019-12-27 20:44:42,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:44:42,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-27 20:44:42,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81484ef11/21c4535fc5e14c4aadaa689fe45a429b/FLAG7e7f9acdf [2019-12-27 20:44:42,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81484ef11/21c4535fc5e14c4aadaa689fe45a429b [2019-12-27 20:44:42,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:44:42,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:44:42,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:44:42,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:44:42,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:44:42,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:44:42" (1/1) ... [2019-12-27 20:44:42,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f016942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:42, skipping insertion in model container [2019-12-27 20:44:42,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:44:42" (1/1) ... [2019-12-27 20:44:42,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:44:42,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:44:43,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:44:43,273 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:44:43,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:44:43,429 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:44:43,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43 WrapperNode [2019-12-27 20:44:43,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:44:43,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:44:43,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:44:43,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:44:43,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:44:43,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:44:43,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:44:43,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:44:43,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (1/1) ... [2019-12-27 20:44:43,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:44:43,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:44:43,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:44:43,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:44:43,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44: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 20:44:43,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:44:43,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:44:43,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:44:43,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:44:43,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:44:43,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:44:43,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:44:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:44:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:44:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:44:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:44:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:44:43,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:44:43,686 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 20:44:44,448 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:44:44,448 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:44:44,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:44:44 BoogieIcfgContainer [2019-12-27 20:44:44,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:44:44,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:44:44,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:44:44,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:44:44,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:44:42" (1/3) ... [2019-12-27 20:44:44,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a266b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:44:44, skipping insertion in model container [2019-12-27 20:44:44,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:44:43" (2/3) ... [2019-12-27 20:44:44,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a266b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:44:44, skipping insertion in model container [2019-12-27 20:44:44,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:44:44" (3/3) ... [2019-12-27 20:44:44,459 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2019-12-27 20:44:44,470 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:44:44,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:44:44,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:44:44,479 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:44:44,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,582 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,582 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,583 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,587 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:44:44,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:44:44,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:44:44,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:44:44,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:44:44,622 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:44:44,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:44:44,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:44:44,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:44:44,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:44:44,642 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 20:44:44,644 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:44:44,775 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:44:44,776 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:44:44,791 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:44:44,813 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:44:44,898 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:44:44,898 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:44:44,911 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:44:44,934 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 20:44:44,935 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:44:48,346 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 20:44:48,478 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 20:44:48,507 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82846 [2019-12-27 20:44:48,507 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 20:44:48,511 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-27 20:45:09,305 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125660 states. [2019-12-27 20:45:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 125660 states. [2019-12-27 20:45:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:45:09,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:45:09,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:45:09,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:45:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:45:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 807924105, now seen corresponding path program 1 times [2019-12-27 20:45:09,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:45:09,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938883811] [2019-12-27 20:45:09,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:45:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:45:09,553 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 20:45:09,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938883811] [2019-12-27 20:45:09,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:45:09,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:45:09,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477162956] [2019-12-27 20:45:09,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:45:09,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:45:09,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:45:09,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:45:09,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:45:09,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:45:09,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:45:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:45:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:45:09,592 INFO L87 Difference]: Start difference. First operand 125660 states. Second operand 3 states. [2019-12-27 20:45:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:45:10,889 INFO L93 Difference]: Finished difference Result 125096 states and 540334 transitions. [2019-12-27 20:45:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:45:10,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:45:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:45:15,121 INFO L225 Difference]: With dead ends: 125096 [2019-12-27 20:45:15,121 INFO L226 Difference]: Without dead ends: 122548 [2019-12-27 20:45:15,126 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 20:45:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122548 states. [2019-12-27 20:45:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122548 to 122548. [2019-12-27 20:45:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122548 states. [2019-12-27 20:45:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122548 states to 122548 states and 529960 transitions. [2019-12-27 20:45:22,868 INFO L78 Accepts]: Start accepts. Automaton has 122548 states and 529960 transitions. Word has length 5 [2019-12-27 20:45:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:45:22,868 INFO L462 AbstractCegarLoop]: Abstraction has 122548 states and 529960 transitions. [2019-12-27 20:45:22,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:45:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 122548 states and 529960 transitions. [2019-12-27 20:45:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:45:22,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:45:22,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:45:22,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:45:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:45:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash 311209173, now seen corresponding path program 1 times [2019-12-27 20:45:22,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:45:22,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265270868] [2019-12-27 20:45:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:45:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:45:22,980 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 20:45:22,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265270868] [2019-12-27 20:45:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:45:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:45:22,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440954165] [2019-12-27 20:45:22,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:45:22,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:45:22,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 20:45:22,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:45:23,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:45:23,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:45:23,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:45:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:45:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:45:23,038 INFO L87 Difference]: Start difference. First operand 122548 states and 529960 transitions. Second operand 5 states. [2019-12-27 20:45:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:45:29,268 INFO L93 Difference]: Finished difference Result 196578 states and 812188 transitions. [2019-12-27 20:45:29,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:45:29,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 20:45:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:45:29,935 INFO L225 Difference]: With dead ends: 196578 [2019-12-27 20:45:29,935 INFO L226 Difference]: Without dead ends: 196529 [2019-12-27 20:45:29,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:45:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196529 states. [2019-12-27 20:45:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196529 to 180333. [2019-12-27 20:45:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180333 states. [2019-12-27 20:45:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180333 states to 180333 states and 754389 transitions. [2019-12-27 20:45:49,891 INFO L78 Accepts]: Start accepts. Automaton has 180333 states and 754389 transitions. Word has length 11 [2019-12-27 20:45:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:45:49,892 INFO L462 AbstractCegarLoop]: Abstraction has 180333 states and 754389 transitions. [2019-12-27 20:45:49,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:45:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 180333 states and 754389 transitions. [2019-12-27 20:45:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:45:49,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:45:49,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:45:49,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:45:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:45:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1817604182, now seen corresponding path program 1 times [2019-12-27 20:45:49,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:45:49,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868006063] [2019-12-27 20:45:49,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:45:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:45:49,984 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 20:45:49,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868006063] [2019-12-27 20:45:49,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:45:49,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:45:49,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510664657] [2019-12-27 20:45:49,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:45:49,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:45:49,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:45:49,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:45:49,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:45:49,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:45:49,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:45:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:45:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:45:49,992 INFO L87 Difference]: Start difference. First operand 180333 states and 754389 transitions. Second operand 4 states. [2019-12-27 20:45:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:45:51,586 INFO L93 Difference]: Finished difference Result 255988 states and 1044211 transitions. [2019-12-27 20:45:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:45:51,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:45:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:45:54,310 INFO L225 Difference]: With dead ends: 255988 [2019-12-27 20:45:54,310 INFO L226 Difference]: Without dead ends: 255925 [2019-12-27 20:45:54,311 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 20:46:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255925 states. [2019-12-27 20:46:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255925 to 217043. [2019-12-27 20:46:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217043 states. [2019-12-27 20:46:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217043 states to 217043 states and 900881 transitions. [2019-12-27 20:46:12,640 INFO L78 Accepts]: Start accepts. Automaton has 217043 states and 900881 transitions. Word has length 13 [2019-12-27 20:46:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:12,641 INFO L462 AbstractCegarLoop]: Abstraction has 217043 states and 900881 transitions. [2019-12-27 20:46:12,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:46:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217043 states and 900881 transitions. [2019-12-27 20:46:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:46:12,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:12,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:12,645 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1719204338, now seen corresponding path program 1 times [2019-12-27 20:46:12,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:12,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623708094] [2019-12-27 20:46:12,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:12,712 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 20:46:12,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623708094] [2019-12-27 20:46:12,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:12,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:12,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100683110] [2019-12-27 20:46:12,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:12,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:12,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:46:12,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:12,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:12,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:12,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:12,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:12,717 INFO L87 Difference]: Start difference. First operand 217043 states and 900881 transitions. Second operand 3 states. [2019-12-27 20:46:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:12,871 INFO L93 Difference]: Finished difference Result 41850 states and 136635 transitions. [2019-12-27 20:46:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:12,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:46:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:12,941 INFO L225 Difference]: With dead ends: 41850 [2019-12-27 20:46:12,941 INFO L226 Difference]: Without dead ends: 41850 [2019-12-27 20:46:12,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41850 states. [2019-12-27 20:46:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41850 to 41850. [2019-12-27 20:46:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41850 states. [2019-12-27 20:46:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41850 states to 41850 states and 136635 transitions. [2019-12-27 20:46:20,176 INFO L78 Accepts]: Start accepts. Automaton has 41850 states and 136635 transitions. Word has length 13 [2019-12-27 20:46:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:20,176 INFO L462 AbstractCegarLoop]: Abstraction has 41850 states and 136635 transitions. [2019-12-27 20:46:20,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 41850 states and 136635 transitions. [2019-12-27 20:46:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 20:46:20,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:20,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] [2019-12-27 20:46:20,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 565965362, now seen corresponding path program 1 times [2019-12-27 20:46:20,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:20,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735939341] [2019-12-27 20:46:20,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:46:20,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735939341] [2019-12-27 20:46:20,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:20,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:46:20,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412232770] [2019-12-27 20:46:20,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:20,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:20,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 83 transitions. [2019-12-27 20:46:20,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:20,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:46:20,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:46:20,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:46:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:46:20,394 INFO L87 Difference]: Start difference. First operand 41850 states and 136635 transitions. Second operand 7 states. [2019-12-27 20:46:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:21,391 INFO L93 Difference]: Finished difference Result 56420 states and 180098 transitions. [2019-12-27 20:46:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:46:21,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 20:46:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:21,486 INFO L225 Difference]: With dead ends: 56420 [2019-12-27 20:46:21,486 INFO L226 Difference]: Without dead ends: 56407 [2019-12-27 20:46:21,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:46:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56407 states. [2019-12-27 20:46:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56407 to 42107. [2019-12-27 20:46:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42107 states. [2019-12-27 20:46:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42107 states to 42107 states and 137336 transitions. [2019-12-27 20:46:22,314 INFO L78 Accepts]: Start accepts. Automaton has 42107 states and 137336 transitions. Word has length 19 [2019-12-27 20:46:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:22,315 INFO L462 AbstractCegarLoop]: Abstraction has 42107 states and 137336 transitions. [2019-12-27 20:46:22,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:46:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 42107 states and 137336 transitions. [2019-12-27 20:46:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:46:22,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:22,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:22,329 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash 967390355, now seen corresponding path program 1 times [2019-12-27 20:46:22,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:22,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464221973] [2019-12-27 20:46:22,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:22,400 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 20:46:22,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464221973] [2019-12-27 20:46:22,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:22,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:46:22,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121601988] [2019-12-27 20:46:22,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:22,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:22,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 20:46:22,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:22,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:46:22,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:46:22,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:46:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:46:22,465 INFO L87 Difference]: Start difference. First operand 42107 states and 137336 transitions. Second operand 6 states. [2019-12-27 20:46:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:22,521 INFO L93 Difference]: Finished difference Result 7672 states and 21026 transitions. [2019-12-27 20:46:22,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:46:22,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:46:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:22,532 INFO L225 Difference]: With dead ends: 7672 [2019-12-27 20:46:22,532 INFO L226 Difference]: Without dead ends: 7672 [2019-12-27 20:46:22,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:46:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-12-27 20:46:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7532. [2019-12-27 20:46:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2019-12-27 20:46:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 20626 transitions. [2019-12-27 20:46:22,912 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 20626 transitions. Word has length 25 [2019-12-27 20:46:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:22,912 INFO L462 AbstractCegarLoop]: Abstraction has 7532 states and 20626 transitions. [2019-12-27 20:46:22,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:46:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 20626 transitions. [2019-12-27 20:46:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:46:22,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:22,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:22,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 628706666, now seen corresponding path program 1 times [2019-12-27 20:46:22,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:22,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106379492] [2019-12-27 20:46:22,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:23,009 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 20:46:23,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106379492] [2019-12-27 20:46:23,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:23,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:46:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166641] [2019-12-27 20:46:23,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:23,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:23,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 20:46:23,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:23,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:23,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:46:23,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:23,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:46:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:46:23,052 INFO L87 Difference]: Start difference. First operand 7532 states and 20626 transitions. Second operand 5 states. [2019-12-27 20:46:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:23,087 INFO L93 Difference]: Finished difference Result 5403 states and 15530 transitions. [2019-12-27 20:46:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:46:23,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 20:46:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:23,097 INFO L225 Difference]: With dead ends: 5403 [2019-12-27 20:46:23,098 INFO L226 Difference]: Without dead ends: 5403 [2019-12-27 20:46:23,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:46:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-27 20:46:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4990. [2019-12-27 20:46:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4990 states. [2019-12-27 20:46:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 14413 transitions. [2019-12-27 20:46:23,216 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 14413 transitions. Word has length 37 [2019-12-27 20:46:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:23,217 INFO L462 AbstractCegarLoop]: Abstraction has 4990 states and 14413 transitions. [2019-12-27 20:46:23,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:46:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 14413 transitions. [2019-12-27 20:46:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:46:23,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:23,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:23,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2046604178, now seen corresponding path program 1 times [2019-12-27 20:46:23,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:23,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058713052] [2019-12-27 20:46:23,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:23,343 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 20:46:23,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058713052] [2019-12-27 20:46:23,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:23,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:46:23,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429602253] [2019-12-27 20:46:23,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:23,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:23,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 296 transitions. [2019-12-27 20:46:23,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:23,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:23,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:23,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:23,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:23,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:23,485 INFO L87 Difference]: Start difference. First operand 4990 states and 14413 transitions. Second operand 3 states. [2019-12-27 20:46:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:23,550 INFO L93 Difference]: Finished difference Result 4999 states and 14422 transitions. [2019-12-27 20:46:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:23,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:46:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:23,559 INFO L225 Difference]: With dead ends: 4999 [2019-12-27 20:46:23,560 INFO L226 Difference]: Without dead ends: 4999 [2019-12-27 20:46:23,560 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 20:46:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2019-12-27 20:46:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4995. [2019-12-27 20:46:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-12-27 20:46:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 14418 transitions. [2019-12-27 20:46:23,632 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 14418 transitions. Word has length 65 [2019-12-27 20:46:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:23,633 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 14418 transitions. [2019-12-27 20:46:23,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 14418 transitions. [2019-12-27 20:46:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:46:23,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:23,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:23,641 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1953615188, now seen corresponding path program 1 times [2019-12-27 20:46:23,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:23,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879581894] [2019-12-27 20:46:23,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:23,755 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 20:46:23,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879581894] [2019-12-27 20:46:23,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:23,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:46:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1878852345] [2019-12-27 20:46:23,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:23,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:23,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 296 transitions. [2019-12-27 20:46:23,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:23,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:46:23,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:46:23,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:46:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:46:23,977 INFO L87 Difference]: Start difference. First operand 4995 states and 14418 transitions. Second operand 7 states. [2019-12-27 20:46:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:24,422 INFO L93 Difference]: Finished difference Result 7929 states and 22569 transitions. [2019-12-27 20:46:24,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:46:24,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 20:46:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:24,436 INFO L225 Difference]: With dead ends: 7929 [2019-12-27 20:46:24,436 INFO L226 Difference]: Without dead ends: 7929 [2019-12-27 20:46:24,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:46:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7929 states. [2019-12-27 20:46:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7929 to 5807. [2019-12-27 20:46:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5807 states. [2019-12-27 20:46:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5807 states to 5807 states and 16815 transitions. [2019-12-27 20:46:24,636 INFO L78 Accepts]: Start accepts. Automaton has 5807 states and 16815 transitions. Word has length 65 [2019-12-27 20:46:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 5807 states and 16815 transitions. [2019-12-27 20:46:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:46:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5807 states and 16815 transitions. [2019-12-27 20:46:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:46:24,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:24,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:24,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash -353598434, now seen corresponding path program 2 times [2019-12-27 20:46:24,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:24,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704378094] [2019-12-27 20:46:24,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:24,753 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 20:46:24,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704378094] [2019-12-27 20:46:24,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:24,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:46:24,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010422349] [2019-12-27 20:46:24,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:24,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:25,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 244 transitions. [2019-12-27 20:46:25,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:25,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:46:25,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:46:25,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:46:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:46:25,129 INFO L87 Difference]: Start difference. First operand 5807 states and 16815 transitions. Second operand 9 states. [2019-12-27 20:46:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:26,476 INFO L93 Difference]: Finished difference Result 13241 states and 38383 transitions. [2019-12-27 20:46:26,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:46:26,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:46:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:26,498 INFO L225 Difference]: With dead ends: 13241 [2019-12-27 20:46:26,499 INFO L226 Difference]: Without dead ends: 13241 [2019-12-27 20:46:26,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:46:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13241 states. [2019-12-27 20:46:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13241 to 6352. [2019-12-27 20:46:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 20:46:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18446 transitions. [2019-12-27 20:46:26,635 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18446 transitions. Word has length 65 [2019-12-27 20:46:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:26,636 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18446 transitions. [2019-12-27 20:46:26,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:46:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18446 transitions. [2019-12-27 20:46:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:46:26,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:26,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:26,648 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:26,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1550061698, now seen corresponding path program 3 times [2019-12-27 20:46:26,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:26,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337947755] [2019-12-27 20:46:26,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:26,749 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 20:46:26,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337947755] [2019-12-27 20:46:26,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:26,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:46:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [917562902] [2019-12-27 20:46:26,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:26,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:27,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 282 states and 560 transitions. [2019-12-27 20:46:27,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:27,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:46:27,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:46:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:46:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:46:27,244 INFO L87 Difference]: Start difference. First operand 6352 states and 18446 transitions. Second operand 13 states. [2019-12-27 20:46:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:29,705 INFO L93 Difference]: Finished difference Result 13864 states and 39378 transitions. [2019-12-27 20:46:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:46:29,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:46:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:29,722 INFO L225 Difference]: With dead ends: 13864 [2019-12-27 20:46:29,722 INFO L226 Difference]: Without dead ends: 13864 [2019-12-27 20:46:29,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:46:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2019-12-27 20:46:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 6957. [2019-12-27 20:46:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-12-27 20:46:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 19846 transitions. [2019-12-27 20:46:29,860 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 19846 transitions. Word has length 65 [2019-12-27 20:46:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:29,860 INFO L462 AbstractCegarLoop]: Abstraction has 6957 states and 19846 transitions. [2019-12-27 20:46:29,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:46:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 19846 transitions. [2019-12-27 20:46:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:46:29,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:29,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:29,870 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1062434320, now seen corresponding path program 4 times [2019-12-27 20:46:29,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:29,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877551951] [2019-12-27 20:46:29,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:29,951 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 20:46:29,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877551951] [2019-12-27 20:46:29,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:29,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:29,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107827332] [2019-12-27 20:46:29,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:29,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:30,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 507 transitions. [2019-12-27 20:46:30,189 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:30,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:46:30,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:46:30,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:46:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:46:30,202 INFO L87 Difference]: Start difference. First operand 6957 states and 19846 transitions. Second operand 4 states. [2019-12-27 20:46:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:30,255 INFO L93 Difference]: Finished difference Result 6366 states and 17934 transitions. [2019-12-27 20:46:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:30,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 20:46:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:30,266 INFO L225 Difference]: With dead ends: 6366 [2019-12-27 20:46:30,266 INFO L226 Difference]: Without dead ends: 6366 [2019-12-27 20:46:30,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:46:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2019-12-27 20:46:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 6198. [2019-12-27 20:46:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6198 states. [2019-12-27 20:46:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 17468 transitions. [2019-12-27 20:46:30,382 INFO L78 Accepts]: Start accepts. Automaton has 6198 states and 17468 transitions. Word has length 65 [2019-12-27 20:46:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:30,382 INFO L462 AbstractCegarLoop]: Abstraction has 6198 states and 17468 transitions. [2019-12-27 20:46:30,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:46:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6198 states and 17468 transitions. [2019-12-27 20:46:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:46:30,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:30,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:30,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash 522553115, now seen corresponding path program 1 times [2019-12-27 20:46:30,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:30,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200337510] [2019-12-27 20:46:30,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:30,542 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 20:46:30,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200337510] [2019-12-27 20:46:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:30,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:46:30,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357993573] [2019-12-27 20:46:30,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:30,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:30,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 287 transitions. [2019-12-27 20:46:30,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:30,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:46:30,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:46:30,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:30,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:46:30,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:46:30,698 INFO L87 Difference]: Start difference. First operand 6198 states and 17468 transitions. Second operand 7 states. [2019-12-27 20:46:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:31,153 INFO L93 Difference]: Finished difference Result 8237 states and 22950 transitions. [2019-12-27 20:46:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:46:31,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 20:46:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:31,164 INFO L225 Difference]: With dead ends: 8237 [2019-12-27 20:46:31,164 INFO L226 Difference]: Without dead ends: 8237 [2019-12-27 20:46:31,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:46:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2019-12-27 20:46:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 6534. [2019-12-27 20:46:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2019-12-27 20:46:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 18400 transitions. [2019-12-27 20:46:31,316 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 18400 transitions. Word has length 66 [2019-12-27 20:46:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:31,316 INFO L462 AbstractCegarLoop]: Abstraction has 6534 states and 18400 transitions. [2019-12-27 20:46:31,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:46:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 18400 transitions. [2019-12-27 20:46:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:46:31,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:31,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:31,325 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1443851743, now seen corresponding path program 2 times [2019-12-27 20:46:31,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:31,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19758374] [2019-12-27 20:46:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:31,404 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 20:46:31,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19758374] [2019-12-27 20:46:31,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:31,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:31,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986734931] [2019-12-27 20:46:31,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:31,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:31,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 436 transitions. [2019-12-27 20:46:31,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:31,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:46:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:31,628 INFO L87 Difference]: Start difference. First operand 6534 states and 18400 transitions. Second operand 3 states. [2019-12-27 20:46:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:31,658 INFO L93 Difference]: Finished difference Result 5919 states and 16477 transitions. [2019-12-27 20:46:31,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:31,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:46:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:31,666 INFO L225 Difference]: With dead ends: 5919 [2019-12-27 20:46:31,667 INFO L226 Difference]: Without dead ends: 5919 [2019-12-27 20:46:31,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 20:46:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5919 states. [2019-12-27 20:46:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5919 to 5751. [2019-12-27 20:46:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5751 states. [2019-12-27 20:46:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 16025 transitions. [2019-12-27 20:46:31,774 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 16025 transitions. Word has length 66 [2019-12-27 20:46:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:31,775 INFO L462 AbstractCegarLoop]: Abstraction has 5751 states and 16025 transitions. [2019-12-27 20:46:31,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 16025 transitions. [2019-12-27 20:46:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:46:31,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:31,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:31,786 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1735728213, now seen corresponding path program 1 times [2019-12-27 20:46:31,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:31,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713675438] [2019-12-27 20:46:31,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:31,853 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 20:46:31,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713675438] [2019-12-27 20:46:31,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:31,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:31,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550423731] [2019-12-27 20:46:31,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:31,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:31,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 210 transitions. [2019-12-27 20:46:31,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:31,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:31,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:31,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:31,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:31,963 INFO L87 Difference]: Start difference. First operand 5751 states and 16025 transitions. Second operand 3 states. [2019-12-27 20:46:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:32,019 INFO L93 Difference]: Finished difference Result 5751 states and 16024 transitions. [2019-12-27 20:46:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:32,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 20:46:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:32,028 INFO L225 Difference]: With dead ends: 5751 [2019-12-27 20:46:32,028 INFO L226 Difference]: Without dead ends: 5751 [2019-12-27 20:46:32,028 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 20:46:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2019-12-27 20:46:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 3410. [2019-12-27 20:46:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2019-12-27 20:46:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9570 transitions. [2019-12-27 20:46:32,088 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9570 transitions. Word has length 67 [2019-12-27 20:46:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:32,088 INFO L462 AbstractCegarLoop]: Abstraction has 3410 states and 9570 transitions. [2019-12-27 20:46:32,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9570 transitions. [2019-12-27 20:46:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:46:32,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:32,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:32,093 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash 567215771, now seen corresponding path program 1 times [2019-12-27 20:46:32,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:32,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457872703] [2019-12-27 20:46:32,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:46:32,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457872703] [2019-12-27 20:46:32,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:32,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:46:32,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1384525951] [2019-12-27 20:46:32,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:32,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:32,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 312 transitions. [2019-12-27 20:46:32,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:32,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:46:32,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:46:32,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:32,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:46:32,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:46:32,694 INFO L87 Difference]: Start difference. First operand 3410 states and 9570 transitions. Second operand 14 states. [2019-12-27 20:46:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:34,509 INFO L93 Difference]: Finished difference Result 13123 states and 37053 transitions. [2019-12-27 20:46:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:46:34,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 20:46:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:34,517 INFO L225 Difference]: With dead ends: 13123 [2019-12-27 20:46:34,517 INFO L226 Difference]: Without dead ends: 5315 [2019-12-27 20:46:34,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:46:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2019-12-27 20:46:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 2822. [2019-12-27 20:46:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 20:46:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 7863 transitions. [2019-12-27 20:46:34,572 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 7863 transitions. Word has length 68 [2019-12-27 20:46:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:34,572 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 7863 transitions. [2019-12-27 20:46:34,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:46:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 7863 transitions. [2019-12-27 20:46:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:46:34,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:34,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:34,576 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash 823879635, now seen corresponding path program 2 times [2019-12-27 20:46:34,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:34,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144204208] [2019-12-27 20:46:34,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:34,702 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 20:46:34,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144204208] [2019-12-27 20:46:34,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:34,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:46:34,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036515611] [2019-12-27 20:46:34,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:34,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:34,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 265 transitions. [2019-12-27 20:46:34,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:34,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:46:34,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:46:34,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:46:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:46:34,892 INFO L87 Difference]: Start difference. First operand 2822 states and 7863 transitions. Second operand 6 states. [2019-12-27 20:46:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:35,035 INFO L93 Difference]: Finished difference Result 5162 states and 14414 transitions. [2019-12-27 20:46:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:46:35,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 20:46:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:35,040 INFO L225 Difference]: With dead ends: 5162 [2019-12-27 20:46:35,040 INFO L226 Difference]: Without dead ends: 2282 [2019-12-27 20:46:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:46:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-12-27 20:46:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1898. [2019-12-27 20:46:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-27 20:46:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5237 transitions. [2019-12-27 20:46:35,103 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5237 transitions. Word has length 68 [2019-12-27 20:46:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:35,103 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 5237 transitions. [2019-12-27 20:46:35,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:46:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5237 transitions. [2019-12-27 20:46:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:46:35,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:35,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:35,107 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -149569657, now seen corresponding path program 3 times [2019-12-27 20:46:35,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:35,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163759666] [2019-12-27 20:46:35,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:46:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:46:35,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:46:35,226 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:46:35,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$w_buff1~0_28) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x$flush_delayed~0_15 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~main$tmp_guard1~0_11 0) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20| 1)) (= v_~x~0_29 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t748~0.base_20| 4)) (= v_~y~0_12 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20|) |v_ULTIMATE.start_main_~#t748~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t748~0.base_20|) (= |v_ULTIMATE.start_main_~#t748~0.offset_17| 0) (= v_~x$w_buff1_used~0_72 0) (= v_~x$r_buff1_thd0~0_46 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$w_buff0_used~0_118) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20|)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start_main_~#t748~0.base=|v_ULTIMATE.start_main_~#t748~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_28, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_~#t748~0.offset=|v_ULTIMATE.start_main_~#t748~0.offset_17|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_12, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_9, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t749~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t748~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t750~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t748~0.offset, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t749~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t750~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:46:35,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L810-1-->L812: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t749~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t749~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13|) |v_ULTIMATE.start_main_~#t749~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t749~0.base_13|) (= |v_ULTIMATE.start_main_~#t749~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_11|, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t749~0.offset, ULTIMATE.start_main_~#t749~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:46:35,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13|) |v_ULTIMATE.start_main_~#t750~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t750~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t750~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t750~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t750~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t750~0.offset, #length, ULTIMATE.start_main_~#t750~0.base] because there is no mapped edge [2019-12-27 20:46:35,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_20) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0_used~0_104) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= 2 v_~x$w_buff0~0_18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:46:35,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In609108341 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In609108341 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out609108341| ~x$w_buff1~0_In609108341) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out609108341| ~x~0_In609108341)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In609108341, ~x$w_buff1_used~0=~x$w_buff1_used~0_In609108341, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In609108341, ~x~0=~x~0_In609108341} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out609108341|, ~x$w_buff1~0=~x$w_buff1~0_In609108341, ~x$w_buff1_used~0=~x$w_buff1_used~0_In609108341, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In609108341, ~x~0=~x~0_In609108341} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:46:35,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_19) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 20:46:35,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1950701250 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1950701250 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1950701250| |P0Thread1of1ForFork0_#t~ite4_Out1950701250|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out1950701250| ~x$w_buff1~0_In1950701250) (not .cse0) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1950701250| ~x~0_In1950701250) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1950701250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1950701250, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1950701250, ~x~0=~x~0_In1950701250} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1950701250|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1950701250|, ~x$w_buff1~0=~x$w_buff1~0_In1950701250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1950701250, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1950701250, ~x~0=~x~0_In1950701250} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 20:46:35,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-518765207 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-518765207 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-518765207|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-518765207 |P0Thread1of1ForFork0_#t~ite5_Out-518765207|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-518765207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-518765207} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-518765207|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-518765207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-518765207} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:46:35,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1673704496 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1673704496 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1673704496|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1673704496| ~x$w_buff0_used~0_In-1673704496)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673704496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673704496} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673704496, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1673704496|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673704496} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 20:46:35,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2091238546 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2091238546 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2091238546 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In2091238546 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2091238546 |P2Thread1of1ForFork2_#t~ite18_Out2091238546|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2091238546|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2091238546, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2091238546, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2091238546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2091238546} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2091238546, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2091238546, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2091238546, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2091238546|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2091238546} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 20:46:35,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-452395223 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-452395223 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-452395223 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-452395223 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-452395223|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-452395223 |P0Thread1of1ForFork0_#t~ite6_Out-452395223|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-452395223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452395223, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-452395223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452395223} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-452395223|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-452395223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452395223, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-452395223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452395223} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:46:35,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1278671096 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1278671096 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1278671096| ~x$r_buff0_thd3~0_In1278671096) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1278671096| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1278671096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278671096} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1278671096, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1278671096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278671096} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 20:46:35,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In600876650 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In600876650 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In600876650 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In600876650 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out600876650| 0)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In600876650 |P2Thread1of1ForFork2_#t~ite20_Out600876650|) (or .cse2 .cse3)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In600876650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In600876650, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In600876650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In600876650} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out600876650|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In600876650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In600876650, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In600876650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In600876650} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 20:46:35,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:46:35,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1722763791 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1722763791 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1722763791| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1722763791| ~x$w_buff0_used~0_In-1722763791)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1722763791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1722763791} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1722763791|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1722763791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1722763791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 20:46:35,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1303559465 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1303559465 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1303559465 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1303559465 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out1303559465| ~x$w_buff1_used~0_In1303559465) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1303559465| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1303559465, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1303559465, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1303559465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303559465} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1303559465, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1303559465, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1303559465|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1303559465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303559465} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 20:46:35,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2055379176 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2055379176 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out2055379176 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out2055379176 ~x$r_buff0_thd2~0_In2055379176)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2055379176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2055379176} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2055379176|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2055379176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2055379176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:46:35,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1044966980 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1044966980 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1044966980 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1044966980 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-1044966980| ~x$r_buff1_thd2~0_In-1044966980)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1044966980| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1044966980, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1044966980, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1044966980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1044966980} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1044966980, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1044966980, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1044966980, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1044966980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1044966980} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:46:35,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:46:35,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1303878185 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1303878185 256)))) (or (and (= ~x$r_buff0_thd1~0_In1303878185 |P0Thread1of1ForFork0_#t~ite7_Out1303878185|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1303878185|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1303878185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303878185} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1303878185, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1303878185|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1303878185} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 20:46:35,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1037107622 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1037107622 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1037107622 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1037107622 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1037107622| ~x$r_buff1_thd1~0_In-1037107622) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1037107622|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1037107622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1037107622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1037107622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037107622} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1037107622, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1037107622|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1037107622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1037107622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037107622} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:46:35,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 20:46:35,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:46:35,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out840173332| |ULTIMATE.start_main_#t~ite24_Out840173332|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In840173332 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In840173332 256) 0))) (or (and .cse0 (= ~x~0_In840173332 |ULTIMATE.start_main_#t~ite24_Out840173332|) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite24_Out840173332| ~x$w_buff1~0_In840173332) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In840173332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In840173332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In840173332, ~x~0=~x~0_In840173332} OutVars{~x$w_buff1~0=~x$w_buff1~0_In840173332, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out840173332|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out840173332|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In840173332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In840173332, ~x~0=~x~0_In840173332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 20:46:35,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-507054571 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-507054571 256) 0))) (or (and (= ~x$w_buff0_used~0_In-507054571 |ULTIMATE.start_main_#t~ite26_Out-507054571|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-507054571|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-507054571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507054571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-507054571, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-507054571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507054571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 20:46:35,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In843892299 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In843892299 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In843892299 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In843892299 256)))) (or (and (= ~x$w_buff1_used~0_In843892299 |ULTIMATE.start_main_#t~ite27_Out843892299|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out843892299|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In843892299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In843892299, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In843892299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In843892299} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In843892299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In843892299, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out843892299|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In843892299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In843892299} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 20:46:35,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-595977031 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-595977031 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-595977031|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-595977031 |ULTIMATE.start_main_#t~ite28_Out-595977031|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-595977031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595977031} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-595977031, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-595977031|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595977031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 20:46:35,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In584448312 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In584448312 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In584448312 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In584448312 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out584448312|)) (and (= ~x$r_buff1_thd0~0_In584448312 |ULTIMATE.start_main_#t~ite29_Out584448312|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In584448312, ~x$w_buff1_used~0=~x$w_buff1_used~0_In584448312, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In584448312, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584448312} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In584448312, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out584448312|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In584448312, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In584448312, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584448312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 20:46:35,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (= v_~x$r_buff0_thd0~0_59 v_~x$r_buff0_thd0~0_58) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:46:35,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L839-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:46:35,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:46:35,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:46:35 BasicIcfg [2019-12-27 20:46:35,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:46:35,387 INFO L168 Benchmark]: Toolchain (without parser) took 112777.32 ms. Allocated memory was 137.4 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 98.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,388 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.61 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 98.5 MB in the beginning and 154.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.26 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,390 INFO L168 Benchmark]: Boogie Preprocessor took 84.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,390 INFO L168 Benchmark]: RCFGBuilder took 863.65 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,391 INFO L168 Benchmark]: TraceAbstraction took 110934.18 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 20:46:35,395 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.61 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 98.5 MB in the beginning and 154.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.26 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.65 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110934.18 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 175 ProgramPointsBefore, 97 ProgramPointsAfterwards, 212 TransitionsBefore, 110 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5221 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82846 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2814 SDtfs, 3204 SDslu, 7029 SDs, 0 SdLazy, 5519 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 88 SyntacticMatches, 31 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217043occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 93110 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 130584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...