/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:31:18,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:31:18,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:31:18,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:31:18,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:31:18,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:31:18,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:31:18,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:31:18,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:31:18,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:31:18,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:31:18,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:31:18,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:31:18,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:31:18,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:31:18,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:31:18,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:31:18,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:31:18,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:31:18,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:31:18,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:31:18,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:31:18,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:31:18,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:31:18,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:31:18,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:31:18,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:31:18,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:31:18,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:31:18,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:31:18,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:31:18,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:31:18,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:31:18,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:31:18,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:31:18,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:31:18,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:31:18,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:31:18,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:31:18,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:31:18,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:31:18,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:31:18,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:31:18,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:31:18,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:31:18,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:31:18,572 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:31:18,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:31:18,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:31:18,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:31:18,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:31:18,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:31:18,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:31:18,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:31:18,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:31:18,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:31:18,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:31:18,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:31:18,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:31:18,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:31:18,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:31:18,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:31:18,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:31:18,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:31:18,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:31:18,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:31:18,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:31:18,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:31:18,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:31:18,578 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:31:18,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:31:18,578 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:31:18,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:31:18,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:31:18,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:31:18,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:31:18,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:31:18,892 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:31:18,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_pso.oepc.i [2019-12-27 18:31:18,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c5305e0/6fe7c53f6e56422583376e4651d31994/FLAG376a8b31f [2019-12-27 18:31:19,528 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:31:19,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_pso.oepc.i [2019-12-27 18:31:19,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c5305e0/6fe7c53f6e56422583376e4651d31994/FLAG376a8b31f [2019-12-27 18:31:19,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c5305e0/6fe7c53f6e56422583376e4651d31994 [2019-12-27 18:31:19,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:31:19,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:31:19,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:19,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:31:19,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:31:19,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:19" (1/1) ... [2019-12-27 18:31:19,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:19, skipping insertion in model container [2019-12-27 18:31:19,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:19" (1/1) ... [2019-12-27 18:31:19,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:31:19,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:31:20,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:20,507 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:31:20,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:20,670 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:31:20,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20 WrapperNode [2019-12-27 18:31:20,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:20,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:20,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:31:20,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:31:20,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:20,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:31:20,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:31:20,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:31:20,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (1/1) ... [2019-12-27 18:31:20,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:31:20,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:31:20,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:31:20,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:31:20,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (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 18:31:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:31:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:31:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:31:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:31:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:31:20,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:31:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:31:20,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:31:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:31:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:31:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:31:20,886 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 18:31:21,559 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:31:21,560 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:31:21,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:21 BoogieIcfgContainer [2019-12-27 18:31:21,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:31:21,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:31:21,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:31:21,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:31:21,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:31:19" (1/3) ... [2019-12-27 18:31:21,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6592a3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:21, skipping insertion in model container [2019-12-27 18:31:21,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:20" (2/3) ... [2019-12-27 18:31:21,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6592a3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:21, skipping insertion in model container [2019-12-27 18:31:21,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:21" (3/3) ... [2019-12-27 18:31:21,573 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.oepc.i [2019-12-27 18:31:21,586 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:31:21,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:31:21,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:31:21,599 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:31:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,720 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:21,740 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:31:21,762 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:31:21,762 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:31:21,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:31:21,762 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:31:21,762 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:31:21,763 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:31:21,763 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:31:21,763 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:31:21,780 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 18:31:21,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:21,901 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:21,902 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:21,916 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:21,931 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:21,997 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:21,998 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:22,004 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:22,018 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 18:31:22,019 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:31:26,626 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 18:31:26,808 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 18:31:26,808 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 18:31:26,812 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 18:31:27,213 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 18:31:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 18:31:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:31:27,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:27,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:31:27,223 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 18:31:27,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:27,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750882041] [2019-12-27 18:31:27,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:27,442 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 18:31:27,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750882041] [2019-12-27 18:31:27,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:27,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:27,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2707373] [2019-12-27 18:31:27,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:27,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:27,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:31:27,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:27,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:27,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:27,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:27,486 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 18:31:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:27,724 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 18:31:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:27,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:31:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:27,804 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 18:31:27,805 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 18:31:27,808 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 18:31:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 18:31:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 18:31:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 18:31:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 18:31:28,363 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 18:31:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:28,363 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 18:31:28,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 18:31:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:31:28,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:28,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:28,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 18:31:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486722478] [2019-12-27 18:31:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:28,510 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 18:31:28,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486722478] [2019-12-27 18:31:28,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:28,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:28,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129152194] [2019-12-27 18:31:28,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:28,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:28,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:31:28,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:28,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:28,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:28,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:28,520 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 18:31:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:28,925 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 18:31:28,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:28,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:31:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:29,012 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 18:31:29,013 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 18:31:29,015 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 18:31:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 18:31:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 18:31:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 18:31:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 18:31:29,541 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 18:31:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:29,541 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 18:31:29,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 18:31:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:31:29,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:29,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:29,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:29,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 18:31:29,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:29,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745820209] [2019-12-27 18:31:29,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:29,639 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 18:31:29,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745820209] [2019-12-27 18:31:29,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:29,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:29,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972599138] [2019-12-27 18:31:29,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:29,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:29,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 18:31:29,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:29,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:29,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:31:29,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:31:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:29,653 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 18:31:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:30,043 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 18:31:30,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:31:30,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:31:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:30,092 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 18:31:30,092 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 18:31:30,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 18:31:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 18:31:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 18:31:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 18:31:31,163 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 18:31:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:31,165 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 18:31:31,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:31:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 18:31:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:31:31,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:31,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:31,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 18:31:31,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:31,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462290674] [2019-12-27 18:31:31,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:31,260 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 18:31:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462290674] [2019-12-27 18:31:31,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:31,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:31,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315936799] [2019-12-27 18:31:31,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:31,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:31,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 18:31:31,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:31,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:31,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:31,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:31,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:31,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:31,268 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 18:31:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:31,329 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-27 18:31:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:31,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 18:31:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:31,364 INFO L225 Difference]: With dead ends: 11335 [2019-12-27 18:31:31,365 INFO L226 Difference]: Without dead ends: 11335 [2019-12-27 18:31:31,365 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 18:31:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-27 18:31:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-27 18:31:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-27 18:31:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-27 18:31:31,810 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-27 18:31:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:31,810 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-27 18:31:31,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-27 18:31:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:31:31,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:31,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:31,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-27 18:31:31,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:31,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697066825] [2019-12-27 18:31:31,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:31,866 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 18:31:31,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697066825] [2019-12-27 18:31:31,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:31,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:31,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532047338] [2019-12-27 18:31:31,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:31,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:31,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 18:31:31,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:31,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:31:31,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:31,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:31,895 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-27 18:31:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:32,026 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-27 18:31:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:32,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 18:31:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:32,051 INFO L225 Difference]: With dead ends: 18566 [2019-12-27 18:31:32,051 INFO L226 Difference]: Without dead ends: 9176 [2019-12-27 18:31:32,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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 18:31:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-27 18:31:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-27 18:31:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-27 18:31:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-27 18:31:32,313 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-27 18:31:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:32,313 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-27 18:31:32,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-27 18:31:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:31:32,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:32,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:32,318 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-27 18:31:32,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:32,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470495366] [2019-12-27 18:31:32,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:32,378 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 18:31:32,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470495366] [2019-12-27 18:31:32,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:32,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:32,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113570648] [2019-12-27 18:31:32,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:32,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:32,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:31:32,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:32,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:32,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:32,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:32,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:32,388 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 3 states. [2019-12-27 18:31:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:32,440 INFO L93 Difference]: Finished difference Result 8732 states and 26564 transitions. [2019-12-27 18:31:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:32,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:31:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:32,461 INFO L225 Difference]: With dead ends: 8732 [2019-12-27 18:31:32,461 INFO L226 Difference]: Without dead ends: 8732 [2019-12-27 18:31:32,462 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 18:31:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2019-12-27 18:31:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 8732. [2019-12-27 18:31:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2019-12-27 18:31:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 26564 transitions. [2019-12-27 18:31:32,973 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 26564 transitions. Word has length 18 [2019-12-27 18:31:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:32,974 INFO L462 AbstractCegarLoop]: Abstraction has 8732 states and 26564 transitions. [2019-12-27 18:31:32,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 26564 transitions. [2019-12-27 18:31:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:31:32,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:32,981 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 18:31:32,981 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-27 18:31:32,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:32,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795976185] [2019-12-27 18:31:32,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:33,114 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 18:31:33,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795976185] [2019-12-27 18:31:33,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:33,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:33,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736576798] [2019-12-27 18:31:33,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:33,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:33,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 25 transitions. [2019-12-27 18:31:33,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:33,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:31:33,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:33,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:33,137 INFO L87 Difference]: Start difference. First operand 8732 states and 26564 transitions. Second operand 4 states. [2019-12-27 18:31:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:33,181 INFO L93 Difference]: Finished difference Result 1587 states and 3865 transitions. [2019-12-27 18:31:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:33,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 18:31:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:33,185 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 18:31:33,186 INFO L226 Difference]: Without dead ends: 1155 [2019-12-27 18:31:33,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-27 18:31:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2019-12-27 18:31:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-12-27 18:31:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2511 transitions. [2019-12-27 18:31:33,206 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2511 transitions. Word has length 19 [2019-12-27 18:31:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:33,207 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 2511 transitions. [2019-12-27 18:31:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2511 transitions. [2019-12-27 18:31:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 18:31:33,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:33,208 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] [2019-12-27 18:31:33,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 18:31:33,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:33,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581076027] [2019-12-27 18:31:33,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:33,328 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 18:31:33,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581076027] [2019-12-27 18:31:33,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:33,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:33,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567414636] [2019-12-27 18:31:33,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:33,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:33,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 18:31:33,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:33,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:33,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:33,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:33,341 INFO L87 Difference]: Start difference. First operand 1155 states and 2511 transitions. Second operand 6 states. [2019-12-27 18:31:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:33,576 INFO L93 Difference]: Finished difference Result 1173 states and 2521 transitions. [2019-12-27 18:31:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:31:33,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 18:31:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:33,579 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 18:31:33,579 INFO L226 Difference]: Without dead ends: 1121 [2019-12-27 18:31:33,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:31:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-27 18:31:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1100. [2019-12-27 18:31:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-12-27 18:31:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2394 transitions. [2019-12-27 18:31:33,599 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2394 transitions. Word has length 24 [2019-12-27 18:31:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:33,599 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 2394 transitions. [2019-12-27 18:31:33,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2394 transitions. [2019-12-27 18:31:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:31:33,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:33,601 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] [2019-12-27 18:31:33,601 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-27 18:31:33,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:33,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515145263] [2019-12-27 18:31:33,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:33,718 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 18:31:33,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515145263] [2019-12-27 18:31:33,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:33,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:33,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667132620] [2019-12-27 18:31:33,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:33,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:33,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 18:31:33,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:33,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:33,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:33,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:33,789 INFO L87 Difference]: Start difference. First operand 1100 states and 2394 transitions. Second operand 6 states. [2019-12-27 18:31:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:33,836 INFO L93 Difference]: Finished difference Result 556 states and 1184 transitions. [2019-12-27 18:31:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:33,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:31:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:33,837 INFO L225 Difference]: With dead ends: 556 [2019-12-27 18:31:33,837 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 18:31:33,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:31:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 18:31:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-27 18:31:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-27 18:31:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-27 18:31:33,845 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 28 [2019-12-27 18:31:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:33,846 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-27 18:31:33,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-27 18:31:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:33,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:33,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:33,848 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 1 times [2019-12-27 18:31:33,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607444956] [2019-12-27 18:31:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:33,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 18:31:33,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607444956] [2019-12-27 18:31:33,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:33,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:33,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511032704] [2019-12-27 18:31:33,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:33,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:34,014 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 96 transitions. [2019-12-27 18:31:34,014 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:34,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:34,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:31:34,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:31:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:34,074 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 9 states. [2019-12-27 18:31:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:34,449 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-27 18:31:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:31:34,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 18:31:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:34,451 INFO L225 Difference]: With dead ends: 982 [2019-12-27 18:31:34,451 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 18:31:34,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:31:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 18:31:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-27 18:31:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 18:31:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-27 18:31:34,462 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-27 18:31:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:34,462 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-27 18:31:34,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:31:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-27 18:31:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:34,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:34,464 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] [2019-12-27 18:31:34,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 2 times [2019-12-27 18:31:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:34,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939475593] [2019-12-27 18:31:34,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:34,601 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 18:31:34,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939475593] [2019-12-27 18:31:34,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:34,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:31:34,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353507420] [2019-12-27 18:31:34,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:34,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:34,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 98 transitions. [2019-12-27 18:31:34,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:34,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:31:34,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:34,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:34,711 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 6 states. [2019-12-27 18:31:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:35,133 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-27 18:31:35,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:31:35,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 18:31:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:35,136 INFO L225 Difference]: With dead ends: 885 [2019-12-27 18:31:35,137 INFO L226 Difference]: Without dead ends: 861 [2019-12-27 18:31:35,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-27 18:31:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-27 18:31:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-27 18:31:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-27 18:31:35,149 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-27 18:31:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:35,149 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-27 18:31:35,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-27 18:31:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:35,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:35,152 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] [2019-12-27 18:31:35,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 3 times [2019-12-27 18:31:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187334397] [2019-12-27 18:31:35,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:35,228 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 18:31:35,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187334397] [2019-12-27 18:31:35,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:35,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:35,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594934048] [2019-12-27 18:31:35,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:35,244 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:35,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 101 transitions. [2019-12-27 18:31:35,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:35,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:35,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:35,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:35,295 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-27 18:31:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:35,353 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-27 18:31:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:35,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 18:31:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:35,355 INFO L225 Difference]: With dead ends: 923 [2019-12-27 18:31:35,355 INFO L226 Difference]: Without dead ends: 923 [2019-12-27 18:31:35,355 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 18:31:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-27 18:31:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-27 18:31:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 18:31:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 18:31:35,370 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 18:31:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:35,370 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 18:31:35,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 18:31:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:31:35,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:35,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:35,374 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 18:31:35,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:35,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122975385] [2019-12-27 18:31:35,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:35,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:31:35,576 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:31:35,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 |v_ULTIMATE.start_main_~#t2309~0.offset_31|) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48| 1)) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| 4)) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2309~0.base_48|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48|) |v_ULTIMATE.start_main_~#t2309~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2309~0.offset=|v_ULTIMATE.start_main_~#t2309~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2309~0.base=|v_ULTIMATE.start_main_~#t2309~0.base_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_31|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_49|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2309~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2310~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:35,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2310~0.base_13|) (= |v_ULTIMATE.start_main_~#t2310~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2310~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13|) |v_ULTIMATE.start_main_~#t2310~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2310~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, #length] because there is no mapped edge [2019-12-27 18:31:35,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd0~0_Out-2046287273 ~y$r_buff0_thd0~0_In-2046287273) (= ~y$r_buff1_thd2~0_Out-2046287273 ~y$r_buff0_thd2~0_In-2046287273) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2046287273)) (= 1 ~y$r_buff0_thd1~0_Out-2046287273) (= ~y$r_buff0_thd1~0_In-2046287273 ~y$r_buff1_thd1~0_Out-2046287273) (= 1 ~x~0_Out-2046287273)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2046287273, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2046287273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2046287273, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2046287273} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2046287273, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2046287273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2046287273, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2046287273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2046287273, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2046287273, ~x~0=~x~0_Out-2046287273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2046287273} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:31:35,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-919165022 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-919165022 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-919165022| ~y$w_buff0_used~0_In-919165022) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-919165022| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-919165022, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-919165022} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-919165022|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-919165022, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-919165022} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:31:35,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In312737693 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In312737693| |P1Thread1of1ForFork1_#t~ite20_Out312737693|) (= |P1Thread1of1ForFork1_#t~ite21_Out312737693| ~y$w_buff0_used~0_In312737693)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In312737693 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In312737693 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In312737693 256)) (and (= (mod ~y$w_buff1_used~0_In312737693 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out312737693| ~y$w_buff0_used~0_In312737693) (= |P1Thread1of1ForFork1_#t~ite21_Out312737693| |P1Thread1of1ForFork1_#t~ite20_Out312737693|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In312737693, ~y$w_buff0_used~0=~y$w_buff0_used~0_In312737693, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In312737693|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In312737693, ~weak$$choice2~0=~weak$$choice2~0_In312737693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312737693} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In312737693, ~y$w_buff0_used~0=~y$w_buff0_used~0_In312737693, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out312737693|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In312737693, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out312737693|, ~weak$$choice2~0=~weak$$choice2~0_In312737693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312737693} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 18:31:35,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In458136706 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In458136706 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In458136706 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out458136706| |P1Thread1of1ForFork1_#t~ite23_Out458136706|)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In458136706 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In458136706 256)))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In458136706| |P1Thread1of1ForFork1_#t~ite23_Out458136706|) (= ~y$w_buff1_used~0_In458136706 |P1Thread1of1ForFork1_#t~ite24_Out458136706|) (not .cse0)) (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3)) (= ~y$w_buff1_used~0_In458136706 |P1Thread1of1ForFork1_#t~ite23_Out458136706|) .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_In458136706| |P1Thread1of1ForFork1_#t~ite22_Out458136706|)) (let ((.cse6 (not .cse3))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out458136706| |P1Thread1of1ForFork1_#t~ite22_Out458136706|) (not .cse1) (or (not .cse2) .cse6) .cse5 (or (not .cse4) .cse6) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out458136706|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In458136706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In458136706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In458136706, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In458136706|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In458136706|, ~weak$$choice2~0=~weak$$choice2~0_In458136706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In458136706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In458136706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In458136706, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out458136706|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out458136706|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out458136706|, ~weak$$choice2~0=~weak$$choice2~0_In458136706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 18:31:35,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1126112064 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1126112064 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1126112064 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1126112064 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1126112064 |P0Thread1of1ForFork0_#t~ite6_Out-1126112064|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1126112064|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1126112064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126112064, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1126112064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126112064} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1126112064|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1126112064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126112064, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1126112064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126112064} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:31:35,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In374412876 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In374412876 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out374412876) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out374412876 ~y$r_buff0_thd1~0_In374412876) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In374412876, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374412876} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In374412876, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out374412876|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out374412876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:31:35,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1165747667 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1165747667 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1165747667 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1165747667 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1165747667|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-1165747667 |P0Thread1of1ForFork0_#t~ite8_Out-1165747667|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1165747667, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165747667, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1165747667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165747667} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1165747667, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165747667, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1165747667|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1165747667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165747667} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:31:35,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:35,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2121954584 256) 0))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In-2121954584 |P1Thread1of1ForFork1_#t~ite29_Out-2121954584|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2121954584 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-2121954584 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-2121954584 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-2121954584 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out-2121954584| |P1Thread1of1ForFork1_#t~ite29_Out-2121954584|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2121954584| |P1Thread1of1ForFork1_#t~ite29_Out-2121954584|) (= ~y$r_buff1_thd2~0_In-2121954584 |P1Thread1of1ForFork1_#t~ite30_Out-2121954584|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2121954584, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2121954584|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121954584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121954584, ~weak$$choice2~0=~weak$$choice2~0_In-2121954584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121954584} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2121954584, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2121954584|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2121954584|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121954584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121954584, ~weak$$choice2~0=~weak$$choice2~0_In-2121954584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121954584} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 18:31:35,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 18:31:35,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1701534044 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1701534044 256) 0))) (or (and (= ~y~0_In-1701534044 |P1Thread1of1ForFork1_#t~ite32_Out-1701534044|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1701534044| ~y$w_buff1~0_In-1701534044)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1701534044, ~y$w_buff1~0=~y$w_buff1~0_In-1701534044, ~y~0=~y~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1701534044, ~y$w_buff1~0=~y$w_buff1~0_In-1701534044, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1701534044|, ~y~0=~y~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:31:35,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 18:31:35,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In128598949 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In128598949 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out128598949| ~y$w_buff0_used~0_In128598949)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out128598949| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128598949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128598949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128598949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128598949, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out128598949|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:31:35,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1006689771 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1006689771 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1006689771 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1006689771 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1006689771| ~y$w_buff1_used~0_In1006689771)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1006689771| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1006689771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1006689771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006689771} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1006689771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1006689771, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1006689771|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006689771} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:31:35,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1284707139 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1284707139 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1284707139| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1284707139| ~y$r_buff0_thd2~0_In-1284707139)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284707139, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1284707139} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284707139, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1284707139, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1284707139|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:31:35,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-942360757 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-942360757 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-942360757 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-942360757 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-942360757 |P1Thread1of1ForFork1_#t~ite37_Out-942360757|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-942360757|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-942360757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-942360757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-942360757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-942360757} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-942360757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-942360757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-942360757, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-942360757|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-942360757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:35,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:35,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:31:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:31:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In561754081 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In561754081 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out561754081| ~y~0_In561754081)) (and (= |ULTIMATE.start_main_#t~ite40_Out561754081| ~y$w_buff1~0_In561754081) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In561754081, ~y~0=~y~0_In561754081, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In561754081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561754081} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out561754081|, ~y$w_buff1~0=~y$w_buff1~0_In561754081, ~y~0=~y~0_In561754081, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In561754081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561754081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 18:31:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 18:31:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-262592848 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-262592848 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-262592848| ~y$w_buff0_used~0_In-262592848) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-262592848| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-262592848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-262592848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-262592848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-262592848, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-262592848|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:31:35,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In841970064 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In841970064 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In841970064 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In841970064 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out841970064|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In841970064 |ULTIMATE.start_main_#t~ite43_Out841970064|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In841970064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In841970064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In841970064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In841970064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In841970064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In841970064, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out841970064|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In841970064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In841970064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:31:35,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1848716841 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1848716841 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1848716841|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1848716841 |ULTIMATE.start_main_#t~ite44_Out-1848716841|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848716841, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1848716841} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848716841, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1848716841, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1848716841|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:31:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1705305003 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1705305003 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1705305003 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1705305003 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1705305003 |ULTIMATE.start_main_#t~ite45_Out1705305003|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1705305003|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1705305003, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705305003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705305003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705305003} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1705305003, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705305003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705305003, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1705305003|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705305003} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:31:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:31:35,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:31:35 BasicIcfg [2019-12-27 18:31:35,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:31:35,706 INFO L168 Benchmark]: Toolchain (without parser) took 15880.54 ms. Allocated memory was 144.7 MB in the beginning and 709.4 MB in the end (delta: 564.7 MB). Free memory was 100.8 MB in the beginning and 256.8 MB in the end (delta: -156.0 MB). Peak memory consumption was 408.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,707 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.52 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 154.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.13 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,712 INFO L168 Benchmark]: Boogie Preprocessor took 36.57 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,715 INFO L168 Benchmark]: RCFGBuilder took 764.91 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 105.9 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,717 INFO L168 Benchmark]: TraceAbstraction took 14138.04 ms. Allocated memory was 202.9 MB in the beginning and 709.4 MB in the end (delta: 506.5 MB). Free memory was 105.2 MB in the beginning and 256.8 MB in the end (delta: -151.7 MB). Peak memory consumption was 354.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:35,725 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 847.52 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 154.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.13 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.57 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 764.91 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 105.9 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14138.04 ms. Allocated memory was 202.9 MB in the beginning and 709.4 MB in the end (delta: 506.5 MB). Free memory was 105.2 MB in the beginning and 256.8 MB in the end (delta: -151.7 MB). Peak memory consumption was 354.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1237 SDtfs, 1581 SDslu, 2431 SDs, 0 SdLazy, 1119 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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: 3.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 4812 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 27785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...