/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:17:04,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:17:04,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:17:04,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:17:04,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:17:04,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:17:04,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:17:04,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:17:04,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:17:04,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:17:04,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:17:04,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:17:04,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:17:04,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:17:04,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:17:04,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:17:04,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:17:04,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:17:04,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:17:04,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:17:04,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:17:04,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:17:04,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:17:04,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:17:04,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:17:04,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:17:04,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:17:04,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:17:04,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:17:04,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:17:04,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:17:04,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:17:04,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:17:04,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:17:04,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:17:04,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:17:04,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:17:04,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:17:04,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:17:04,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:17:04,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:17:04,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:17:04,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:17:04,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:17:04,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:17:04,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:17:04,948 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:17:04,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:17:04,949 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:17:04,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:17:04,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:17:04,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:17:04,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:17:04,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:17:04,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:17:04,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:17:04,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:17:04,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:17:04,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:17:04,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:17:04,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:17:04,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:17:04,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:17:04,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:17:04,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:17:04,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:17:04,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:17:04,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:17:04,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:17:04,953 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:17:04,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:17:04,953 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:17:04,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:17:05,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:17:05,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:17:05,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:17:05,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:17:05,232 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:17:05,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-27 18:17:05,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9938e4114/95d25561491f404ba9b43fa6b82a6207/FLAGaee134a2e [2019-12-27 18:17:05,879 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:17:05,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-27 18:17:05,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9938e4114/95d25561491f404ba9b43fa6b82a6207/FLAGaee134a2e [2019-12-27 18:17:06,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9938e4114/95d25561491f404ba9b43fa6b82a6207 [2019-12-27 18:17:06,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:17:06,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:17:06,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:17:06,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:17:06,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:17:06,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:06,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0780ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06, skipping insertion in model container [2019-12-27 18:17:06,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:06,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:17:06,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:17:06,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:17:06,801 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:17:06,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:17:06,983 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:17:06,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06 WrapperNode [2019-12-27 18:17:06,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:17:06,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:17:06,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:17:06,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:17:06,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:17:07,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:17:07,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:17:07,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:17:07,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... [2019-12-27 18:17:07,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:17:07,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:17:07,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:17:07,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:17:07,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:17:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:17:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:17:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:17:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:17:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:17:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:17:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:17:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:17:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:17:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:17:07,151 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:17:07,847 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:17:07,848 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:17:07,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:17:07 BoogieIcfgContainer [2019-12-27 18:17:07,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:17:07,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:17:07,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:17:07,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:17:07,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:17:06" (1/3) ... [2019-12-27 18:17:07,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:17:07, skipping insertion in model container [2019-12-27 18:17:07,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:06" (2/3) ... [2019-12-27 18:17:07,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:17:07, skipping insertion in model container [2019-12-27 18:17:07,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:17:07" (3/3) ... [2019-12-27 18:17:07,858 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i [2019-12-27 18:17:07,868 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:17:07,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:17:07,878 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:17:07,879 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:17:07,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,981 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,989 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:07,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:17:08,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:17:08,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:17:08,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:17:08,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:17:08,041 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:17:08,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:17:08,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:17:08,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:17:08,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:17:08,064 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:17:08,066 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:17:08,161 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:17:08,161 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:17:08,176 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:17:08,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:17:08,248 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:17:08,248 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:17:08,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:17:08,274 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:17:08,275 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:17:13,827 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:17:13,943 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:17:14,039 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 18:17:14,040 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:17:14,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:17:25,744 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:17:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:17:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:17:25,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:25,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:17:25,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 18:17:25,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:25,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998291273] [2019-12-27 18:17:25,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:26,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998291273] [2019-12-27 18:17:26,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:26,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:17:26,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [989190520] [2019-12-27 18:17:26,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:26,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:26,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:17:26,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:26,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:17:26,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:17:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:26,125 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:17:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:27,054 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:17:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:27,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:17:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:30,293 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:17:30,293 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:17:30,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:17:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:17:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:17:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:17:38,809 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:17:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:38,809 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:17:38,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:17:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:17:38,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:38,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:38,818 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 18:17:38,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:38,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146922199] [2019-12-27 18:17:38,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:38,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146922199] [2019-12-27 18:17:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:38,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:38,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431374274] [2019-12-27 18:17:38,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:38,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:38,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:17:38,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:38,981 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:38,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:17:38,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:17:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:17:38,983 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:17:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:39,899 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:17:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:39,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:17:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:44,379 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:17:44,380 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:17:44,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:17:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:17:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:17:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:17:51,547 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:17:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:51,548 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:17:51,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:17:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:17:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:17:51,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:51,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:51,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 18:17:51,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:51,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913493636] [2019-12-27 18:17:51,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:51,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913493636] [2019-12-27 18:17:51,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:51,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:51,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227859868] [2019-12-27 18:17:51,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:51,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:51,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:17:51,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:51,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:51,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:17:51,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:17:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:17:51,645 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:17:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:57,675 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:17:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:57,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:17:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:58,204 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:17:58,204 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:17:58,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:18:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:18:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:18:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:18:05,959 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:18:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:05,960 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:18:05,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:18:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:18:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:18:05,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:05,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:05,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 18:18:05,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:05,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207573214] [2019-12-27 18:18:05,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:06,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207573214] [2019-12-27 18:18:06,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:06,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:18:06,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046475042] [2019-12-27 18:18:06,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:06,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:06,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:18:06,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:06,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:18:06,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:06,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:06,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:06,069 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:18:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:12,878 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:18:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:18:12,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:18:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:13,446 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:18:13,446 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:18:13,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:18:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:18:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:18:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:18:21,665 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:18:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:21,665 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:18:21,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:18:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:18:21,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:21,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:21,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 18:18:21,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:21,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771692270] [2019-12-27 18:18:21,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:21,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771692270] [2019-12-27 18:18:21,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:21,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:18:21,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752895712] [2019-12-27 18:18:21,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:21,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:21,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:18:21,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:21,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:21,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:21,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:21,795 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:18:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:24,129 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:18:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:24,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:18:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:24,651 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:18:24,651 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:18:24,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:18:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:18:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:18:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:18:40,283 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:18:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:40,283 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:18:40,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:18:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:18:40,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:40,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:40,288 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 18:18:40,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:40,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391045126] [2019-12-27 18:18:40,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:40,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391045126] [2019-12-27 18:18:40,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:40,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:18:40,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [477712758] [2019-12-27 18:18:40,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:40,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:40,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:18:40,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:40,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:40,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:40,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:40,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:40,415 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:18:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:47,927 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:18:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:47,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:18:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:48,545 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:18:48,545 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:18:48,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:18:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:18:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:18:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:18:56,498 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:18:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:56,498 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:18:56,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:18:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:18:56,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:56,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:56,517 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 18:18:56,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:56,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417932275] [2019-12-27 18:18:56,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:56,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417932275] [2019-12-27 18:18:56,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:56,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:18:56,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805348463] [2019-12-27 18:18:56,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:56,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:56,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:18:56,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:56,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:18:56,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:18:56,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:18:56,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:18:56,615 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:18:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:58,473 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:18:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:18:58,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:18:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:58,943 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:18:58,943 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:18:58,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:19:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:19:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:19:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:19:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:19:12,783 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:19:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:12,784 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:19:12,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:19:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:19:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:19:12,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:12,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:12,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:12,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 18:19:12,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:12,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919736921] [2019-12-27 18:19:12,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:12,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919736921] [2019-12-27 18:19:12,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:12,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:19:12,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180867005] [2019-12-27 18:19:12,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:12,857 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:12,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:19:12,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:12,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:19:12,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:19:12,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:19:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:12,878 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:19:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:20,057 INFO L93 Difference]: Finished difference Result 320677 states and 1339367 transitions. [2019-12-27 18:19:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:19:20,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:19:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:21,417 INFO L225 Difference]: With dead ends: 320677 [2019-12-27 18:19:21,417 INFO L226 Difference]: Without dead ends: 193709 [2019-12-27 18:19:21,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193709 states. [2019-12-27 18:19:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193709 to 128270. [2019-12-27 18:19:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 18:19:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 18:19:34,058 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 18:19:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:34,058 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 18:19:34,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:19:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 18:19:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:19:34,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:34,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:34,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 18:19:34,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:34,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269028810] [2019-12-27 18:19:34,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:34,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269028810] [2019-12-27 18:19:34,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:34,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:19:34,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994246968] [2019-12-27 18:19:34,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:34,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:34,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:19:34,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:34,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:19:34,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:19:34,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:19:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:34,185 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 5 states. [2019-12-27 18:19:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:34,529 INFO L93 Difference]: Finished difference Result 38627 states and 132853 transitions. [2019-12-27 18:19:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:19:34,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:19:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:34,585 INFO L225 Difference]: With dead ends: 38627 [2019-12-27 18:19:34,585 INFO L226 Difference]: Without dead ends: 30749 [2019-12-27 18:19:34,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30749 states. [2019-12-27 18:19:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30749 to 28545. [2019-12-27 18:19:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-27 18:19:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-27 18:19:36,053 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-27 18:19:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-27 18:19:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:19:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-27 18:19:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:19:36,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:36,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:36,059 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 18:19:36,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:36,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489589988] [2019-12-27 18:19:36,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:36,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489589988] [2019-12-27 18:19:36,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:36,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:19:36,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358617707] [2019-12-27 18:19:36,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:36,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:36,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:19:36,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:36,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:19:36,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:19:36,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:19:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:36,199 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 6 states. [2019-12-27 18:19:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:36,712 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-27 18:19:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:19:36,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:19:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:36,775 INFO L225 Difference]: With dead ends: 37265 [2019-12-27 18:19:36,775 INFO L226 Difference]: Without dead ends: 36963 [2019-12-27 18:19:36,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:19:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-27 18:19:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-27 18:19:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-27 18:19:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-27 18:19:37,354 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-27 18:19:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:37,355 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-27 18:19:37,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:19:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-27 18:19:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:19:37,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:37,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:37,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 18:19:37,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:37,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247812837] [2019-12-27 18:19:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:37,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247812837] [2019-12-27 18:19:37,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:37,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:19:37,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87069050] [2019-12-27 18:19:37,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:37,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:37,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:19:37,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:37,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:19:37,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:19:37,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:19:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:37,486 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 6 states. [2019-12-27 18:19:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:38,021 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-27 18:19:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:19:38,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:19:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:38,090 INFO L225 Difference]: With dead ends: 37362 [2019-12-27 18:19:38,090 INFO L226 Difference]: Without dead ends: 36942 [2019-12-27 18:19:38,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:19:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-27 18:19:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-27 18:19:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 18:19:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-27 18:19:40,652 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-27 18:19:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:40,652 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-27 18:19:40,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:19:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-27 18:19:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:19:40,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:40,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:40,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-27 18:19:40,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:40,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52459269] [2019-12-27 18:19:40,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52459269] [2019-12-27 18:19:40,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:40,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:19:40,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444062691] [2019-12-27 18:19:40,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:40,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:40,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:19:40,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:40,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:19:40,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:19:40,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:19:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:19:40,838 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 7 states. [2019-12-27 18:19:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:41,289 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-27 18:19:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:19:41,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 18:19:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:41,339 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 18:19:41,340 INFO L226 Difference]: Without dead ends: 28434 [2019-12-27 18:19:41,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:19:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-27 18:19:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-27 18:19:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-27 18:19:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-27 18:19:41,849 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-27 18:19:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:41,849 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-27 18:19:41,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:19:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-27 18:19:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:19:41,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:41,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:41,863 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 18:19:41,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:41,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998629839] [2019-12-27 18:19:41,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:41,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998629839] [2019-12-27 18:19:41,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:41,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:19:41,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059875284] [2019-12-27 18:19:41,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:41,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:41,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:19:41,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:41,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:19:41,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:19:41,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:19:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:41,999 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 6 states. [2019-12-27 18:19:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:42,756 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-27 18:19:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:19:42,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:19:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:42,819 INFO L225 Difference]: With dead ends: 37145 [2019-12-27 18:19:42,819 INFO L226 Difference]: Without dead ends: 36771 [2019-12-27 18:19:42,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:19:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-27 18:19:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-27 18:19:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-27 18:19:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-27 18:19:43,401 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-27 18:19:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:43,401 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-27 18:19:43,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:19:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-27 18:19:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:19:43,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:43,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:43,415 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 18:19:43,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:43,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98021765] [2019-12-27 18:19:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:43,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98021765] [2019-12-27 18:19:43,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:43,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:19:43,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903577404] [2019-12-27 18:19:43,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:43,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:43,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:19:43,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:43,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:19:43,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:19:43,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:19:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:43,511 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 5 states. [2019-12-27 18:19:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:43,708 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-27 18:19:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:19:43,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 18:19:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:43,773 INFO L225 Difference]: With dead ends: 38320 [2019-12-27 18:19:43,773 INFO L226 Difference]: Without dead ends: 38320 [2019-12-27 18:19:43,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-27 18:19:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-27 18:19:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-27 18:19:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-27 18:19:44,713 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-27 18:19:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:44,713 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-27 18:19:44,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:19:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-27 18:19:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:19:44,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:44,730 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] [2019-12-27 18:19:44,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 18:19:44,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:44,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400418890] [2019-12-27 18:19:44,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:44,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400418890] [2019-12-27 18:19:44,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:44,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:19:44,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216815155] [2019-12-27 18:19:44,815 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:44,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:44,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:19:44,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:44,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:19:44,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:19:44,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:19:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:44,867 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 6 states. [2019-12-27 18:19:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:44,987 INFO L93 Difference]: Finished difference Result 13943 states and 42204 transitions. [2019-12-27 18:19:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:19:44,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 18:19:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:45,019 INFO L225 Difference]: With dead ends: 13943 [2019-12-27 18:19:45,019 INFO L226 Difference]: Without dead ends: 11902 [2019-12-27 18:19:45,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:19:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-12-27 18:19:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 11659. [2019-12-27 18:19:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11659 states. [2019-12-27 18:19:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11659 states to 11659 states and 35037 transitions. [2019-12-27 18:19:45,370 INFO L78 Accepts]: Start accepts. Automaton has 11659 states and 35037 transitions. Word has length 29 [2019-12-27 18:19:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:45,370 INFO L462 AbstractCegarLoop]: Abstraction has 11659 states and 35037 transitions. [2019-12-27 18:19:45,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:19:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11659 states and 35037 transitions. [2019-12-27 18:19:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:19:45,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:45,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:45,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1034846780, now seen corresponding path program 1 times [2019-12-27 18:19:45,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:45,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261831828] [2019-12-27 18:19:45,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:45,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261831828] [2019-12-27 18:19:45,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:45,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:19:45,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482007898] [2019-12-27 18:19:45,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:45,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:45,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 18:19:45,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:45,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:19:45,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:19:45,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:45,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:19:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:19:45,571 INFO L87 Difference]: Start difference. First operand 11659 states and 35037 transitions. Second operand 4 states. [2019-12-27 18:19:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:45,930 INFO L93 Difference]: Finished difference Result 22769 states and 69062 transitions. [2019-12-27 18:19:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:19:45,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 18:19:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:45,958 INFO L225 Difference]: With dead ends: 22769 [2019-12-27 18:19:45,958 INFO L226 Difference]: Without dead ends: 10735 [2019-12-27 18:19:45,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 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 18:19:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2019-12-27 18:19:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 6687. [2019-12-27 18:19:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2019-12-27 18:19:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 20326 transitions. [2019-12-27 18:19:46,156 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 20326 transitions. Word has length 39 [2019-12-27 18:19:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:46,156 INFO L462 AbstractCegarLoop]: Abstraction has 6687 states and 20326 transitions. [2019-12-27 18:19:46,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:19:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 20326 transitions. [2019-12-27 18:19:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:19:46,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:46,166 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 18:19:46,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:46,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063357113] [2019-12-27 18:19:46,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:46,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063357113] [2019-12-27 18:19:46,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:46,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:19:46,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323239983] [2019-12-27 18:19:46,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:46,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:46,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 18:19:46,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:46,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:19:46,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:19:46,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:19:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:19:46,683 INFO L87 Difference]: Start difference. First operand 6687 states and 20326 transitions. Second operand 12 states. [2019-12-27 18:19:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:48,046 INFO L93 Difference]: Finished difference Result 11582 states and 34956 transitions. [2019-12-27 18:19:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:19:48,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 18:19:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:48,063 INFO L225 Difference]: With dead ends: 11582 [2019-12-27 18:19:48,064 INFO L226 Difference]: Without dead ends: 11363 [2019-12-27 18:19:48,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:19:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11363 states. [2019-12-27 18:19:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11363 to 6636. [2019-12-27 18:19:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6636 states. [2019-12-27 18:19:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6636 states to 6636 states and 20212 transitions. [2019-12-27 18:19:48,197 INFO L78 Accepts]: Start accepts. Automaton has 6636 states and 20212 transitions. Word has length 40 [2019-12-27 18:19:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:48,197 INFO L462 AbstractCegarLoop]: Abstraction has 6636 states and 20212 transitions. [2019-12-27 18:19:48,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:19:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6636 states and 20212 transitions. [2019-12-27 18:19:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:19:48,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:48,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:48,204 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2043115507, now seen corresponding path program 2 times [2019-12-27 18:19:48,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:48,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262111817] [2019-12-27 18:19:48,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:48,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262111817] [2019-12-27 18:19:48,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:48,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:19:48,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267119254] [2019-12-27 18:19:48,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:48,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:48,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 148 transitions. [2019-12-27 18:19:48,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:48,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:19:48,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:19:48,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:19:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:19:48,383 INFO L87 Difference]: Start difference. First operand 6636 states and 20212 transitions. Second operand 6 states. [2019-12-27 18:19:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:48,620 INFO L93 Difference]: Finished difference Result 6678 states and 20278 transitions. [2019-12-27 18:19:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:19:48,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:19:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:48,631 INFO L225 Difference]: With dead ends: 6678 [2019-12-27 18:19:48,631 INFO L226 Difference]: Without dead ends: 6586 [2019-12-27 18:19:48,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:19:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2019-12-27 18:19:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6586. [2019-12-27 18:19:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6586 states. [2019-12-27 18:19:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 20115 transitions. [2019-12-27 18:19:48,734 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 20115 transitions. Word has length 40 [2019-12-27 18:19:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:48,735 INFO L462 AbstractCegarLoop]: Abstraction has 6586 states and 20115 transitions. [2019-12-27 18:19:48,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:19:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 20115 transitions. [2019-12-27 18:19:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:19:48,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:48,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:48,742 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1230367192, now seen corresponding path program 1 times [2019-12-27 18:19:48,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:48,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835440539] [2019-12-27 18:19:48,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:48,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835440539] [2019-12-27 18:19:48,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:48,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:19:48,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446521812] [2019-12-27 18:19:48,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:48,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:48,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 207 transitions. [2019-12-27 18:19:48,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:48,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:19:48,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:19:48,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:19:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:48,902 INFO L87 Difference]: Start difference. First operand 6586 states and 20115 transitions. Second operand 5 states. [2019-12-27 18:19:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:49,429 INFO L93 Difference]: Finished difference Result 11735 states and 35030 transitions. [2019-12-27 18:19:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:19:49,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 18:19:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:49,446 INFO L225 Difference]: With dead ends: 11735 [2019-12-27 18:19:49,446 INFO L226 Difference]: Without dead ends: 11735 [2019-12-27 18:19:49,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 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 18:19:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2019-12-27 18:19:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 10843. [2019-12-27 18:19:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10843 states. [2019-12-27 18:19:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10843 states to 10843 states and 32569 transitions. [2019-12-27 18:19:49,611 INFO L78 Accepts]: Start accepts. Automaton has 10843 states and 32569 transitions. Word has length 40 [2019-12-27 18:19:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:49,611 INFO L462 AbstractCegarLoop]: Abstraction has 10843 states and 32569 transitions. [2019-12-27 18:19:49,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:19:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10843 states and 32569 transitions. [2019-12-27 18:19:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:19:49,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:49,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:19:49,622 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 2 times [2019-12-27 18:19:49,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:49,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443390203] [2019-12-27 18:19:49,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:49,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443390203] [2019-12-27 18:19:49,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:49,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:19:49,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823603462] [2019-12-27 18:19:49,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:49,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:49,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:19:49,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:49,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:19:49,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:19:49,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:19:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:19:49,740 INFO L87 Difference]: Start difference. First operand 10843 states and 32569 transitions. Second operand 4 states. [2019-12-27 18:19:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:50,019 INFO L93 Difference]: Finished difference Result 13037 states and 38281 transitions. [2019-12-27 18:19:50,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:19:50,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 18:19:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:50,043 INFO L225 Difference]: With dead ends: 13037 [2019-12-27 18:19:50,043 INFO L226 Difference]: Without dead ends: 13037 [2019-12-27 18:19:50,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:19:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13037 states. [2019-12-27 18:19:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13037 to 10087. [2019-12-27 18:19:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10087 states. [2019-12-27 18:19:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10087 states to 10087 states and 29689 transitions. [2019-12-27 18:19:50,305 INFO L78 Accepts]: Start accepts. Automaton has 10087 states and 29689 transitions. Word has length 40 [2019-12-27 18:19:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:50,305 INFO L462 AbstractCegarLoop]: Abstraction has 10087 states and 29689 transitions. [2019-12-27 18:19:50,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:19:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10087 states and 29689 transitions. [2019-12-27 18:19:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:19:50,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:50,318 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] [2019-12-27 18:19:50,318 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-27 18:19:50,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:50,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25504826] [2019-12-27 18:19:50,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:50,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25504826] [2019-12-27 18:19:50,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:50,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:19:50,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210301054] [2019-12-27 18:19:50,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:50,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:50,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 215 transitions. [2019-12-27 18:19:50,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:50,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:19:50,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:19:50,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:19:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:19:50,501 INFO L87 Difference]: Start difference. First operand 10087 states and 29689 transitions. Second operand 7 states. [2019-12-27 18:19:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:50,611 INFO L93 Difference]: Finished difference Result 9060 states and 27081 transitions. [2019-12-27 18:19:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:19:50,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:19:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:50,624 INFO L225 Difference]: With dead ends: 9060 [2019-12-27 18:19:50,624 INFO L226 Difference]: Without dead ends: 8588 [2019-12-27 18:19:50,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:19:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8588 states. [2019-12-27 18:19:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8588 to 8036. [2019-12-27 18:19:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8036 states. [2019-12-27 18:19:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 24576 transitions. [2019-12-27 18:19:50,748 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 24576 transitions. Word has length 41 [2019-12-27 18:19:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:50,748 INFO L462 AbstractCegarLoop]: Abstraction has 8036 states and 24576 transitions. [2019-12-27 18:19:50,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:19:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 24576 transitions. [2019-12-27 18:19:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:19:50,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:50,759 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 18:19:50,760 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2029475721, now seen corresponding path program 1 times [2019-12-27 18:19:50,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:50,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441610296] [2019-12-27 18:19:50,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:50,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441610296] [2019-12-27 18:19:50,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:50,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:19:50,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673317952] [2019-12-27 18:19:50,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:50,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:51,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 425 transitions. [2019-12-27 18:19:51,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:51,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:19:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:19:51,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:19:51,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:19:51,024 INFO L87 Difference]: Start difference. First operand 8036 states and 24576 transitions. Second operand 3 states. [2019-12-27 18:19:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:51,076 INFO L93 Difference]: Finished difference Result 8034 states and 24571 transitions. [2019-12-27 18:19:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:19:51,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:19:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:51,089 INFO L225 Difference]: With dead ends: 8034 [2019-12-27 18:19:51,089 INFO L226 Difference]: Without dead ends: 8034 [2019-12-27 18:19:51,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:19:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8034 states. [2019-12-27 18:19:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8034 to 7144. [2019-12-27 18:19:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7144 states. [2019-12-27 18:19:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 22071 transitions. [2019-12-27 18:19:51,208 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 22071 transitions. Word has length 55 [2019-12-27 18:19:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:51,209 INFO L462 AbstractCegarLoop]: Abstraction has 7144 states and 22071 transitions. [2019-12-27 18:19:51,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:19:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 22071 transitions. [2019-12-27 18:19:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:19:51,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:51,217 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 18:19:51,217 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-27 18:19:51,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:51,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205245965] [2019-12-27 18:19:51,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:19:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:19:51,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205245965] [2019-12-27 18:19:51,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:19:51,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:19:51,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978719176] [2019-12-27 18:19:51,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:19:51,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:19:51,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 426 transitions. [2019-12-27 18:19:51,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:19:51,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:19:51,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:19:51,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:19:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:19:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:19:51,792 INFO L87 Difference]: Start difference. First operand 7144 states and 22071 transitions. Second operand 11 states. [2019-12-27 18:19:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:19:52,867 INFO L93 Difference]: Finished difference Result 16493 states and 50019 transitions. [2019-12-27 18:19:52,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:19:52,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 18:19:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:19:52,885 INFO L225 Difference]: With dead ends: 16493 [2019-12-27 18:19:52,885 INFO L226 Difference]: Without dead ends: 9256 [2019-12-27 18:19:52,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:19:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9256 states. [2019-12-27 18:19:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9256 to 8252. [2019-12-27 18:19:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8252 states. [2019-12-27 18:19:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8252 states to 8252 states and 24782 transitions. [2019-12-27 18:19:53,019 INFO L78 Accepts]: Start accepts. Automaton has 8252 states and 24782 transitions. Word has length 56 [2019-12-27 18:19:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:19:53,019 INFO L462 AbstractCegarLoop]: Abstraction has 8252 states and 24782 transitions. [2019-12-27 18:19:53,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:19:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 8252 states and 24782 transitions. [2019-12-27 18:19:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:19:53,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:19:53,027 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 18:19:53,028 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:19:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:19:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 2 times [2019-12-27 18:19:53,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:19:53,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108051295] [2019-12-27 18:19:53,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:19:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:19:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:19:53,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:19:53,135 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:19:53,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2088~0.base_30|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30|) |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30|)) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2088~0.base=|v_ULTIMATE.start_main_~#t2088~0.base_30|, ULTIMATE.start_main_~#t2088~0.offset=|v_ULTIMATE.start_main_~#t2088~0.offset_22|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_31|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2090~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2088~0.base, ULTIMATE.start_main_~#t2088~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2090~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2089~0.offset, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2089~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:19:53,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2089~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2089~0.offset_9| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2089~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10|) |v_ULTIMATE.start_main_~#t2089~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2089~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2089~0.base] because there is no mapped edge [2019-12-27 18:19:53,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:19:53,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2090~0.offset_10| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11|) |v_ULTIMATE.start_main_~#t2090~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2090~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2090~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_10|, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2090~0.offset, ULTIMATE.start_main_~#t2090~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:19:53,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In966288695 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In966288695 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In966288695 |P2Thread1of1ForFork1_#t~ite32_Out966288695|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In966288695 |P2Thread1of1ForFork1_#t~ite32_Out966288695|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In966288695, ~x$w_buff1_used~0=~x$w_buff1_used~0_In966288695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In966288695, ~x~0=~x~0_In966288695} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out966288695|, ~x$w_buff1~0=~x$w_buff1~0_In966288695, ~x$w_buff1_used~0=~x$w_buff1_used~0_In966288695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In966288695, ~x~0=~x~0_In966288695} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:19:53,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:19:53,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-531097934 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-531097934 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-531097934|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-531097934 |P2Thread1of1ForFork1_#t~ite34_Out-531097934|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-531097934, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531097934} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-531097934|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-531097934, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531097934} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:19:53,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-710860096 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-710860096 256) 0))) (or (and (= ~x$w_buff0_used~0_In-710860096 |P1Thread1of1ForFork0_#t~ite28_Out-710860096|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-710860096|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-710860096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-710860096} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-710860096, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-710860096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-710860096} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:19:53,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-128183354 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-128183354 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-128183354 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-128183354 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-128183354|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-128183354| ~x$w_buff1_used~0_In-128183354)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-128183354, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-128183354, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-128183354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-128183354} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-128183354, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-128183354, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-128183354, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-128183354|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-128183354} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:19:53,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1045861380 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1045861380 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1045861380 ~x$r_buff0_thd2~0_In-1045861380) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1045861380 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1045861380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045861380} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1045861380|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1045861380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045861380} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:19:53,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-454826003 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-454826003 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-454826003 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-454826003 256)))) (or (and (= ~x$r_buff1_thd2~0_In-454826003 |P1Thread1of1ForFork0_#t~ite31_Out-454826003|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-454826003|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-454826003, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-454826003, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-454826003, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-454826003} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-454826003|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-454826003, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-454826003, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-454826003, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-454826003} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:19:53,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:19:53,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In401902582 256)))) (or (and (= ~x$w_buff0~0_In401902582 |P0Thread1of1ForFork2_#t~ite9_Out401902582|) (= |P0Thread1of1ForFork2_#t~ite8_In401902582| |P0Thread1of1ForFork2_#t~ite8_Out401902582|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out401902582| ~x$w_buff0~0_In401902582) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In401902582 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In401902582 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In401902582 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In401902582 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out401902582| |P0Thread1of1ForFork2_#t~ite9_Out401902582|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In401902582, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In401902582, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In401902582|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In401902582, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In401902582, ~weak$$choice2~0=~weak$$choice2~0_In401902582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In401902582} OutVars{~x$w_buff0~0=~x$w_buff0~0_In401902582, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In401902582, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out401902582|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In401902582, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out401902582|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In401902582, ~weak$$choice2~0=~weak$$choice2~0_In401902582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In401902582} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 18:19:53,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1087570948 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1087570948 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1087570948 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1087570948 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1087570948|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1087570948 |P2Thread1of1ForFork1_#t~ite35_Out1087570948|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1087570948, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1087570948, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1087570948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1087570948} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1087570948|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1087570948, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1087570948, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1087570948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1087570948} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:19:53,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-904648580 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-904648580 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-904648580| ~x$r_buff0_thd3~0_In-904648580)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-904648580| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-904648580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-904648580} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-904648580|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-904648580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-904648580} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:19:53,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In84823051 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In84823051 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In84823051 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In84823051 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out84823051|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In84823051 |P2Thread1of1ForFork1_#t~ite37_Out84823051|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In84823051, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In84823051, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In84823051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In84823051} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out84823051|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In84823051, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In84823051, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In84823051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In84823051} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:19:53,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:19:53,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1879007897 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1879007897| |P0Thread1of1ForFork2_#t~ite17_Out1879007897|) (= |P0Thread1of1ForFork2_#t~ite18_Out1879007897| ~x$w_buff1_used~0_In1879007897)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out1879007897| |P0Thread1of1ForFork2_#t~ite18_Out1879007897|) (= |P0Thread1of1ForFork2_#t~ite17_Out1879007897| ~x$w_buff1_used~0_In1879007897) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1879007897 256)))) (or (= (mod ~x$w_buff0_used~0_In1879007897 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In1879007897 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1879007897 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1879007897, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1879007897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1879007897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1879007897, ~weak$$choice2~0=~weak$$choice2~0_In1879007897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1879007897} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1879007897, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1879007897|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1879007897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1879007897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1879007897, ~weak$$choice2~0=~weak$$choice2~0_In1879007897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1879007897} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:19:53,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:19:53,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1220686572 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1220686572| |P0Thread1of1ForFork2_#t~ite23_Out-1220686572|) (= ~x$r_buff1_thd1~0_In-1220686572 |P0Thread1of1ForFork2_#t~ite24_Out-1220686572|)) (and .cse0 (= ~x$r_buff1_thd1~0_In-1220686572 |P0Thread1of1ForFork2_#t~ite23_Out-1220686572|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1220686572 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1220686572 256) 0)) (= (mod ~x$w_buff0_used~0_In-1220686572 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1220686572 256))))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1220686572| |P0Thread1of1ForFork2_#t~ite23_Out-1220686572|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1220686572, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1220686572, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1220686572, ~weak$$choice2~0=~weak$$choice2~0_In-1220686572, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1220686572|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220686572} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1220686572, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1220686572, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1220686572, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1220686572|, ~weak$$choice2~0=~weak$$choice2~0_In-1220686572, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1220686572|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1220686572} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:19:53,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:19:53,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:19:53,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In226499502 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In226499502 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out226499502| ~x$w_buff1~0_In226499502) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In226499502 |ULTIMATE.start_main_#t~ite41_Out226499502|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In226499502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226499502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226499502, ~x~0=~x~0_In226499502} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out226499502|, ~x$w_buff1~0=~x$w_buff1~0_In226499502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226499502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226499502, ~x~0=~x~0_In226499502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:19:53,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:19:53,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In158439021 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In158439021 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out158439021|)) (and (= |ULTIMATE.start_main_#t~ite43_Out158439021| ~x$w_buff0_used~0_In158439021) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In158439021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In158439021} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In158439021, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out158439021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In158439021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:19:53,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1319284049 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1319284049 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1319284049 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1319284049 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1319284049|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1319284049 |ULTIMATE.start_main_#t~ite44_Out1319284049|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1319284049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1319284049, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1319284049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1319284049} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1319284049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1319284049, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1319284049, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1319284049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1319284049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:19:53,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In844847533 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In844847533 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out844847533| 0)) (and (= ~x$r_buff0_thd0~0_In844847533 |ULTIMATE.start_main_#t~ite45_Out844847533|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In844847533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In844847533} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In844847533, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out844847533|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In844847533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:19:53,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1993346393 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1993346393 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1993346393 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1993346393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1993346393|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1993346393 |ULTIMATE.start_main_#t~ite46_Out1993346393|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1993346393, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1993346393, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1993346393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1993346393} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1993346393, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1993346393|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1993346393, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1993346393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1993346393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:19:53,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:19:53,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:19:53 BasicIcfg [2019-12-27 18:19:53,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:19:53,241 INFO L168 Benchmark]: Toolchain (without parser) took 167016.55 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 877.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,241 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:19:53,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.03 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 156.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,243 INFO L168 Benchmark]: Boogie Preprocessor took 37.23 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,243 INFO L168 Benchmark]: RCFGBuilder took 763.70 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 104.9 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,244 INFO L168 Benchmark]: TraceAbstraction took 165388.60 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 816.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:19:53,247 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.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.03 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 156.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.23 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.70 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 104.9 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165388.60 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 816.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2088, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2089, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2090, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 165.0s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3074 SDtfs, 4556 SDslu, 7053 SDs, 0 SdLazy, 4070 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 60 SyntacticMatches, 35 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 224707 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 138843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...