/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:52:09,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:52:09,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:52:09,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:52:09,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:52:09,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:52:09,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:52:09,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:52:09,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:52:09,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:52:09,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:52:09,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:52:09,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:52:09,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:52:09,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:52:09,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:52:09,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:52:09,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:52:09,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:52:09,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:52:09,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:52:09,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:52:09,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:52:09,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:52:09,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:52:09,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:52:09,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:52:09,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:52:09,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:52:09,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:52:09,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:52:09,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:52:09,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:52:09,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:52:09,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:52:09,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:52:09,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:52:09,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:52:09,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:52:09,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:52:09,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:52:09,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:52:09,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:52:09,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:52:09,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:52:09,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:52:09,892 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:52:09,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:52:09,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:52:09,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:52:09,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:52:09,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:52:09,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:52:09,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:52:09,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:52:09,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:52:09,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:52:09,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:52:09,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:52:09,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:52:09,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:52:09,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:52:09,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:52:09,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:52:09,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:52:09,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:52:09,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:52:09,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:52:09,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:52:09,896 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:52:09,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:52:09,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:52:10,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:52:10,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:52:10,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:52:10,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:52:10,187 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:52:10,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-27 06:52:10,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c309c7dac/6a595d629b87458da000e8de40530ee6/FLAGb81f82b7b [2019-12-27 06:52:10,859 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:52:10,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-27 06:52:10,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c309c7dac/6a595d629b87458da000e8de40530ee6/FLAGb81f82b7b [2019-12-27 06:52:11,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c309c7dac/6a595d629b87458da000e8de40530ee6 [2019-12-27 06:52:11,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:52:11,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:52:11,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:52:11,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:52:11,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:52:11,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:11,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1361912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11, skipping insertion in model container [2019-12-27 06:52:11,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:11,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:52:11,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:52:11,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:52:11,725 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:52:11,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:52:11,904 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:52:11,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11 WrapperNode [2019-12-27 06:52:11,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:52:11,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:52:11,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:52:11,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:52:11,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:11,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:11,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:52:11,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:52:11,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:52:11,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:52:12,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (1/1) ... [2019-12-27 06:52:12,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:52:12,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:52:12,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:52:12,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:52:12,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (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 06:52:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:52:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:52:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:52:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:52:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:52:12,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:52:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:52:12,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:52:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:52:12,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:52:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:52:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:52:12,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:52:12,123 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 06:52:12,944 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:52:12,944 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:52:12,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:52:12 BoogieIcfgContainer [2019-12-27 06:52:12,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:52:12,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:52:12,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:52:12,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:52:12,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:52:11" (1/3) ... [2019-12-27 06:52:12,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f98455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:52:12, skipping insertion in model container [2019-12-27 06:52:12,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:52:11" (2/3) ... [2019-12-27 06:52:12,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f98455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:52:12, skipping insertion in model container [2019-12-27 06:52:12,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:52:12" (3/3) ... [2019-12-27 06:52:12,955 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2019-12-27 06:52:12,964 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:52:12,964 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:52:12,972 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:52:12,973 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:52:13,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,077 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:52:13,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:52:13,119 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:52:13,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:52:13,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:52:13,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:52:13,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:52:13,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:52:13,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:52:13,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:52:13,137 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 06:52:13,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:52:13,241 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:52:13,242 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:52:13,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:52:13,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:52:13,340 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:52:13,340 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:52:13,348 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:52:13,368 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 06:52:13,370 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:52:16,763 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 06:52:16,907 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 06:52:17,044 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:52:17,184 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:52:17,216 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91912 [2019-12-27 06:52:17,216 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:52:17,220 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 101 transitions [2019-12-27 06:52:35,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115110 states. [2019-12-27 06:52:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 115110 states. [2019-12-27 06:52:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:52:35,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:35,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:52:35,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash 815308427, now seen corresponding path program 1 times [2019-12-27 06:52:35,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:35,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849975497] [2019-12-27 06:52:35,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:35,959 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 06:52:35,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849975497] [2019-12-27 06:52:35,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:52:35,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122225159] [2019-12-27 06:52:35,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:52:35,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:52:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:35,990 INFO L87 Difference]: Start difference. First operand 115110 states. Second operand 3 states. [2019-12-27 06:52:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:39,748 INFO L93 Difference]: Finished difference Result 114720 states and 487546 transitions. [2019-12-27 06:52:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:52:39,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:52:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:40,431 INFO L225 Difference]: With dead ends: 114720 [2019-12-27 06:52:40,431 INFO L226 Difference]: Without dead ends: 112172 [2019-12-27 06:52:40,433 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 06:52:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112172 states. [2019-12-27 06:52:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112172 to 112172. [2019-12-27 06:52:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112172 states. [2019-12-27 06:52:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112172 states to 112172 states and 477158 transitions. [2019-12-27 06:52:47,350 INFO L78 Accepts]: Start accepts. Automaton has 112172 states and 477158 transitions. Word has length 5 [2019-12-27 06:52:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:47,351 INFO L462 AbstractCegarLoop]: Abstraction has 112172 states and 477158 transitions. [2019-12-27 06:52:47,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:52:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 112172 states and 477158 transitions. [2019-12-27 06:52:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:52:47,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:47,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:47,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1970067083, now seen corresponding path program 1 times [2019-12-27 06:52:47,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:47,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427310336] [2019-12-27 06:52:47,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:47,436 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 06:52:47,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427310336] [2019-12-27 06:52:47,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:52:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072166600] [2019-12-27 06:52:47,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:47,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:47,440 INFO L87 Difference]: Start difference. First operand 112172 states and 477158 transitions. Second operand 4 states. [2019-12-27 06:52:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:52,382 INFO L93 Difference]: Finished difference Result 175422 states and 718454 transitions. [2019-12-27 06:52:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:52:52,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:52:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:53,123 INFO L225 Difference]: With dead ends: 175422 [2019-12-27 06:52:53,123 INFO L226 Difference]: Without dead ends: 175373 [2019-12-27 06:52:53,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175373 states. [2019-12-27 06:53:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175373 to 159145. [2019-12-27 06:53:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159145 states. [2019-12-27 06:53:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159145 states to 159145 states and 659586 transitions. [2019-12-27 06:53:06,792 INFO L78 Accepts]: Start accepts. Automaton has 159145 states and 659586 transitions. Word has length 11 [2019-12-27 06:53:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:06,792 INFO L462 AbstractCegarLoop]: Abstraction has 159145 states and 659586 transitions. [2019-12-27 06:53:06,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:53:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 159145 states and 659586 transitions. [2019-12-27 06:53:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:53:06,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:06,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:06,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash -590582251, now seen corresponding path program 1 times [2019-12-27 06:53:06,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:06,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560182070] [2019-12-27 06:53:06,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:06,889 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 06:53:06,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560182070] [2019-12-27 06:53:06,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:06,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:06,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843585214] [2019-12-27 06:53:06,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:53:06,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:53:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:53:06,892 INFO L87 Difference]: Start difference. First operand 159145 states and 659586 transitions. Second operand 4 states. [2019-12-27 06:53:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:15,317 INFO L93 Difference]: Finished difference Result 228110 states and 923913 transitions. [2019-12-27 06:53:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:53:15,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:53:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:16,057 INFO L225 Difference]: With dead ends: 228110 [2019-12-27 06:53:16,057 INFO L226 Difference]: Without dead ends: 228047 [2019-12-27 06:53:16,057 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 06:53:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228047 states. [2019-12-27 06:53:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228047 to 192443. [2019-12-27 06:53:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192443 states. [2019-12-27 06:53:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192443 states to 192443 states and 792052 transitions. [2019-12-27 06:53:26,202 INFO L78 Accepts]: Start accepts. Automaton has 192443 states and 792052 transitions. Word has length 13 [2019-12-27 06:53:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:26,204 INFO L462 AbstractCegarLoop]: Abstraction has 192443 states and 792052 transitions. [2019-12-27 06:53:26,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:53:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 192443 states and 792052 transitions. [2019-12-27 06:53:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:53:26,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:26,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:26,208 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 339341104, now seen corresponding path program 1 times [2019-12-27 06:53:26,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:26,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530298427] [2019-12-27 06:53:26,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:26,261 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 06:53:26,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530298427] [2019-12-27 06:53:26,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:26,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:26,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236351719] [2019-12-27 06:53:26,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:26,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:26,266 INFO L87 Difference]: Start difference. First operand 192443 states and 792052 transitions. Second operand 3 states. [2019-12-27 06:53:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:26,408 INFO L93 Difference]: Finished difference Result 37880 states and 121975 transitions. [2019-12-27 06:53:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:26,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:53:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:26,465 INFO L225 Difference]: With dead ends: 37880 [2019-12-27 06:53:26,465 INFO L226 Difference]: Without dead ends: 37880 [2019-12-27 06:53:26,466 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 06:53:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37880 states. [2019-12-27 06:53:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37880 to 37880. [2019-12-27 06:53:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37880 states. [2019-12-27 06:53:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37880 states to 37880 states and 121975 transitions. [2019-12-27 06:53:27,093 INFO L78 Accepts]: Start accepts. Automaton has 37880 states and 121975 transitions. Word has length 13 [2019-12-27 06:53:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:27,093 INFO L462 AbstractCegarLoop]: Abstraction has 37880 states and 121975 transitions. [2019-12-27 06:53:27,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 37880 states and 121975 transitions. [2019-12-27 06:53:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:53:27,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:27,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:27,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1793457831, now seen corresponding path program 1 times [2019-12-27 06:53:27,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:27,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146425699] [2019-12-27 06:53:27,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:27,201 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 06:53:27,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146425699] [2019-12-27 06:53:27,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:27,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:53:27,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168114298] [2019-12-27 06:53:27,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:53:27,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:53:27,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:27,205 INFO L87 Difference]: Start difference. First operand 37880 states and 121975 transitions. Second operand 5 states. [2019-12-27 06:53:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:28,461 INFO L93 Difference]: Finished difference Result 51102 states and 161291 transitions. [2019-12-27 06:53:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:53:28,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:53:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:28,539 INFO L225 Difference]: With dead ends: 51102 [2019-12-27 06:53:28,539 INFO L226 Difference]: Without dead ends: 51089 [2019-12-27 06:53:28,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:53:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51089 states. [2019-12-27 06:53:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51089 to 38340. [2019-12-27 06:53:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-27 06:53:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 123285 transitions. [2019-12-27 06:53:29,254 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 123285 transitions. Word has length 19 [2019-12-27 06:53:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:29,254 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 123285 transitions. [2019-12-27 06:53:29,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:53:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 123285 transitions. [2019-12-27 06:53:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:53:29,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:29,269 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 06:53:29,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1227724886, now seen corresponding path program 1 times [2019-12-27 06:53:29,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:29,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23975424] [2019-12-27 06:53:29,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:29,332 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 06:53:29,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23975424] [2019-12-27 06:53:29,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:29,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:53:29,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604903387] [2019-12-27 06:53:29,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:53:29,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:53:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:53:29,335 INFO L87 Difference]: Start difference. First operand 38340 states and 123285 transitions. Second operand 4 states. [2019-12-27 06:53:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:29,381 INFO L93 Difference]: Finished difference Result 7755 states and 21286 transitions. [2019-12-27 06:53:29,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:53:29,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:53:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:29,395 INFO L225 Difference]: With dead ends: 7755 [2019-12-27 06:53:29,395 INFO L226 Difference]: Without dead ends: 7755 [2019-12-27 06:53:29,396 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 06:53:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-27 06:53:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7615. [2019-12-27 06:53:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7615 states. [2019-12-27 06:53:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 20886 transitions. [2019-12-27 06:53:29,501 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 20886 transitions. Word has length 25 [2019-12-27 06:53:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:29,501 INFO L462 AbstractCegarLoop]: Abstraction has 7615 states and 20886 transitions. [2019-12-27 06:53:29,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:53:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 20886 transitions. [2019-12-27 06:53:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:53:29,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:29,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:29,514 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 287382448, now seen corresponding path program 1 times [2019-12-27 06:53:29,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:29,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062142322] [2019-12-27 06:53:29,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:29,613 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 06:53:29,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062142322] [2019-12-27 06:53:29,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:29,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:53:29,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886315812] [2019-12-27 06:53:29,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:53:29,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:53:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:29,615 INFO L87 Difference]: Start difference. First operand 7615 states and 20886 transitions. Second operand 5 states. [2019-12-27 06:53:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:29,657 INFO L93 Difference]: Finished difference Result 5711 states and 16438 transitions. [2019-12-27 06:53:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:53:29,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 06:53:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:29,665 INFO L225 Difference]: With dead ends: 5711 [2019-12-27 06:53:29,666 INFO L226 Difference]: Without dead ends: 5711 [2019-12-27 06:53:29,666 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 06:53:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-27 06:53:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5298. [2019-12-27 06:53:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5298 states. [2019-12-27 06:53:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 15321 transitions. [2019-12-27 06:53:29,744 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 15321 transitions. Word has length 37 [2019-12-27 06:53:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:29,745 INFO L462 AbstractCegarLoop]: Abstraction has 5298 states and 15321 transitions. [2019-12-27 06:53:29,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:53:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 15321 transitions. [2019-12-27 06:53:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:29,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:29,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:29,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2078347018, now seen corresponding path program 1 times [2019-12-27 06:53:29,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:29,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550368029] [2019-12-27 06:53:29,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:29,828 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 06:53:29,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550368029] [2019-12-27 06:53:29,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:29,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:53:29,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273327231] [2019-12-27 06:53:29,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:29,831 INFO L87 Difference]: Start difference. First operand 5298 states and 15321 transitions. Second operand 3 states. [2019-12-27 06:53:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:29,882 INFO L93 Difference]: Finished difference Result 5309 states and 15335 transitions. [2019-12-27 06:53:29,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:29,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:53:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:29,890 INFO L225 Difference]: With dead ends: 5309 [2019-12-27 06:53:29,891 INFO L226 Difference]: Without dead ends: 5309 [2019-12-27 06:53:29,891 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 06:53:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-27 06:53:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5303. [2019-12-27 06:53:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 06:53:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 06:53:29,961 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 65 [2019-12-27 06:53:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:29,961 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 06:53:29,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 06:53:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:29,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:29,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:29,968 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1997644654, now seen corresponding path program 1 times [2019-12-27 06:53:29,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:29,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815926301] [2019-12-27 06:53:29,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:30,074 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 06:53:30,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815926301] [2019-12-27 06:53:30,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:30,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:30,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391466037] [2019-12-27 06:53:30,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:30,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:30,077 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-27 06:53:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:30,107 INFO L93 Difference]: Finished difference Result 4991 states and 14192 transitions. [2019-12-27 06:53:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:30,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:53:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:30,115 INFO L225 Difference]: With dead ends: 4991 [2019-12-27 06:53:30,115 INFO L226 Difference]: Without dead ends: 4991 [2019-12-27 06:53:30,116 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 06:53:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-12-27 06:53:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4991. [2019-12-27 06:53:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4991 states. [2019-12-27 06:53:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 14192 transitions. [2019-12-27 06:53:30,225 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 14192 transitions. Word has length 65 [2019-12-27 06:53:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:30,226 INFO L462 AbstractCegarLoop]: Abstraction has 4991 states and 14192 transitions. [2019-12-27 06:53:30,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 14192 transitions. [2019-12-27 06:53:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:53:30,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:30,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:30,238 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2076772799, now seen corresponding path program 1 times [2019-12-27 06:53:30,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:30,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426430769] [2019-12-27 06:53:30,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:30,568 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-12-27 06:53:30,599 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 06:53:30,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426430769] [2019-12-27 06:53:30,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:53:30,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42288778] [2019-12-27 06:53:30,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:53:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:53:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:53:30,601 INFO L87 Difference]: Start difference. First operand 4991 states and 14192 transitions. Second operand 6 states. [2019-12-27 06:53:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:30,707 INFO L93 Difference]: Finished difference Result 8810 states and 25025 transitions. [2019-12-27 06:53:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:53:30,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 06:53:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:30,714 INFO L225 Difference]: With dead ends: 8810 [2019-12-27 06:53:30,715 INFO L226 Difference]: Without dead ends: 4151 [2019-12-27 06:53:30,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:53:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2019-12-27 06:53:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 4151. [2019-12-27 06:53:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4151 states. [2019-12-27 06:53:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4151 states to 4151 states and 11756 transitions. [2019-12-27 06:53:30,799 INFO L78 Accepts]: Start accepts. Automaton has 4151 states and 11756 transitions. Word has length 66 [2019-12-27 06:53:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:30,800 INFO L462 AbstractCegarLoop]: Abstraction has 4151 states and 11756 transitions. [2019-12-27 06:53:30,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:53:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4151 states and 11756 transitions. [2019-12-27 06:53:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:53:30,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:30,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:30,808 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash -901401815, now seen corresponding path program 2 times [2019-12-27 06:53:30,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:30,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515071298] [2019-12-27 06:53:30,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:30,967 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 06:53:30,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515071298] [2019-12-27 06:53:30,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:30,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:30,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085939003] [2019-12-27 06:53:30,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:30,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:30,970 INFO L87 Difference]: Start difference. First operand 4151 states and 11756 transitions. Second operand 3 states. [2019-12-27 06:53:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:31,023 INFO L93 Difference]: Finished difference Result 4151 states and 11755 transitions. [2019-12-27 06:53:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:31,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:53:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:31,029 INFO L225 Difference]: With dead ends: 4151 [2019-12-27 06:53:31,030 INFO L226 Difference]: Without dead ends: 4151 [2019-12-27 06:53:31,030 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 06:53:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2019-12-27 06:53:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 2877. [2019-12-27 06:53:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2019-12-27 06:53:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 8277 transitions. [2019-12-27 06:53:31,079 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 8277 transitions. Word has length 66 [2019-12-27 06:53:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:31,079 INFO L462 AbstractCegarLoop]: Abstraction has 2877 states and 8277 transitions. [2019-12-27 06:53:31,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 8277 transitions. [2019-12-27 06:53:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:31,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:31,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:31,084 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1052432089, now seen corresponding path program 1 times [2019-12-27 06:53:31,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:31,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126986988] [2019-12-27 06:53:31,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:31,175 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 06:53:31,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126986988] [2019-12-27 06:53:31,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:31,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:31,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239156398] [2019-12-27 06:53:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:31,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:31,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:31,177 INFO L87 Difference]: Start difference. First operand 2877 states and 8277 transitions. Second operand 3 states. [2019-12-27 06:53:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:31,198 INFO L93 Difference]: Finished difference Result 2692 states and 7554 transitions. [2019-12-27 06:53:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:31,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:53:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:31,202 INFO L225 Difference]: With dead ends: 2692 [2019-12-27 06:53:31,203 INFO L226 Difference]: Without dead ends: 2692 [2019-12-27 06:53:31,203 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 06:53:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2019-12-27 06:53:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2604. [2019-12-27 06:53:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2604 states. [2019-12-27 06:53:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 7309 transitions. [2019-12-27 06:53:31,257 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 7309 transitions. Word has length 67 [2019-12-27 06:53:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:31,257 INFO L462 AbstractCegarLoop]: Abstraction has 2604 states and 7309 transitions. [2019-12-27 06:53:31,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 7309 transitions. [2019-12-27 06:53:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:53:31,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:31,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:31,263 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:31,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:31,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1034762219, now seen corresponding path program 1 times [2019-12-27 06:53:31,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:31,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341927866] [2019-12-27 06:53:31,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:53:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:53:31,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:53:31,415 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:53:31,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24|) |v_ULTIMATE.start_main_~#t1403~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~x$r_buff0_thd0~0_84) (= 0 v_~x$w_buff1~0_25) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1403~0.base_24|) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~x$r_buff0_thd3~0_22) (= |v_#NULL.offset_3| 0) (= 0 v_~x$r_buff0_thd1~0_22) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0~0_26) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x~0_29 0) (= 0 v_~weak$$choice2~0_36) (= 0 v_~x$r_buff0_thd2~0_30) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$r_buff1_thd1~0_20 0) (= v_~x$mem_tmp~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24|) 0) (= v_~x$w_buff1_used~0_72 0) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z~0_9) (= 0 v_~x$w_buff0_used~0_118) (= v_~x$r_buff1_thd0~0_54 0) (= 0 |v_ULTIMATE.start_main_~#t1403~0.offset_18|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1403~0.base_24| 4) |v_#length_21|) (= v_~x$r_buff1_thd3~0_20 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~y~0_11 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_8|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_~#t1403~0.base=|v_ULTIMATE.start_main_~#t1403~0.base_24|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_12|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_29, ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_8|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_18|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_54, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1403~0.offset=|v_ULTIMATE.start_main_~#t1403~0.offset_18|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1403~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1405~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1404~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1405~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1403~0.offset, ULTIMATE.start_main_~#t1404~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:53:31,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1404~0.base_11| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1404~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1404~0.offset_9|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11|) |v_ULTIMATE.start_main_~#t1404~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1404~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1404~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1404~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:53:31,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1405~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1405~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1405~0.base_11| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11| 1)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1405~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11|) |v_ULTIMATE.start_main_~#t1405~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1405~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1405~0.base, #length] because there is no mapped edge [2019-12-27 06:53:31,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L4-->L764: Formula: (and (= ~x$r_buff0_thd1~0_In-1579486986 ~x$r_buff1_thd1~0_Out-1579486986) (= ~x$r_buff1_thd0~0_Out-1579486986 ~x$r_buff0_thd0~0_In-1579486986) (= ~x$r_buff1_thd3~0_Out-1579486986 ~x$r_buff0_thd3~0_In-1579486986) (= ~x$r_buff0_thd2~0_Out-1579486986 1) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1579486986 0)) (= ~__unbuffered_p1_EAX~0_Out-1579486986 ~y~0_In-1579486986) (= ~x$r_buff1_thd2~0_Out-1579486986 ~x$r_buff0_thd2~0_In-1579486986)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1579486986, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1579486986, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1579486986, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1579486986, ~y~0=~y~0_In-1579486986, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1579486986} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1579486986, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1579486986, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1579486986, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1579486986, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-1579486986, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1579486986, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1579486986, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1579486986, ~y~0=~y~0_In-1579486986, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1579486986, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1579486986} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:53:31,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-302890789 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-302890789 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-302890789| ~x$w_buff1~0_In-302890789)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-302890789| ~x~0_In-302890789)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-302890789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-302890789, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-302890789, ~x~0=~x~0_In-302890789} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-302890789|, ~x$w_buff1~0=~x$w_buff1~0_In-302890789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-302890789, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-302890789, ~x~0=~x~0_In-302890789} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 06:53:31,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_18) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 06:53:31,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2111006859 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-2111006859 256)))) (or (and (= ~x$w_buff0_used~0_In-2111006859 |P2Thread1of1ForFork2_#t~ite17_Out-2111006859|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-2111006859|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2111006859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111006859} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2111006859, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-2111006859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111006859} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 06:53:31,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In787294304 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In787294304 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In787294304 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In787294304 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out787294304| ~x$w_buff1_used~0_In787294304)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out787294304| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In787294304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In787294304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In787294304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In787294304} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In787294304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In787294304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In787294304, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out787294304|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In787294304} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 06:53:31,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-564109029 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-564109029 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-564109029| ~x$w_buff1~0_In-564109029) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-564109029| ~x~0_In-564109029)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-564109029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-564109029, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-564109029, ~x~0=~x~0_In-564109029} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-564109029|, ~x$w_buff1~0=~x$w_buff1~0_In-564109029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-564109029, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-564109029, ~x~0=~x~0_In-564109029} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 06:53:31,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_19 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 06:53:31,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-360751571 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-360751571 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-360751571 |P0Thread1of1ForFork0_#t~ite5_Out-360751571|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-360751571|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-360751571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-360751571} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-360751571|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-360751571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-360751571} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:53:31,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1766026316 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1766026316 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1766026316 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1766026316 256)))) (or (and (= ~x$w_buff1_used~0_In1766026316 |P0Thread1of1ForFork0_#t~ite6_Out1766026316|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1766026316|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1766026316, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766026316, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1766026316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766026316} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1766026316|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1766026316, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766026316, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1766026316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766026316} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:53:31,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In641533634 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In641533634 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out641533634|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In641533634 |P0Thread1of1ForFork0_#t~ite7_Out641533634|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In641533634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641533634} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In641533634, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out641533634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641533634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:53:31,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-676824180 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-676824180 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-676824180 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-676824180 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-676824180| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-676824180| ~x$r_buff1_thd1~0_In-676824180) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-676824180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-676824180, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-676824180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-676824180} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-676824180, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-676824180|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-676824180, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-676824180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-676824180} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:53:31,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:53:31,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1332143443 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1332143443 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1332143443| ~x$w_buff0_used~0_In-1332143443)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1332143443| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1332143443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1332143443} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1332143443|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1332143443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1332143443} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:53:31,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-923169795 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-923169795 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-923169795 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-923169795 256) 0))) (or (and (= ~x$w_buff1_used~0_In-923169795 |P1Thread1of1ForFork1_#t~ite12_Out-923169795|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-923169795|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-923169795, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-923169795, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-923169795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-923169795} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-923169795, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-923169795, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-923169795|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-923169795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-923169795} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:53:31,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2025000214 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2025000214 256)))) (or (and (= ~x$r_buff0_thd2~0_In2025000214 ~x$r_buff0_thd2~0_Out2025000214) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out2025000214) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2025000214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2025000214} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2025000214|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2025000214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2025000214} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:53:31,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1690685084 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1690685084 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1690685084 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1690685084 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1690685084|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-1690685084 |P1Thread1of1ForFork1_#t~ite14_Out-1690685084|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690685084, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690685084, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1690685084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690685084} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690685084, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1690685084, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1690685084, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1690685084|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690685084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:53:31,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:53:31,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1440584175 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1440584175 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1440584175| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-1440584175 |P2Thread1of1ForFork2_#t~ite19_Out-1440584175|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1440584175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440584175} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1440584175, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1440584175|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440584175} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 06:53:31,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In611459064 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In611459064 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In611459064 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In611459064 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out611459064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out611459064| ~x$r_buff1_thd3~0_In611459064) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In611459064, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In611459064, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In611459064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In611459064} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out611459064|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In611459064, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In611459064, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In611459064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In611459064} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 06:53:31,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:53:31,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:53:31,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-654151359| |ULTIMATE.start_main_#t~ite25_Out-654151359|)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-654151359 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-654151359 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-654151359 |ULTIMATE.start_main_#t~ite24_Out-654151359|) .cse2) (and (= |ULTIMATE.start_main_#t~ite24_Out-654151359| ~x$w_buff1~0_In-654151359) .cse2 (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-654151359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-654151359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-654151359, ~x~0=~x~0_In-654151359} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-654151359, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-654151359|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-654151359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-654151359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-654151359, ~x~0=~x~0_In-654151359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 06:53:31,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1879114152 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1879114152 256)))) (or (and (= ~x$w_buff0_used~0_In1879114152 |ULTIMATE.start_main_#t~ite26_Out1879114152|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1879114152|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1879114152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1879114152} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1879114152, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1879114152|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1879114152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 06:53:31,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-520261980 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-520261980 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-520261980 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-520261980 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-520261980 |ULTIMATE.start_main_#t~ite27_Out-520261980|)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-520261980|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-520261980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520261980, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-520261980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520261980} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-520261980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520261980, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-520261980|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-520261980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520261980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 06:53:31,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-68250517 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-68250517 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-68250517 |ULTIMATE.start_main_#t~ite28_Out-68250517|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-68250517| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-68250517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68250517} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-68250517, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-68250517|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68250517} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 06:53:31,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1869279386 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1869279386 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1869279386 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1869279386 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1869279386| ~x$r_buff1_thd0~0_In-1869279386)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1869279386|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1869279386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1869279386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1869279386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1869279386} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1869279386, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1869279386|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1869279386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1869279386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1869279386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:53:31,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L832-->L832-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite45_Out1996799964| |ULTIMATE.start_main_#t~ite44_Out1996799964|)) (.cse4 (= 0 (mod ~x$w_buff1_used~0_In1996799964 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In1996799964 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1996799964 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1996799964 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In1996799964 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1996799964| |ULTIMATE.start_main_#t~ite44_Out1996799964|) (not .cse3) (or (not .cse4) .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1996799964| 0) .cse5)) (and (= |ULTIMATE.start_main_#t~ite43_In1996799964| |ULTIMATE.start_main_#t~ite43_Out1996799964|) (or (and (not .cse5) (= |ULTIMATE.start_main_#t~ite45_Out1996799964| ~x$w_buff1_used~0_In1996799964) (= |ULTIMATE.start_main_#t~ite44_In1996799964| |ULTIMATE.start_main_#t~ite44_Out1996799964|)) (and .cse0 (or (and .cse4 .cse6) (and .cse6 .cse1) .cse3) (= ~x$w_buff1_used~0_In1996799964 |ULTIMATE.start_main_#t~ite44_Out1996799964|) .cse5))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1996799964, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1996799964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1996799964, ~weak$$choice2~0=~weak$$choice2~0_In1996799964, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In1996799964|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1996799964, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1996799964|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1996799964, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1996799964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1996799964, ~weak$$choice2~0=~weak$$choice2~0_In1996799964, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1996799964|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1996799964|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1996799964|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1996799964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:53:31,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L833-->L834: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:53:31,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L834-->L834-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite51_Out151105397| |ULTIMATE.start_main_#t~ite50_Out151105397|)) (.cse2 (= (mod ~weak$$choice2~0_In151105397 256) 0)) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In151105397 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In151105397 256))) (.cse4 (= (mod ~x$r_buff1_thd0~0_In151105397 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In151105397 256)))) (or (let ((.cse3 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite49_Out151105397| |ULTIMATE.start_main_#t~ite50_Out151105397|) .cse0 (not .cse1) .cse2 (or .cse3 (not .cse4)) (or .cse3 (not .cse5)) (= |ULTIMATE.start_main_#t~ite49_Out151105397| 0))) (and (or (and (not .cse2) (= |ULTIMATE.start_main_#t~ite50_In151105397| |ULTIMATE.start_main_#t~ite50_Out151105397|) (= ~x$r_buff1_thd0~0_In151105397 |ULTIMATE.start_main_#t~ite51_Out151105397|)) (and .cse0 .cse2 (or (and .cse6 .cse5) (and .cse6 .cse4) .cse1) (= ~x$r_buff1_thd0~0_In151105397 |ULTIMATE.start_main_#t~ite50_Out151105397|))) (= |ULTIMATE.start_main_#t~ite49_In151105397| |ULTIMATE.start_main_#t~ite49_Out151105397|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In151105397|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In151105397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In151105397, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_In151105397|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In151105397, ~weak$$choice2~0=~weak$$choice2~0_In151105397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In151105397} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out151105397|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In151105397, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out151105397|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In151105397, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out151105397|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In151105397, ~weak$$choice2~0=~weak$$choice2~0_In151105397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In151105397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:53:31,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L836-->L839-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_24) (= (mod v_~main$tmp_guard1~0_5 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:53:31,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:53:31,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:53:31 BasicIcfg [2019-12-27 06:53:31,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:53:31,561 INFO L168 Benchmark]: Toolchain (without parser) took 80446.13 ms. Allocated memory was 138.4 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,564 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 155.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.14 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,567 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,569 INFO L168 Benchmark]: RCFGBuilder took 915.77 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,576 INFO L168 Benchmark]: TraceAbstraction took 78611.54 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:53:31,583 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 155.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.14 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 915.77 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78611.54 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91912 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L809] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 3 y = 1 [L781] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 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 [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 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) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 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 [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1696 SDtfs, 1282 SDslu, 2098 SDs, 0 SdLazy, 935 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192443occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 66502 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 44703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...