/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:01:03,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:01:03,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:01:03,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:01:03,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:01:03,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:01:03,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:01:03,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:01:03,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:01:03,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:01:03,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:01:03,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:01:03,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:01:03,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:01:03,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:01:03,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:01:03,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:01:03,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:01:03,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:01:03,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:01:03,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:01:03,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:01:03,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:01:03,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:01:03,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:01:03,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:01:03,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:01:03,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:01:03,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:01:03,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:01:03,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:01:03,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:01:03,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:01:03,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:01:03,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:01:03,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:01:03,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:01:03,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:01:03,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:01:03,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:01:03,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:01:03,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:01:03,910 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:01:03,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:01:03,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:01:03,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:01:03,912 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:01:03,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:01:03,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:01:03,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:01:03,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:01:03,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:01:03,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:01:03,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:01:03,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:01:03,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:01:03,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:01:03,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:01:03,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:01:03,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:01:03,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:01:03,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:01:03,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:01:03,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:01:03,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:01:03,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:01:04,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:01:04,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:01:04,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:01:04,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:01:04,229 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:01:04,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 03:01:04,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1271497f/8d1ae78cbb8a4e05bd0d5f620dec3fa9/FLAG6efe54fba [2019-12-27 03:01:04,845 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:01:04,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 03:01:04,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1271497f/8d1ae78cbb8a4e05bd0d5f620dec3fa9/FLAG6efe54fba [2019-12-27 03:01:05,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1271497f/8d1ae78cbb8a4e05bd0d5f620dec3fa9 [2019-12-27 03:01:05,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:01:05,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:01:05,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:01:05,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:01:05,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:01:05,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:05,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@966da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05, skipping insertion in model container [2019-12-27 03:01:05,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:05,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:01:05,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:01:05,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:01:05,789 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:01:05,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:01:05,951 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:01:05,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05 WrapperNode [2019-12-27 03:01:05,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:01:05,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:01:05,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:01:05,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:01:05,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:05,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:01:06,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:01:06,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:01:06,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:01:06,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... [2019-12-27 03:01:06,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:01:06,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:01:06,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:01:06,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:01:06,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:01:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:01:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:01:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:01:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:01:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:01:06,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:01:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:01:06,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:01:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:01:06,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:01:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:01:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:01:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:01:06,122 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 03:01:06,859 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:01:06,859 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:01:06,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:01:06 BoogieIcfgContainer [2019-12-27 03:01:06,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:01:06,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:01:06,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:01:06,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:01:06,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:01:05" (1/3) ... [2019-12-27 03:01:06,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c2a574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:01:06, skipping insertion in model container [2019-12-27 03:01:06,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:01:05" (2/3) ... [2019-12-27 03:01:06,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c2a574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:01:06, skipping insertion in model container [2019-12-27 03:01:06,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:01:06" (3/3) ... [2019-12-27 03:01:06,869 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2019-12-27 03:01:06,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:01:06,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:01:06,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:01:06,888 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:01:06,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,926 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,952 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:01:06,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:01:07,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:01:07,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:01:07,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:01:07,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:01:07,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:01:07,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:01:07,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:01:07,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:01:07,038 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 03:01:07,040 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:01:07,175 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:01:07,176 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:01:07,191 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:01:07,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:01:07,295 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:01:07,296 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:01:07,304 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:01:07,322 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 03:01:07,324 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:01:11,791 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:01:11,895 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:01:11,919 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 03:01:11,919 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:01:11,923 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:01:12,826 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 03:01:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 03:01:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 03:01:12,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:12,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:12,834 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 03:01:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:12,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3281188] [2019-12-27 03:01:12,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:13,141 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 03:01:13,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3281188] [2019-12-27 03:01:13,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:13,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:01:13,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737016620] [2019-12-27 03:01:13,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:13,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:13,170 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 03:01:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:13,611 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 03:01:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:13,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 03:01:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:13,820 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 03:01:13,820 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 03:01:13,822 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 03:01:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 03:01:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 03:01:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 03:01:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 03:01:14,680 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 03:01:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:14,681 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 03:01:14,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 03:01:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:01:14,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:14,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:14,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 03:01:14,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:14,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792784378] [2019-12-27 03:01:14,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:14,819 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 03:01:14,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792784378] [2019-12-27 03:01:14,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:14,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:14,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044494276] [2019-12-27 03:01:14,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:14,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:14,825 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-27 03:01:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:15,425 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 03:01:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:15,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:01:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:15,551 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 03:01:15,551 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 03:01:15,554 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 03:01:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 03:01:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 03:01:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 03:01:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 03:01:17,537 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 03:01:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:17,538 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 03:01:17,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 03:01:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:01:17,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:17,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:17,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 03:01:17,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:17,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785877018] [2019-12-27 03:01:17,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:17,591 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 03:01:17,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785877018] [2019-12-27 03:01:17,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:17,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:17,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461614028] [2019-12-27 03:01:17,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:17,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:17,594 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 03:01:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:17,671 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 03:01:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:17,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:01:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:17,705 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 03:01:17,705 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 03:01:17,705 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 03:01:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 03:01:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 03:01:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 03:01:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 03:01:18,047 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 03:01:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 03:01:18,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 03:01:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:01:18,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:18,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 03:01:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519626686] [2019-12-27 03:01:18,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,097 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 03:01:18,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519626686] [2019-12-27 03:01:18,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:18,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344597562] [2019-12-27 03:01:18,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:18,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:18,101 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 03:01:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:18,125 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 03:01:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:01:18,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:01:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:18,130 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 03:01:18,131 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 03:01:18,131 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 03:01:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 03:01:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 03:01:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 03:01:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 03:01:18,163 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 03:01:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,163 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 03:01:18,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 03:01:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:01:18,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,166 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] [2019-12-27 03:01:18,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 03:01:18,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883460383] [2019-12-27 03:01:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,278 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 03:01:18,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883460383] [2019-12-27 03:01:18,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:01:18,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537475814] [2019-12-27 03:01:18,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:18,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:18,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:18,280 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-27 03:01:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:18,309 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 03:01:18,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:18,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 03:01:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:18,312 INFO L225 Difference]: With dead ends: 653 [2019-12-27 03:01:18,312 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 03:01:18,312 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 03:01:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 03:01:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 03:01:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 03:01:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 03:01:18,323 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 03:01:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,323 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 03:01:18,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 03:01:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:01:18,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:18,326 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 03:01:18,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214067029] [2019-12-27 03:01:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,425 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 03:01:18,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214067029] [2019-12-27 03:01:18,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:18,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298739390] [2019-12-27 03:01:18,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:18,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:18,429 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 03:01:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:18,480 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 03:01:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:18,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:01:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:18,482 INFO L225 Difference]: With dead ends: 607 [2019-12-27 03:01:18,483 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 03:01:18,483 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 03:01:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 03:01:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 03:01:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 03:01:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 03:01:18,493 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 03:01:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,494 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 03:01:18,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 03:01:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:01:18,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:18,496 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 03:01:18,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080579520] [2019-12-27 03:01:18,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,788 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 03:01:18,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080579520] [2019-12-27 03:01:18,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:18,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647227193] [2019-12-27 03:01:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:18,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:18,793 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 3 states. [2019-12-27 03:01:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:18,809 INFO L93 Difference]: Finished difference Result 579 states and 1326 transitions. [2019-12-27 03:01:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:18,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:01:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:18,810 INFO L225 Difference]: With dead ends: 579 [2019-12-27 03:01:18,811 INFO L226 Difference]: Without dead ends: 579 [2019-12-27 03:01:18,811 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 03:01:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-27 03:01:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-12-27 03:01:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-27 03:01:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1326 transitions. [2019-12-27 03:01:18,821 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1326 transitions. Word has length 55 [2019-12-27 03:01:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,823 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1326 transitions. [2019-12-27 03:01:18,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1326 transitions. [2019-12-27 03:01:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:01:18,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:18,826 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -438818646, now seen corresponding path program 1 times [2019-12-27 03:01:18,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407524822] [2019-12-27 03:01:18,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,935 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 03:01:18,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407524822] [2019-12-27 03:01:18,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:18,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559521097] [2019-12-27 03:01:18,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:18,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:18,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:18,938 INFO L87 Difference]: Start difference. First operand 579 states and 1326 transitions. Second operand 5 states. [2019-12-27 03:01:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:19,130 INFO L93 Difference]: Finished difference Result 850 states and 1949 transitions. [2019-12-27 03:01:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:01:19,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 03:01:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:19,133 INFO L225 Difference]: With dead ends: 850 [2019-12-27 03:01:19,134 INFO L226 Difference]: Without dead ends: 850 [2019-12-27 03:01:19,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-12-27 03:01:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 663. [2019-12-27 03:01:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-27 03:01:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-27 03:01:19,145 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 56 [2019-12-27 03:01:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:19,146 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-27 03:01:19,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-27 03:01:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:01:19,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:19,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:19,148 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 2 times [2019-12-27 03:01:19,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:19,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366572051] [2019-12-27 03:01:19,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:19,254 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 03:01:19,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366572051] [2019-12-27 03:01:19,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:19,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:19,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019389411] [2019-12-27 03:01:19,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:19,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:19,257 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 3 states. [2019-12-27 03:01:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:19,295 INFO L93 Difference]: Finished difference Result 662 states and 1528 transitions. [2019-12-27 03:01:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:19,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 03:01:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:19,297 INFO L225 Difference]: With dead ends: 662 [2019-12-27 03:01:19,297 INFO L226 Difference]: Without dead ends: 662 [2019-12-27 03:01:19,297 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 03:01:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-27 03:01:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 473. [2019-12-27 03:01:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 03:01:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-27 03:01:19,306 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-27 03:01:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:19,306 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-27 03:01:19,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-27 03:01:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:19,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:19,308 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] [2019-12-27 03:01:19,308 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-27 03:01:19,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:19,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256149356] [2019-12-27 03:01:19,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:19,571 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 03:01:19,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256149356] [2019-12-27 03:01:19,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:19,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:01:19,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591132341] [2019-12-27 03:01:19,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:01:19,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:01:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:01:19,573 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 12 states. [2019-12-27 03:01:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:20,217 INFO L93 Difference]: Finished difference Result 1088 states and 2214 transitions. [2019-12-27 03:01:20,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:01:20,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 03:01:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:20,219 INFO L225 Difference]: With dead ends: 1088 [2019-12-27 03:01:20,219 INFO L226 Difference]: Without dead ends: 578 [2019-12-27 03:01:20,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:01:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-27 03:01:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-27 03:01:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 03:01:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 03:01:20,225 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-27 03:01:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:20,226 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 03:01:20,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:01:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 03:01:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:20,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:20,227 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] [2019-12-27 03:01:20,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-27 03:01:20,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:20,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738557606] [2019-12-27 03:01:20,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:20,347 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 03:01:20,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738557606] [2019-12-27 03:01:20,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:20,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:20,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910332998] [2019-12-27 03:01:20,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:01:20,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:01:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:20,351 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-27 03:01:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:20,420 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-27 03:01:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:01:20,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 03:01:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:20,422 INFO L225 Difference]: With dead ends: 644 [2019-12-27 03:01:20,422 INFO L226 Difference]: Without dead ends: 231 [2019-12-27 03:01:20,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-27 03:01:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-27 03:01:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 03:01:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 03:01:20,429 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 03:01:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:20,430 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 03:01:20,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:01:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 03:01:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:20,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:20,432 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] [2019-12-27 03:01:20,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-27 03:01:20,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:20,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294082403] [2019-12-27 03:01:20,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:21,050 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 03:01:21,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294082403] [2019-12-27 03:01:21,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:21,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 03:01:21,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411497023] [2019-12-27 03:01:21,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 03:01:21,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 03:01:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:01:21,052 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 18 states. [2019-12-27 03:01:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:22,340 INFO L93 Difference]: Finished difference Result 503 states and 870 transitions. [2019-12-27 03:01:22,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:01:22,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-27 03:01:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:22,341 INFO L225 Difference]: With dead ends: 503 [2019-12-27 03:01:22,342 INFO L226 Difference]: Without dead ends: 473 [2019-12-27 03:01:22,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 03:01:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-27 03:01:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 317. [2019-12-27 03:01:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 03:01:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-27 03:01:22,348 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 57 [2019-12-27 03:01:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:22,348 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-27 03:01:22,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 03:01:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-27 03:01:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:22,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:22,349 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] [2019-12-27 03:01:22,350 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -154882273, now seen corresponding path program 4 times [2019-12-27 03:01:22,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:22,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879638961] [2019-12-27 03:01:22,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:22,548 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 03:01:22,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879638961] [2019-12-27 03:01:22,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:22,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:01:22,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145220022] [2019-12-27 03:01:22,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:01:22,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:01:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:01:22,550 INFO L87 Difference]: Start difference. First operand 317 states and 554 transitions. Second operand 12 states. [2019-12-27 03:01:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:22,997 INFO L93 Difference]: Finished difference Result 505 states and 852 transitions. [2019-12-27 03:01:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:01:22,997 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 03:01:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:22,998 INFO L225 Difference]: With dead ends: 505 [2019-12-27 03:01:22,998 INFO L226 Difference]: Without dead ends: 475 [2019-12-27 03:01:22,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:01:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-27 03:01:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 313. [2019-12-27 03:01:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-12-27 03:01:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 546 transitions. [2019-12-27 03:01:23,005 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 546 transitions. Word has length 57 [2019-12-27 03:01:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:23,005 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 546 transitions. [2019-12-27 03:01:23,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:01:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 546 transitions. [2019-12-27 03:01:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:23,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:23,007 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] [2019-12-27 03:01:23,007 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash 618212177, now seen corresponding path program 5 times [2019-12-27 03:01:23,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:23,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640627725] [2019-12-27 03:01:23,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:23,676 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 03:01:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640627725] [2019-12-27 03:01:23,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:23,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 03:01:23,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085151569] [2019-12-27 03:01:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 03:01:23,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 03:01:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:01:23,678 INFO L87 Difference]: Start difference. First operand 313 states and 546 transitions. Second operand 19 states. [2019-12-27 03:01:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:25,712 INFO L93 Difference]: Finished difference Result 803 states and 1383 transitions. [2019-12-27 03:01:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 03:01:25,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-27 03:01:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:25,714 INFO L225 Difference]: With dead ends: 803 [2019-12-27 03:01:25,714 INFO L226 Difference]: Without dead ends: 773 [2019-12-27 03:01:25,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 03:01:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-12-27 03:01:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 329. [2019-12-27 03:01:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 03:01:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 577 transitions. [2019-12-27 03:01:25,722 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 577 transitions. Word has length 57 [2019-12-27 03:01:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 577 transitions. [2019-12-27 03:01:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 03:01:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 577 transitions. [2019-12-27 03:01:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:25,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:25,724 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] [2019-12-27 03:01:25,725 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1124170117, now seen corresponding path program 6 times [2019-12-27 03:01:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:25,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204797419] [2019-12-27 03:01:25,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:26,604 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 03:01:26,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204797419] [2019-12-27 03:01:26,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:26,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 03:01:26,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084828149] [2019-12-27 03:01:26,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 03:01:26,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 03:01:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:01:26,606 INFO L87 Difference]: Start difference. First operand 329 states and 577 transitions. Second operand 21 states. [2019-12-27 03:01:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:28,792 INFO L93 Difference]: Finished difference Result 763 states and 1322 transitions. [2019-12-27 03:01:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:01:28,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-12-27 03:01:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:28,794 INFO L225 Difference]: With dead ends: 763 [2019-12-27 03:01:28,794 INFO L226 Difference]: Without dead ends: 733 [2019-12-27 03:01:28,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 03:01:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-27 03:01:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 339. [2019-12-27 03:01:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-27 03:01:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 595 transitions. [2019-12-27 03:01:28,803 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 595 transitions. Word has length 57 [2019-12-27 03:01:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:28,803 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 595 transitions. [2019-12-27 03:01:28,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 03:01:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 595 transitions. [2019-12-27 03:01:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:28,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:28,805 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] [2019-12-27 03:01:28,805 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 7 times [2019-12-27 03:01:28,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:28,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506021356] [2019-12-27 03:01:28,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:01:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:01:28,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:01:28,911 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:01:28,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1507~0.base_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26|)) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26|) |v_ULTIMATE.start_main_~#t1507~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| 4)) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26| 1)) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= 0 |v_ULTIMATE.start_main_~#t1507~0.offset_19|) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_~#t1507~0.base=|v_ULTIMATE.start_main_~#t1507~0.base_26|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ULTIMATE.start_main_~#t1507~0.offset=|v_ULTIMATE.start_main_~#t1507~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_26|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_19|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1507~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1507~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1508~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1508~0.offset, ~y~0, ULTIMATE.start_main_~#t1509~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1509~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:01:28,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13|) |v_ULTIMATE.start_main_~#t1508~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1508~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1508~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1508~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1508~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 03:01:28,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12|) |v_ULTIMATE.start_main_~#t1509~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1509~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1509~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1509~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1509~0.offset, #length, ULTIMATE.start_main_~#t1509~0.base] because there is no mapped edge [2019-12-27 03:01:28,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:01:28,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 03:01:28,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-408714029 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-408714029 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-408714029 |P2Thread1of1ForFork0_#t~ite11_Out-408714029|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-408714029|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-408714029, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-408714029} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-408714029, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-408714029|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-408714029} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 03:01:28,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1023691210 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1023691210 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out1023691210| ~y$w_buff1~0_In1023691210) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out1023691210| ~y~0_In1023691210) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1023691210, ~y$w_buff1~0=~y$w_buff1~0_In1023691210, ~y~0=~y~0_In1023691210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023691210} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1023691210, ~y$w_buff1~0=~y$w_buff1~0_In1023691210, ~y~0=~y~0_In1023691210, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out1023691210|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023691210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:01:28,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:01:28,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1802582086 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1802582086 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1802582086| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1802582086| ~y$w_buff0_used~0_In-1802582086) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802582086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802582086} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802582086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802582086, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1802582086|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:01:28,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-484241441 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-484241441 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-484241441 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-484241441 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-484241441|)) (and (= ~y$w_buff1_used~0_In-484241441 |P1Thread1of1ForFork2_#t~ite6_Out-484241441|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-484241441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-484241441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-484241441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-484241441} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-484241441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-484241441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-484241441, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-484241441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-484241441} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:01:28,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1814008261 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1814008261 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1814008261| ~y$r_buff0_thd2~0_In1814008261)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1814008261| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1814008261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1814008261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1814008261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1814008261, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1814008261|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:01:28,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-176869881 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-176869881 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-176869881 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-176869881 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-176869881|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-176869881 |P2Thread1of1ForFork0_#t~ite12_Out-176869881|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-176869881, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-176869881, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-176869881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-176869881} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-176869881, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-176869881, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-176869881|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-176869881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-176869881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 03:01:28,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1111407344 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1111407344 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1111407344 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1111407344 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1111407344| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-1111407344| ~y$r_buff1_thd2~0_In-1111407344) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111407344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111407344, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111407344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111407344} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111407344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111407344, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1111407344|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111407344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111407344} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:01:28,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 03:01:28,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1964498474 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1964498474 256)))) (or (and (= ~y$r_buff0_thd3~0_In-1964498474 ~y$r_buff0_thd3~0_Out-1964498474) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-1964498474) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964498474, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1964498474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964498474, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1964498474, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1964498474|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 03:01:28,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1057689958 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1057689958 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1057689958 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1057689958 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1057689958| ~y$r_buff1_thd3~0_In1057689958)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1057689958| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1057689958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1057689958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1057689958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057689958} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1057689958|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1057689958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1057689958, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1057689958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057689958} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:01:28,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 03:01:28,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:01:28,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-134512153 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-134512153 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-134512153| ~y~0_In-134512153) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out-134512153| ~y$w_buff1~0_In-134512153) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-134512153, ~y~0=~y~0_In-134512153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-134512153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-134512153} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-134512153, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-134512153|, ~y~0=~y~0_In-134512153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-134512153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-134512153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:01:28,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 03:01:28,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2060491572 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2060491572 256)))) (or (and (= ~y$w_buff0_used~0_In2060491572 |ULTIMATE.start_main_#t~ite20_Out2060491572|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out2060491572|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2060491572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2060491572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2060491572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2060491572, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2060491572|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:01:28,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-852230220 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-852230220 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-852230220 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-852230220 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-852230220 |ULTIMATE.start_main_#t~ite21_Out-852230220|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-852230220|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-852230220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-852230220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-852230220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-852230220} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-852230220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-852230220, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-852230220|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-852230220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-852230220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:01:28,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1310119263 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1310119263 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1310119263| ~y$r_buff0_thd0~0_In1310119263)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1310119263| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1310119263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310119263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1310119263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1310119263, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1310119263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:01:28,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1741372427 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1741372427 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1741372427 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1741372427 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out1741372427| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1741372427 |ULTIMATE.start_main_#t~ite23_Out1741372427|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1741372427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1741372427, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1741372427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1741372427} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1741372427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1741372427, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1741372427, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1741372427|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1741372427} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:01:28,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2112585760 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_In2112585760| |ULTIMATE.start_main_#t~ite29_Out2112585760|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out2112585760| ~y$w_buff0~0_In2112585760)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2112585760 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In2112585760 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In2112585760 256)) (and (= (mod ~y$r_buff1_thd0~0_In2112585760 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite30_Out2112585760| |ULTIMATE.start_main_#t~ite29_Out2112585760|) (= ~y$w_buff0~0_In2112585760 |ULTIMATE.start_main_#t~ite29_Out2112585760|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2112585760, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In2112585760|, ~y$w_buff0~0=~y$w_buff0~0_In2112585760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2112585760, ~weak$$choice2~0=~weak$$choice2~0_In2112585760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2112585760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2112585760} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out2112585760|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2112585760, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2112585760|, ~y$w_buff0~0=~y$w_buff0~0_In2112585760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2112585760, ~weak$$choice2~0=~weak$$choice2~0_In2112585760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2112585760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2112585760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:01:28,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:01:28,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:01:28,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:01:29,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:01:29 BasicIcfg [2019-12-27 03:01:29,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:01:29,066 INFO L168 Benchmark]: Toolchain (without parser) took 23917.96 ms. Allocated memory was 138.4 MB in the beginning and 886.0 MB in the end (delta: 747.6 MB). Free memory was 102.0 MB in the beginning and 707.8 MB in the end (delta: -605.8 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,067 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 03:01:29,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.12 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,075 INFO L168 Benchmark]: Boogie Preprocessor took 38.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,079 INFO L168 Benchmark]: RCFGBuilder took 802.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.3 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,080 INFO L168 Benchmark]: TraceAbstraction took 22201.21 ms. Allocated memory was 202.9 MB in the beginning and 886.0 MB in the end (delta: 683.1 MB). Free memory was 104.7 MB in the beginning and 707.8 MB in the end (delta: -603.2 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:29,088 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 803.12 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.3 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22201.21 ms. Allocated memory was 202.9 MB in the beginning and 886.0 MB in the end (delta: 683.1 MB). Free memory was 104.7 MB in the beginning and 707.8 MB in the end (delta: -603.2 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1520 SDtfs, 2102 SDslu, 5410 SDs, 0 SdLazy, 4772 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4545 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 228112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...