/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:14:03,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:14:03,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:14:03,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:14:03,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:14:03,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:14:03,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:14:03,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:14:03,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:14:03,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:14:03,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:14:03,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:14:03,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:14:03,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:14:03,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:14:03,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:14:03,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:14:03,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:14:03,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:14:03,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:14:03,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:14:03,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:14:03,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:14:03,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:14:03,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:14:03,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:14:03,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:14:03,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:14:03,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:14:03,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:14:03,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:14:03,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:14:03,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:14:03,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:14:03,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:14:03,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:14:03,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:14:03,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:14:03,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:14:03,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:14:03,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:14:03,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:14:03,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:14:03,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:14:03,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:14:03,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:14:03,697 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:14:03,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:14:03,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:14:03,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:14:03,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:14:03,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:14:03,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:14:03,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:14:03,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:14:03,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:14:03,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:14:03,699 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:14:03,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:14:03,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:14:03,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:14:03,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:14:03,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:14:03,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:14:03,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:14:03,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:14:03,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:14:03,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:14:03,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:14:03,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:14:03,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:14:03,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:14:03,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:14:03,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:14:03,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:14:03,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:14:03,982 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:14:03,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-27 00:14:04,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce56c2d/fc833484a2704ab5981b7fbf7e953db2/FLAGef90df26c [2019-12-27 00:14:04,624 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:14:04,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-27 00:14:04,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce56c2d/fc833484a2704ab5981b7fbf7e953db2/FLAGef90df26c [2019-12-27 00:14:04,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ce56c2d/fc833484a2704ab5981b7fbf7e953db2 [2019-12-27 00:14:04,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:14:04,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:14:04,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:14:04,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:14:04,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:14:04,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:14:04" (1/1) ... [2019-12-27 00:14:04,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e917af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:04, skipping insertion in model container [2019-12-27 00:14:04,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:14:04" (1/1) ... [2019-12-27 00:14:04,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:14:04,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:14:05,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:14:05,591 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:14:05,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:14:05,788 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:14:05,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05 WrapperNode [2019-12-27 00:14:05,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:14:05,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:14:05,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:14:05,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:14:05,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:14:05,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:14:05,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:14:05,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:14:05,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... [2019-12-27 00:14:05,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:14:05,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:14:05,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:14:05,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:14:05,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:14:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:14:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:14:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:14:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:14:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:14:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:14:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:14:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:14:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:14:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:14:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:14:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:14:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:14:05,972 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:14:06,670 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:14:06,670 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:14:06,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:14:06 BoogieIcfgContainer [2019-12-27 00:14:06,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:14:06,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:14:06,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:14:06,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:14:06,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:14:04" (1/3) ... [2019-12-27 00:14:06,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795771ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:14:06, skipping insertion in model container [2019-12-27 00:14:06,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:05" (2/3) ... [2019-12-27 00:14:06,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795771ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:14:06, skipping insertion in model container [2019-12-27 00:14:06,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:14:06" (3/3) ... [2019-12-27 00:14:06,685 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2019-12-27 00:14:06,697 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:14:06,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:14:06,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:14:06,710 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:14:06,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,808 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,808 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:06,854 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:14:06,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:14:06,874 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:14:06,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:14:06,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:14:06,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:14:06,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:14:06,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:14:06,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:14:06,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 00:14:06,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:14:07,001 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:14:07,002 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:14:07,016 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:14:07,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:14:07,106 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:14:07,106 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:14:07,114 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:14:07,133 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 00:14:07,134 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:14:12,059 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-27 00:14:12,408 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:14:12,537 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:14:12,562 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-27 00:14:12,563 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 00:14:12,568 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 00:14:22,997 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-27 00:14:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-27 00:14:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:14:23,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:23,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:14:23,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-27 00:14:23,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:23,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911601077] [2019-12-27 00:14:23,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:23,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911601077] [2019-12-27 00:14:23,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:23,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:14:23,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792477799] [2019-12-27 00:14:23,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:23,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:23,246 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-27 00:14:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:25,666 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-27 00:14:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:25,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:14:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:26,355 INFO L225 Difference]: With dead ends: 82272 [2019-12-27 00:14:26,355 INFO L226 Difference]: Without dead ends: 77232 [2019-12-27 00:14:26,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-27 00:14:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-27 00:14:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-27 00:14:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-27 00:14:36,217 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-27 00:14:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:36,217 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-27 00:14:36,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-27 00:14:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:36,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:36,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:36,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-27 00:14:36,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:36,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592674754] [2019-12-27 00:14:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:36,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592674754] [2019-12-27 00:14:36,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:36,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:36,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113145814] [2019-12-27 00:14:36,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:36,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:36,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:36,392 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-27 00:14:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:37,263 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-27 00:14:37,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:37,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:14:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:41,557 INFO L225 Difference]: With dead ends: 119112 [2019-12-27 00:14:41,557 INFO L226 Difference]: Without dead ends: 119007 [2019-12-27 00:14:41,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-27 00:14:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-27 00:14:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-27 00:14:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-27 00:14:47,704 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-27 00:14:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:47,705 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-27 00:14:47,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-27 00:14:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:47,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:47,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:47,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-27 00:14:47,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:47,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372255202] [2019-12-27 00:14:47,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:47,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372255202] [2019-12-27 00:14:47,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:47,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:47,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503424695] [2019-12-27 00:14:47,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:47,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:47,768 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-27 00:14:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:47,903 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-27 00:14:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:47,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:14:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:47,960 INFO L225 Difference]: With dead ends: 27724 [2019-12-27 00:14:47,960 INFO L226 Difference]: Without dead ends: 27724 [2019-12-27 00:14:47,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-27 00:14:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-27 00:14:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-27 00:14:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-27 00:14:49,286 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-27 00:14:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:49,286 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-27 00:14:49,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-27 00:14:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:14:49,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:49,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:49,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-27 00:14:49,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:49,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939470550] [2019-12-27 00:14:49,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:49,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939470550] [2019-12-27 00:14:49,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:49,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:49,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235090707] [2019-12-27 00:14:49,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:14:49,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:14:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:49,404 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 5 states. [2019-12-27 00:14:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:49,897 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-27 00:14:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:14:49,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 00:14:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:50,012 INFO L225 Difference]: With dead ends: 40807 [2019-12-27 00:14:50,012 INFO L226 Difference]: Without dead ends: 40789 [2019-12-27 00:14:50,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:14:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-27 00:14:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-27 00:14:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-27 00:14:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-27 00:14:51,197 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-27 00:14:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:51,197 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-27 00:14:51,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:14:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-27 00:14:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:14:51,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:51,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] [2019-12-27 00:14:51,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-27 00:14:51,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:51,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235789458] [2019-12-27 00:14:51,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:51,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235789458] [2019-12-27 00:14:51,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:51,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:14:51,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813621737] [2019-12-27 00:14:51,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:51,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:51,359 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 6 states. [2019-12-27 00:14:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:52,097 INFO L93 Difference]: Finished difference Result 51183 states and 167445 transitions. [2019-12-27 00:14:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:14:52,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:14:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:52,225 INFO L225 Difference]: With dead ends: 51183 [2019-12-27 00:14:52,226 INFO L226 Difference]: Without dead ends: 51153 [2019-12-27 00:14:52,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:14:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51153 states. [2019-12-27 00:14:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51153 to 34768. [2019-12-27 00:14:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34768 states. [2019-12-27 00:14:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34768 states to 34768 states and 115556 transitions. [2019-12-27 00:14:52,931 INFO L78 Accepts]: Start accepts. Automaton has 34768 states and 115556 transitions. Word has length 22 [2019-12-27 00:14:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:52,932 INFO L462 AbstractCegarLoop]: Abstraction has 34768 states and 115556 transitions. [2019-12-27 00:14:52,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34768 states and 115556 transitions. [2019-12-27 00:14:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:14:52,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:52,942 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] [2019-12-27 00:14:52,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-27 00:14:52,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:52,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039274740] [2019-12-27 00:14:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:53,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039274740] [2019-12-27 00:14:53,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:53,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:14:53,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16243458] [2019-12-27 00:14:53,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:53,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:53,020 INFO L87 Difference]: Start difference. First operand 34768 states and 115556 transitions. Second operand 6 states. [2019-12-27 00:14:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:54,140 INFO L93 Difference]: Finished difference Result 51553 states and 167314 transitions. [2019-12-27 00:14:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:14:54,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:14:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:54,229 INFO L225 Difference]: With dead ends: 51553 [2019-12-27 00:14:54,230 INFO L226 Difference]: Without dead ends: 51523 [2019-12-27 00:14:54,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:14:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51523 states. [2019-12-27 00:14:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51523 to 36074. [2019-12-27 00:14:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36074 states. [2019-12-27 00:14:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36074 states to 36074 states and 118567 transitions. [2019-12-27 00:14:54,946 INFO L78 Accepts]: Start accepts. Automaton has 36074 states and 118567 transitions. Word has length 22 [2019-12-27 00:14:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:54,946 INFO L462 AbstractCegarLoop]: Abstraction has 36074 states and 118567 transitions. [2019-12-27 00:14:54,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 36074 states and 118567 transitions. [2019-12-27 00:14:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:14:54,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:54,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:54,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-27 00:14:54,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:54,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221614596] [2019-12-27 00:14:54,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:55,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221614596] [2019-12-27 00:14:55,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:55,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:55,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511012861] [2019-12-27 00:14:55,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:55,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:55,039 INFO L87 Difference]: Start difference. First operand 36074 states and 118567 transitions. Second operand 4 states. [2019-12-27 00:14:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:55,098 INFO L93 Difference]: Finished difference Result 14149 states and 43172 transitions. [2019-12-27 00:14:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:14:55,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 00:14:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:55,117 INFO L225 Difference]: With dead ends: 14149 [2019-12-27 00:14:55,117 INFO L226 Difference]: Without dead ends: 14149 [2019-12-27 00:14:55,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-27 00:14:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 13955. [2019-12-27 00:14:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13955 states. [2019-12-27 00:14:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 42611 transitions. [2019-12-27 00:14:55,319 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 42611 transitions. Word has length 25 [2019-12-27 00:14:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:55,319 INFO L462 AbstractCegarLoop]: Abstraction has 13955 states and 42611 transitions. [2019-12-27 00:14:55,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 42611 transitions. [2019-12-27 00:14:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 00:14:55,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:55,340 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] [2019-12-27 00:14:55,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-27 00:14:55,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:55,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686109722] [2019-12-27 00:14:55,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:55,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686109722] [2019-12-27 00:14:55,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:55,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:55,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267636340] [2019-12-27 00:14:55,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:55,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:55,411 INFO L87 Difference]: Start difference. First operand 13955 states and 42611 transitions. Second operand 3 states. [2019-12-27 00:14:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:55,671 INFO L93 Difference]: Finished difference Result 25821 states and 78709 transitions. [2019-12-27 00:14:55,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:55,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 00:14:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:55,692 INFO L225 Difference]: With dead ends: 25821 [2019-12-27 00:14:55,692 INFO L226 Difference]: Without dead ends: 14420 [2019-12-27 00:14:55,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14420 states. [2019-12-27 00:14:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14420 to 14287. [2019-12-27 00:14:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14287 states. [2019-12-27 00:14:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 42676 transitions. [2019-12-27 00:14:55,917 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 42676 transitions. Word has length 39 [2019-12-27 00:14:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:55,918 INFO L462 AbstractCegarLoop]: Abstraction has 14287 states and 42676 transitions. [2019-12-27 00:14:55,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 42676 transitions. [2019-12-27 00:14:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 00:14:55,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:55,941 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] [2019-12-27 00:14:55,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-27 00:14:55,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:55,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136557522] [2019-12-27 00:14:55,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:56,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136557522] [2019-12-27 00:14:56,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:56,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:14:56,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381217784] [2019-12-27 00:14:56,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:14:56,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:14:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:56,016 INFO L87 Difference]: Start difference. First operand 14287 states and 42676 transitions. Second operand 5 states. [2019-12-27 00:14:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:56,103 INFO L93 Difference]: Finished difference Result 12923 states and 39241 transitions. [2019-12-27 00:14:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:56,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 00:14:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:56,124 INFO L225 Difference]: With dead ends: 12923 [2019-12-27 00:14:56,124 INFO L226 Difference]: Without dead ends: 10951 [2019-12-27 00:14:56,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2019-12-27 00:14:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 10573. [2019-12-27 00:14:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10573 states. [2019-12-27 00:14:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 32791 transitions. [2019-12-27 00:14:56,414 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 32791 transitions. Word has length 40 [2019-12-27 00:14:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:56,414 INFO L462 AbstractCegarLoop]: Abstraction has 10573 states and 32791 transitions. [2019-12-27 00:14:56,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:14:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 32791 transitions. [2019-12-27 00:14:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:14:56,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:56,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:56,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 917917389, now seen corresponding path program 1 times [2019-12-27 00:14:56,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:56,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263706085] [2019-12-27 00:14:56,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:56,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263706085] [2019-12-27 00:14:56,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:56,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:56,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072481443] [2019-12-27 00:14:56,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:56,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:56,517 INFO L87 Difference]: Start difference. First operand 10573 states and 32791 transitions. Second operand 3 states. [2019-12-27 00:14:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:56,611 INFO L93 Difference]: Finished difference Result 14303 states and 43654 transitions. [2019-12-27 00:14:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:56,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:14:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:56,635 INFO L225 Difference]: With dead ends: 14303 [2019-12-27 00:14:56,635 INFO L226 Difference]: Without dead ends: 14303 [2019-12-27 00:14:56,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-27 00:14:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 11263. [2019-12-27 00:14:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11263 states. [2019-12-27 00:14:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 34861 transitions. [2019-12-27 00:14:56,825 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 34861 transitions. Word has length 54 [2019-12-27 00:14:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:56,826 INFO L462 AbstractCegarLoop]: Abstraction has 11263 states and 34861 transitions. [2019-12-27 00:14:56,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 34861 transitions. [2019-12-27 00:14:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:14:56,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:56,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:56,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-27 00:14:56,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:56,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116972900] [2019-12-27 00:14:56,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:56,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116972900] [2019-12-27 00:14:56,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:56,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:14:56,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170947640] [2019-12-27 00:14:56,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:56,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:56,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:56,938 INFO L87 Difference]: Start difference. First operand 11263 states and 34861 transitions. Second operand 6 states. [2019-12-27 00:14:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:57,302 INFO L93 Difference]: Finished difference Result 33207 states and 101689 transitions. [2019-12-27 00:14:57,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:14:57,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 00:14:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:57,336 INFO L225 Difference]: With dead ends: 33207 [2019-12-27 00:14:57,336 INFO L226 Difference]: Without dead ends: 23787 [2019-12-27 00:14:57,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:14:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23787 states. [2019-12-27 00:14:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23787 to 13957. [2019-12-27 00:14:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13957 states. [2019-12-27 00:14:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13957 states to 13957 states and 43447 transitions. [2019-12-27 00:14:57,626 INFO L78 Accepts]: Start accepts. Automaton has 13957 states and 43447 transitions. Word has length 54 [2019-12-27 00:14:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:57,626 INFO L462 AbstractCegarLoop]: Abstraction has 13957 states and 43447 transitions. [2019-12-27 00:14:57,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 13957 states and 43447 transitions. [2019-12-27 00:14:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:14:57,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:57,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:57,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-27 00:14:57,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993914893] [2019-12-27 00:14:57,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:57,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993914893] [2019-12-27 00:14:57,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:57,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:14:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766213078] [2019-12-27 00:14:57,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:14:57,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:14:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:14:57,734 INFO L87 Difference]: Start difference. First operand 13957 states and 43447 transitions. Second operand 7 states. [2019-12-27 00:14:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:58,302 INFO L93 Difference]: Finished difference Result 33199 states and 101841 transitions. [2019-12-27 00:14:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:14:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 00:14:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:58,340 INFO L225 Difference]: With dead ends: 33199 [2019-12-27 00:14:58,340 INFO L226 Difference]: Without dead ends: 25551 [2019-12-27 00:14:58,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:14:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25551 states. [2019-12-27 00:14:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25551 to 16624. [2019-12-27 00:14:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-12-27 00:14:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 51830 transitions. [2019-12-27 00:14:58,660 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 51830 transitions. Word has length 54 [2019-12-27 00:14:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:58,660 INFO L462 AbstractCegarLoop]: Abstraction has 16624 states and 51830 transitions. [2019-12-27 00:14:58,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:14:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 51830 transitions. [2019-12-27 00:14:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:14:58,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:58,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:58,679 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-27 00:14:58,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:58,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139084152] [2019-12-27 00:14:58,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:58,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139084152] [2019-12-27 00:14:58,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:58,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:14:58,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433020290] [2019-12-27 00:14:58,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:14:58,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:14:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:14:58,770 INFO L87 Difference]: Start difference. First operand 16624 states and 51830 transitions. Second operand 7 states. [2019-12-27 00:14:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:59,157 INFO L93 Difference]: Finished difference Result 29813 states and 90433 transitions. [2019-12-27 00:14:59,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:14:59,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 00:14:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:59,197 INFO L225 Difference]: With dead ends: 29813 [2019-12-27 00:14:59,197 INFO L226 Difference]: Without dead ends: 27722 [2019-12-27 00:14:59,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:14:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27722 states. [2019-12-27 00:14:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27722 to 16706. [2019-12-27 00:14:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-27 00:14:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 52124 transitions. [2019-12-27 00:14:59,525 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 52124 transitions. Word has length 54 [2019-12-27 00:14:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:59,525 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 52124 transitions. [2019-12-27 00:14:59,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:14:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 52124 transitions. [2019-12-27 00:14:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:14:59,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:59,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:59,549 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-27 00:14:59,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:59,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709544971] [2019-12-27 00:14:59,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:59,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709544971] [2019-12-27 00:14:59,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:59,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271008520] [2019-12-27 00:14:59,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:59,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:59,596 INFO L87 Difference]: Start difference. First operand 16706 states and 52124 transitions. Second operand 3 states. [2019-12-27 00:14:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:59,686 INFO L93 Difference]: Finished difference Result 18535 states and 56308 transitions. [2019-12-27 00:14:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:59,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:14:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:59,711 INFO L225 Difference]: With dead ends: 18535 [2019-12-27 00:14:59,711 INFO L226 Difference]: Without dead ends: 18535 [2019-12-27 00:14:59,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2019-12-27 00:14:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 15978. [2019-12-27 00:15:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15978 states. [2019-12-27 00:15:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15978 states to 15978 states and 49163 transitions. [2019-12-27 00:15:00,225 INFO L78 Accepts]: Start accepts. Automaton has 15978 states and 49163 transitions. Word has length 54 [2019-12-27 00:15:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:00,225 INFO L462 AbstractCegarLoop]: Abstraction has 15978 states and 49163 transitions. [2019-12-27 00:15:00,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15978 states and 49163 transitions. [2019-12-27 00:15:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:15:00,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:00,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:00,246 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-27 00:15:00,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:00,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756728688] [2019-12-27 00:15:00,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:15:00,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756728688] [2019-12-27 00:15:00,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:00,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:15:00,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713074307] [2019-12-27 00:15:00,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:15:00,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:15:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:15:00,327 INFO L87 Difference]: Start difference. First operand 15978 states and 49163 transitions. Second operand 7 states. [2019-12-27 00:15:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:00,714 INFO L93 Difference]: Finished difference Result 31956 states and 95510 transitions. [2019-12-27 00:15:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:15:00,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 00:15:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:00,753 INFO L225 Difference]: With dead ends: 31956 [2019-12-27 00:15:00,753 INFO L226 Difference]: Without dead ends: 26966 [2019-12-27 00:15:00,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:15:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26966 states. [2019-12-27 00:15:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26966 to 16134. [2019-12-27 00:15:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16134 states. [2019-12-27 00:15:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 49593 transitions. [2019-12-27 00:15:01,072 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 49593 transitions. Word has length 54 [2019-12-27 00:15:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:01,072 INFO L462 AbstractCegarLoop]: Abstraction has 16134 states and 49593 transitions. [2019-12-27 00:15:01,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:15:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 49593 transitions. [2019-12-27 00:15:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:15:01,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:01,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:01,089 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-27 00:15:01,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:01,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851248535] [2019-12-27 00:15:01,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:15:01,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851248535] [2019-12-27 00:15:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:01,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:01,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628297168] [2019-12-27 00:15:01,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:01,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:01,163 INFO L87 Difference]: Start difference. First operand 16134 states and 49593 transitions. Second operand 3 states. [2019-12-27 00:15:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:01,233 INFO L93 Difference]: Finished difference Result 12976 states and 38987 transitions. [2019-12-27 00:15:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:01,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:15:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:01,256 INFO L225 Difference]: With dead ends: 12976 [2019-12-27 00:15:01,256 INFO L226 Difference]: Without dead ends: 12976 [2019-12-27 00:15:01,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2019-12-27 00:15:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 12502. [2019-12-27 00:15:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12502 states. [2019-12-27 00:15:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12502 states to 12502 states and 37525 transitions. [2019-12-27 00:15:01,587 INFO L78 Accepts]: Start accepts. Automaton has 12502 states and 37525 transitions. Word has length 54 [2019-12-27 00:15:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:01,587 INFO L462 AbstractCegarLoop]: Abstraction has 12502 states and 37525 transitions. [2019-12-27 00:15:01,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 12502 states and 37525 transitions. [2019-12-27 00:15:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:15:01,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:01,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:01,612 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-27 00:15:01,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086226175] [2019-12-27 00:15:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:15:01,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086226175] [2019-12-27 00:15:01,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:01,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:01,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084872226] [2019-12-27 00:15:01,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:01,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:01,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:01,770 INFO L87 Difference]: Start difference. First operand 12502 states and 37525 transitions. Second operand 3 states. [2019-12-27 00:15:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:01,827 INFO L93 Difference]: Finished difference Result 12502 states and 37523 transitions. [2019-12-27 00:15:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:01,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:15:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:01,850 INFO L225 Difference]: With dead ends: 12502 [2019-12-27 00:15:01,850 INFO L226 Difference]: Without dead ends: 12502 [2019-12-27 00:15:01,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12502 states. [2019-12-27 00:15:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12502 to 10981. [2019-12-27 00:15:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-27 00:15:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 33292 transitions. [2019-12-27 00:15:02,065 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 33292 transitions. Word has length 55 [2019-12-27 00:15:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:02,066 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 33292 transitions. [2019-12-27 00:15:02,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 33292 transitions. [2019-12-27 00:15:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:15:02,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:02,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:02,079 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-27 00:15:02,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:02,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374921141] [2019-12-27 00:15:02,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:15:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:15:02,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:15:02,221 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:15:02,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= v_~main$tmp_guard0~0_19 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30| 1)) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30|) |v_ULTIMATE.start_main_~#t2525~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30|) 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2525~0.base_30| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2525~0.base_30|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 00:15:02,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 00:15:02,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 00:15:02,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-27 00:15:02,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1735640872 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1735640872 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1735640872 |P2Thread1of1ForFork1_#t~ite32_Out-1735640872|)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1735640872| ~x~0_In-1735640872) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1735640872, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1735640872, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1735640872, ~x~0=~x~0_In-1735640872} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1735640872|, ~x$w_buff1~0=~x$w_buff1~0_In-1735640872, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1735640872, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1735640872, ~x~0=~x~0_In-1735640872} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 00:15:02,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 00:15:02,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1168217309 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1168217309 256)))) (or (and (= ~x$w_buff0_used~0_In-1168217309 |P2Thread1of1ForFork1_#t~ite34_Out-1168217309|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1168217309|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1168217309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1168217309} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1168217309|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1168217309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1168217309} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 00:15:02,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1139348167 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1139348167 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1139348167 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1139348167 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1139348167|)) (and (= ~x$w_buff1_used~0_In-1139348167 |P2Thread1of1ForFork1_#t~ite35_Out-1139348167|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1139348167, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1139348167, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1139348167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1139348167} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1139348167|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1139348167, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1139348167, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1139348167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1139348167} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 00:15:02,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1232369033 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1232369033 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1232369033 |P2Thread1of1ForFork1_#t~ite36_Out-1232369033|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1232369033|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232369033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232369033} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1232369033|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232369033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232369033} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 00:15:02,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1307384214 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1307384214 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1307384214 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1307384214 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1307384214| ~x$r_buff1_thd3~0_In-1307384214) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1307384214|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1307384214, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1307384214, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1307384214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1307384214} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1307384214|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1307384214, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1307384214, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1307384214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1307384214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 00:15:02,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 00:15:02,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1319788782 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In-1319788782| |P0Thread1of1ForFork2_#t~ite11_Out-1319788782|) (= ~x$w_buff1~0_In-1319788782 |P0Thread1of1ForFork2_#t~ite12_Out-1319788782|) (not .cse0)) (and .cse0 (= ~x$w_buff1~0_In-1319788782 |P0Thread1of1ForFork2_#t~ite11_Out-1319788782|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1319788782| |P0Thread1of1ForFork2_#t~ite11_Out-1319788782|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1319788782 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1319788782 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1319788782 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1319788782 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1319788782, ~x$w_buff1~0=~x$w_buff1~0_In-1319788782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1319788782, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1319788782, ~weak$$choice2~0=~weak$$choice2~0_In-1319788782, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1319788782|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1319788782} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1319788782, ~x$w_buff1~0=~x$w_buff1~0_In-1319788782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1319788782, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1319788782, ~weak$$choice2~0=~weak$$choice2~0_In-1319788782, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1319788782|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1319788782|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1319788782} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 00:15:02,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-493369454 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-493369454 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-493369454 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-493369454 256))) (= 0 (mod ~x$w_buff0_used~0_In-493369454 256)))) (= |P0Thread1of1ForFork2_#t~ite14_Out-493369454| |P0Thread1of1ForFork2_#t~ite15_Out-493369454|) (= ~x$w_buff0_used~0_In-493369454 |P0Thread1of1ForFork2_#t~ite14_Out-493369454|)) (and (not .cse0) (= ~x$w_buff0_used~0_In-493369454 |P0Thread1of1ForFork2_#t~ite15_Out-493369454|) (= |P0Thread1of1ForFork2_#t~ite14_In-493369454| |P0Thread1of1ForFork2_#t~ite14_Out-493369454|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-493369454, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-493369454, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-493369454, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-493369454|, ~weak$$choice2~0=~weak$$choice2~0_In-493369454, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-493369454} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-493369454, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-493369454, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-493369454|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-493369454, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-493369454|, ~weak$$choice2~0=~weak$$choice2~0_In-493369454, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-493369454} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 00:15:02,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 00:15:02,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1220752883 256)))) (or (and (= ~x$r_buff1_thd1~0_In-1220752883 |P0Thread1of1ForFork2_#t~ite24_Out-1220752883|) (= |P0Thread1of1ForFork2_#t~ite23_In-1220752883| |P0Thread1of1ForFork2_#t~ite23_Out-1220752883|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1220752883 256)))) (or (= (mod ~x$w_buff0_used~0_In-1220752883 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1220752883 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1220752883 256) 0)))) (= ~x$r_buff1_thd1~0_In-1220752883 |P0Thread1of1ForFork2_#t~ite23_Out-1220752883|) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-1220752883| |P0Thread1of1ForFork2_#t~ite23_Out-1220752883|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1220752883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1220752883, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1220752883, ~weak$$choice2~0=~weak$$choice2~0_In-1220752883, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1220752883|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220752883} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1220752883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1220752883, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1220752883, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1220752883|, ~weak$$choice2~0=~weak$$choice2~0_In-1220752883, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1220752883|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220752883} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 00:15:02,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 00:15:02,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1599403301 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1599403301 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1599403301| ~x$w_buff0_used~0_In1599403301) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1599403301| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1599403301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1599403301} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1599403301, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1599403301|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1599403301} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 00:15:02,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1618376412 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1618376412 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1618376412 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1618376412 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1618376412| ~x$w_buff1_used~0_In-1618376412)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1618376412| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1618376412, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1618376412, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1618376412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1618376412} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1618376412, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1618376412, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1618376412, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1618376412|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1618376412} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 00:15:02,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1288697818 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1288697818 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1288697818)) (and (= ~x$r_buff0_thd2~0_In-1288697818 ~x$r_buff0_thd2~0_Out-1288697818) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1288697818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1288697818} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1288697818|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1288697818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1288697818} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 00:15:02,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1750782667 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1750782667 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1750782667 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1750782667 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1750782667| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1750782667| ~x$r_buff1_thd2~0_In-1750782667) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1750782667, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1750782667, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1750782667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1750782667} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1750782667|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1750782667, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1750782667, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1750782667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1750782667} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 00:15:02,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 00:15:02,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:15:02,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1165719563| |ULTIMATE.start_main_#t~ite42_Out1165719563|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1165719563 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1165719563 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1165719563| ~x~0_In1165719563) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= ~x$w_buff1~0_In1165719563 |ULTIMATE.start_main_#t~ite41_Out1165719563|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1165719563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1165719563, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1165719563, ~x~0=~x~0_In1165719563} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1165719563|, ~x$w_buff1~0=~x$w_buff1~0_In1165719563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1165719563, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1165719563, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1165719563|, ~x~0=~x~0_In1165719563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 00:15:02,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-796790298 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-796790298 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-796790298| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-796790298| ~x$w_buff0_used~0_In-796790298) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-796790298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-796790298} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-796790298, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-796790298|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-796790298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 00:15:02,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In719299698 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In719299698 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In719299698 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In719299698 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out719299698| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out719299698| ~x$w_buff1_used~0_In719299698) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In719299698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In719299698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In719299698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In719299698} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In719299698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In719299698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In719299698, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out719299698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In719299698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 00:15:02,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-79173401 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-79173401 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-79173401 |ULTIMATE.start_main_#t~ite45_Out-79173401|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-79173401|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-79173401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79173401} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-79173401, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-79173401|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79173401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 00:15:02,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1405987285 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1405987285 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1405987285 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1405987285 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1405987285| ~x$r_buff1_thd0~0_In-1405987285) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out-1405987285| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1405987285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1405987285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1405987285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405987285} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1405987285, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1405987285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1405987285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1405987285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405987285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 00:15:02,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:15:02,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:15:02 BasicIcfg [2019-12-27 00:15:02,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:15:02,332 INFO L168 Benchmark]: Toolchain (without parser) took 57444.29 ms. Allocated memory was 144.7 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.0 MB in the beginning and 685.0 MB in the end (delta: -584.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,332 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:15:02,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.22 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 152.9 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.60 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,335 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 147.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,335 INFO L168 Benchmark]: RCFGBuilder took 780.72 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,336 INFO L168 Benchmark]: TraceAbstraction took 55655.62 ms. Allocated memory was 201.3 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.4 MB in the beginning and 685.0 MB in the end (delta: -583.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 00:15:02,339 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.49 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 899.22 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 152.9 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.60 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.48 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 147.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.72 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55655.62 ms. Allocated memory was 201.3 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.4 MB in the beginning and 685.0 MB in the end (delta: -583.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3034 SDtfs, 2779 SDslu, 6644 SDs, 0 SdLazy, 2223 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 96978 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...