/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:37:07,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:37:07,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:37:07,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:37:07,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:37:07,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:37:07,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:37:07,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:37:07,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:37:07,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:37:07,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:37:07,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:37:07,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:37:07,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:37:07,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:37:07,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:37:07,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:37:07,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:37:07,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:37:07,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:37:07,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:37:07,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:37:07,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:37:07,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:37:07,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:37:07,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:37:07,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:37:07,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:37:07,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:37:07,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:37:07,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:37:07,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:37:07,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:37:07,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:37:07,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:37:07,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:37:07,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:37:07,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:37:07,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:37:07,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:37:07,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:37:07,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:37:07,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:37:07,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:37:07,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:37:07,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:37:07,856 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:37:07,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:37:07,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:37:07,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:37:07,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:37:07,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:37:07,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:37:07,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:37:07,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:37:07,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:37:07,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:37:07,860 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:37:07,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:37:07,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:37:07,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:37:07,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:37:07,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:37:07,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:37:07,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:37:07,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:37:07,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:37:07,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:37:07,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:37:07,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:37:07,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:37:08,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:37:08,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:37:08,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:37:08,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:37:08,183 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:37:08,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-27 03:37:08,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48794fa8e/df40c94913b84323a588abd66ce96936/FLAGf5557aefe [2019-12-27 03:37:08,800 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:37:08,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-27 03:37:08,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48794fa8e/df40c94913b84323a588abd66ce96936/FLAGf5557aefe [2019-12-27 03:37:09,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48794fa8e/df40c94913b84323a588abd66ce96936 [2019-12-27 03:37:09,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:37:09,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:37:09,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:09,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:37:09,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:37:09,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58700a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09, skipping insertion in model container [2019-12-27 03:37:09,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:37:09,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:37:09,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:09,671 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:37:09,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:37:09,808 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:37:09,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09 WrapperNode [2019-12-27 03:37:09,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:37:09,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:09,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:37:09,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:37:09,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:37:09,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:37:09,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:37:09,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:37:09,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... [2019-12-27 03:37:09,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:37:09,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:37:09,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:37:09,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:37:09,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:37:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 03:37:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:37:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:37:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:37:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:37:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:37:09,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:37:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:37:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:37:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:37:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:37:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 03:37:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:37:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:37:09,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:37:09,990 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:37:10,953 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:37:10,954 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 03:37:10,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:10 BoogieIcfgContainer [2019-12-27 03:37:10,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:37:10,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:37:10,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:37:10,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:37:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:37:09" (1/3) ... [2019-12-27 03:37:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61416ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:10, skipping insertion in model container [2019-12-27 03:37:10,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:37:09" (2/3) ... [2019-12-27 03:37:10,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61416ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:37:10, skipping insertion in model container [2019-12-27 03:37:10,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:37:10" (3/3) ... [2019-12-27 03:37:10,966 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2019-12-27 03:37:10,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:37:10,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:37:10,988 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 03:37:10,989 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:37:11,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,061 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,094 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,094 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,109 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,126 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,130 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:37:11,156 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 03:37:11,174 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:37:11,174 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:37:11,174 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:37:11,174 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:37:11,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:37:11,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:37:11,175 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:37:11,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:37:11,191 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 230 transitions [2019-12-27 03:37:11,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-27 03:37:11,304 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-27 03:37:11,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:11,322 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-27 03:37:11,346 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-27 03:37:11,404 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-27 03:37:11,405 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:37:11,413 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-27 03:37:11,435 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19530 [2019-12-27 03:37:11,436 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:37:17,248 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-27 03:37:17,508 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 03:37:18,035 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2019-12-27 03:37:18,269 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 03:37:18,293 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80972 [2019-12-27 03:37:18,293 INFO L214 etLargeBlockEncoding]: Total number of compositions: 145 [2019-12-27 03:37:18,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 95 transitions [2019-12-27 03:37:29,002 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 88334 states. [2019-12-27 03:37:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 88334 states. [2019-12-27 03:37:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:37:29,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:29,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:29,061 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:29,068 INFO L82 PathProgramCache]: Analyzing trace with hash -986847660, now seen corresponding path program 1 times [2019-12-27 03:37:29,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:29,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911986919] [2019-12-27 03:37:29,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:29,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911986919] [2019-12-27 03:37:29,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:29,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:29,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183205418] [2019-12-27 03:37:29,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:29,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:29,453 INFO L87 Difference]: Start difference. First operand 88334 states. Second operand 3 states. [2019-12-27 03:37:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:32,396 INFO L93 Difference]: Finished difference Result 86714 states and 375258 transitions. [2019-12-27 03:37:32,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:32,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 03:37:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:32,980 INFO L225 Difference]: With dead ends: 86714 [2019-12-27 03:37:32,980 INFO L226 Difference]: Without dead ends: 81566 [2019-12-27 03:37:32,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81566 states. [2019-12-27 03:37:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81566 to 81566. [2019-12-27 03:37:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81566 states. [2019-12-27 03:37:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81566 states to 81566 states and 353106 transitions. [2019-12-27 03:37:38,337 INFO L78 Accepts]: Start accepts. Automaton has 81566 states and 353106 transitions. Word has length 17 [2019-12-27 03:37:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:38,338 INFO L462 AbstractCegarLoop]: Abstraction has 81566 states and 353106 transitions. [2019-12-27 03:37:38,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 81566 states and 353106 transitions. [2019-12-27 03:37:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:37:38,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:38,354 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 03:37:38,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1233893207, now seen corresponding path program 1 times [2019-12-27 03:37:38,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:38,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029824685] [2019-12-27 03:37:38,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:38,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029824685] [2019-12-27 03:37:38,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:38,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:38,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854961527] [2019-12-27 03:37:38,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:38,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:38,537 INFO L87 Difference]: Start difference. First operand 81566 states and 353106 transitions. Second operand 4 states. [2019-12-27 03:37:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:41,744 INFO L93 Difference]: Finished difference Result 24578 states and 86748 transitions. [2019-12-27 03:37:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:37:41,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 03:37:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:41,814 INFO L225 Difference]: With dead ends: 24578 [2019-12-27 03:37:41,814 INFO L226 Difference]: Without dead ends: 19610 [2019-12-27 03:37:41,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19610 states. [2019-12-27 03:37:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19610 to 19610. [2019-12-27 03:37:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19610 states. [2019-12-27 03:37:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19610 states to 19610 states and 66534 transitions. [2019-12-27 03:37:42,213 INFO L78 Accepts]: Start accepts. Automaton has 19610 states and 66534 transitions. Word has length 18 [2019-12-27 03:37:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:42,213 INFO L462 AbstractCegarLoop]: Abstraction has 19610 states and 66534 transitions. [2019-12-27 03:37:42,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19610 states and 66534 transitions. [2019-12-27 03:37:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:37:42,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:42,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:42,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:42,228 INFO L82 PathProgramCache]: Analyzing trace with hash -878963340, now seen corresponding path program 1 times [2019-12-27 03:37:42,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:42,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253952547] [2019-12-27 03:37:42,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:42,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253952547] [2019-12-27 03:37:42,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:42,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:42,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480801010] [2019-12-27 03:37:42,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:42,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:42,339 INFO L87 Difference]: Start difference. First operand 19610 states and 66534 transitions. Second operand 4 states. [2019-12-27 03:37:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:42,704 INFO L93 Difference]: Finished difference Result 28094 states and 91940 transitions. [2019-12-27 03:37:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:42,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 03:37:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:42,783 INFO L225 Difference]: With dead ends: 28094 [2019-12-27 03:37:42,783 INFO L226 Difference]: Without dead ends: 28094 [2019-12-27 03:37:42,784 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 03:37:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2019-12-27 03:37:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 25566. [2019-12-27 03:37:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25566 states. [2019-12-27 03:37:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25566 states to 25566 states and 84762 transitions. [2019-12-27 03:37:43,812 INFO L78 Accepts]: Start accepts. Automaton has 25566 states and 84762 transitions. Word has length 28 [2019-12-27 03:37:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:43,812 INFO L462 AbstractCegarLoop]: Abstraction has 25566 states and 84762 transitions. [2019-12-27 03:37:43,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25566 states and 84762 transitions. [2019-12-27 03:37:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:37:43,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:43,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:43,825 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 457198623, now seen corresponding path program 1 times [2019-12-27 03:37:43,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:43,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157461964] [2019-12-27 03:37:43,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:43,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157461964] [2019-12-27 03:37:43,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:43,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:43,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701404710] [2019-12-27 03:37:43,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:43,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:43,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:43,976 INFO L87 Difference]: Start difference. First operand 25566 states and 84762 transitions. Second operand 4 states. [2019-12-27 03:37:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:44,380 INFO L93 Difference]: Finished difference Result 33274 states and 107925 transitions. [2019-12-27 03:37:44,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:44,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 03:37:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:44,451 INFO L225 Difference]: With dead ends: 33274 [2019-12-27 03:37:44,451 INFO L226 Difference]: Without dead ends: 33274 [2019-12-27 03:37:44,452 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 03:37:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33274 states. [2019-12-27 03:37:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33274 to 28465. [2019-12-27 03:37:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28465 states. [2019-12-27 03:37:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 93739 transitions. [2019-12-27 03:37:45,423 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 93739 transitions. Word has length 28 [2019-12-27 03:37:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:45,423 INFO L462 AbstractCegarLoop]: Abstraction has 28465 states and 93739 transitions. [2019-12-27 03:37:45,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 93739 transitions. [2019-12-27 03:37:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:37:45,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:45,436 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 03:37:45,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2110520713, now seen corresponding path program 1 times [2019-12-27 03:37:45,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:45,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080172794] [2019-12-27 03:37:45,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:45,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080172794] [2019-12-27 03:37:45,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:45,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:37:45,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353323851] [2019-12-27 03:37:45,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:45,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:45,550 INFO L87 Difference]: Start difference. First operand 28465 states and 93739 transitions. Second operand 5 states. [2019-12-27 03:37:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:45,649 INFO L93 Difference]: Finished difference Result 12038 states and 36499 transitions. [2019-12-27 03:37:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:45,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 03:37:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:45,665 INFO L225 Difference]: With dead ends: 12038 [2019-12-27 03:37:45,666 INFO L226 Difference]: Without dead ends: 10333 [2019-12-27 03:37:45,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10333 states. [2019-12-27 03:37:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10333 to 10069. [2019-12-27 03:37:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10069 states. [2019-12-27 03:37:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10069 states to 10069 states and 30458 transitions. [2019-12-27 03:37:45,864 INFO L78 Accepts]: Start accepts. Automaton has 10069 states and 30458 transitions. Word has length 29 [2019-12-27 03:37:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:45,864 INFO L462 AbstractCegarLoop]: Abstraction has 10069 states and 30458 transitions. [2019-12-27 03:37:45,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10069 states and 30458 transitions. [2019-12-27 03:37:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:37:45,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:45,882 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 03:37:45,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1416589173, now seen corresponding path program 1 times [2019-12-27 03:37:45,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:45,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179859112] [2019-12-27 03:37:45,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179859112] [2019-12-27 03:37:46,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:46,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:37:46,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637498155] [2019-12-27 03:37:46,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:37:46,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:37:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:46,048 INFO L87 Difference]: Start difference. First operand 10069 states and 30458 transitions. Second operand 7 states. [2019-12-27 03:37:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:46,778 INFO L93 Difference]: Finished difference Result 11799 states and 35040 transitions. [2019-12-27 03:37:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:37:46,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 03:37:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:46,796 INFO L225 Difference]: With dead ends: 11799 [2019-12-27 03:37:46,796 INFO L226 Difference]: Without dead ends: 11799 [2019-12-27 03:37:46,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:37:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11799 states. [2019-12-27 03:37:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11799 to 9629. [2019-12-27 03:37:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9629 states. [2019-12-27 03:37:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9629 states to 9629 states and 29082 transitions. [2019-12-27 03:37:46,946 INFO L78 Accepts]: Start accepts. Automaton has 9629 states and 29082 transitions. Word has length 39 [2019-12-27 03:37:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:46,946 INFO L462 AbstractCegarLoop]: Abstraction has 9629 states and 29082 transitions. [2019-12-27 03:37:46,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:37:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 9629 states and 29082 transitions. [2019-12-27 03:37:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:37:46,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:46,959 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 03:37:46,960 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1670978222, now seen corresponding path program 1 times [2019-12-27 03:37:46,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:46,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911941905] [2019-12-27 03:37:46,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:47,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911941905] [2019-12-27 03:37:47,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:47,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:47,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044341747] [2019-12-27 03:37:47,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:37:47,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:37:47,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:37:47,103 INFO L87 Difference]: Start difference. First operand 9629 states and 29082 transitions. Second operand 6 states. [2019-12-27 03:37:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:47,193 INFO L93 Difference]: Finished difference Result 8825 states and 27149 transitions. [2019-12-27 03:37:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:37:47,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:37:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:47,207 INFO L225 Difference]: With dead ends: 8825 [2019-12-27 03:37:47,207 INFO L226 Difference]: Without dead ends: 8724 [2019-12-27 03:37:47,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:37:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8724 states. [2019-12-27 03:37:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8724 to 8436. [2019-12-27 03:37:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 03:37:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 26170 transitions. [2019-12-27 03:37:47,392 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 26170 transitions. Word has length 40 [2019-12-27 03:37:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:47,393 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 26170 transitions. [2019-12-27 03:37:47,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:37:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 26170 transitions. [2019-12-27 03:37:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:37:47,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:47,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:47,406 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:47,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 227924408, now seen corresponding path program 1 times [2019-12-27 03:37:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:47,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793153637] [2019-12-27 03:37:47,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:47,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793153637] [2019-12-27 03:37:47,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:47,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:47,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070117940] [2019-12-27 03:37:47,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:47,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:47,459 INFO L87 Difference]: Start difference. First operand 8436 states and 26170 transitions. Second operand 3 states. [2019-12-27 03:37:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:47,544 INFO L93 Difference]: Finished difference Result 13940 states and 42457 transitions. [2019-12-27 03:37:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 03:37:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:47,569 INFO L225 Difference]: With dead ends: 13940 [2019-12-27 03:37:47,569 INFO L226 Difference]: Without dead ends: 13940 [2019-12-27 03:37:47,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13940 states. [2019-12-27 03:37:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13940 to 9810. [2019-12-27 03:37:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9810 states. [2019-12-27 03:37:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 30153 transitions. [2019-12-27 03:37:47,789 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 30153 transitions. Word has length 58 [2019-12-27 03:37:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:47,789 INFO L462 AbstractCegarLoop]: Abstraction has 9810 states and 30153 transitions. [2019-12-27 03:37:47,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 30153 transitions. [2019-12-27 03:37:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:37:47,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:47,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:47,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1697581937, now seen corresponding path program 1 times [2019-12-27 03:37:47,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:47,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741535342] [2019-12-27 03:37:47,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:47,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741535342] [2019-12-27 03:37:47,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:47,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:37:47,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741738197] [2019-12-27 03:37:47,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:47,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:47,888 INFO L87 Difference]: Start difference. First operand 9810 states and 30153 transitions. Second operand 5 states. [2019-12-27 03:37:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:48,196 INFO L93 Difference]: Finished difference Result 13023 states and 39182 transitions. [2019-12-27 03:37:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:37:48,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 03:37:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:48,214 INFO L225 Difference]: With dead ends: 13023 [2019-12-27 03:37:48,215 INFO L226 Difference]: Without dead ends: 13023 [2019-12-27 03:37:48,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2019-12-27 03:37:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 10554. [2019-12-27 03:37:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10554 states. [2019-12-27 03:37:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 31876 transitions. [2019-12-27 03:37:48,378 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 31876 transitions. Word has length 58 [2019-12-27 03:37:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:48,378 INFO L462 AbstractCegarLoop]: Abstraction has 10554 states and 31876 transitions. [2019-12-27 03:37:48,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 31876 transitions. [2019-12-27 03:37:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:37:48,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:48,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:48,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 60629961, now seen corresponding path program 1 times [2019-12-27 03:37:48,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:48,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146459059] [2019-12-27 03:37:48,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:48,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146459059] [2019-12-27 03:37:48,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:48,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:37:48,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432040819] [2019-12-27 03:37:48,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:48,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:48,486 INFO L87 Difference]: Start difference. First operand 10554 states and 31876 transitions. Second operand 5 states. [2019-12-27 03:37:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:48,925 INFO L93 Difference]: Finished difference Result 14106 states and 41943 transitions. [2019-12-27 03:37:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:37:48,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 03:37:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:48,950 INFO L225 Difference]: With dead ends: 14106 [2019-12-27 03:37:48,950 INFO L226 Difference]: Without dead ends: 14106 [2019-12-27 03:37:48,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2019-12-27 03:37:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 11034. [2019-12-27 03:37:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11034 states. [2019-12-27 03:37:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11034 states to 11034 states and 33302 transitions. [2019-12-27 03:37:49,413 INFO L78 Accepts]: Start accepts. Automaton has 11034 states and 33302 transitions. Word has length 59 [2019-12-27 03:37:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:49,413 INFO L462 AbstractCegarLoop]: Abstraction has 11034 states and 33302 transitions. [2019-12-27 03:37:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11034 states and 33302 transitions. [2019-12-27 03:37:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:37:49,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:49,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:49,432 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2115982021, now seen corresponding path program 2 times [2019-12-27 03:37:49,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:49,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925106802] [2019-12-27 03:37:49,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:49,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925106802] [2019-12-27 03:37:49,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:49,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:49,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563915271] [2019-12-27 03:37:49,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:49,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:49,520 INFO L87 Difference]: Start difference. First operand 11034 states and 33302 transitions. Second operand 4 states. [2019-12-27 03:37:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:49,649 INFO L93 Difference]: Finished difference Result 15781 states and 46934 transitions. [2019-12-27 03:37:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:37:49,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 03:37:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:49,680 INFO L225 Difference]: With dead ends: 15781 [2019-12-27 03:37:49,680 INFO L226 Difference]: Without dead ends: 15781 [2019-12-27 03:37:49,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15781 states. [2019-12-27 03:37:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15781 to 10050. [2019-12-27 03:37:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10050 states. [2019-12-27 03:37:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10050 states to 10050 states and 30316 transitions. [2019-12-27 03:37:49,947 INFO L78 Accepts]: Start accepts. Automaton has 10050 states and 30316 transitions. Word has length 59 [2019-12-27 03:37:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:49,947 INFO L462 AbstractCegarLoop]: Abstraction has 10050 states and 30316 transitions. [2019-12-27 03:37:49,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 10050 states and 30316 transitions. [2019-12-27 03:37:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:37:49,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:49,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:49,964 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1574340111, now seen corresponding path program 1 times [2019-12-27 03:37:49,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:49,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588056586] [2019-12-27 03:37:49,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:50,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588056586] [2019-12-27 03:37:50,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:50,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:37:50,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132682922] [2019-12-27 03:37:50,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:37:50,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:37:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:37:50,095 INFO L87 Difference]: Start difference. First operand 10050 states and 30316 transitions. Second operand 6 states. [2019-12-27 03:37:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:50,780 INFO L93 Difference]: Finished difference Result 12984 states and 38590 transitions. [2019-12-27 03:37:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:37:50,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 03:37:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:50,798 INFO L225 Difference]: With dead ends: 12984 [2019-12-27 03:37:50,799 INFO L226 Difference]: Without dead ends: 12984 [2019-12-27 03:37:50,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:37:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2019-12-27 03:37:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 10146. [2019-12-27 03:37:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10146 states. [2019-12-27 03:37:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 30618 transitions. [2019-12-27 03:37:50,950 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 30618 transitions. Word has length 59 [2019-12-27 03:37:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:50,951 INFO L462 AbstractCegarLoop]: Abstraction has 10146 states and 30618 transitions. [2019-12-27 03:37:50,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:37:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 30618 transitions. [2019-12-27 03:37:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:37:50,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:50,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:50,962 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1554852441, now seen corresponding path program 2 times [2019-12-27 03:37:50,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:50,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297336873] [2019-12-27 03:37:50,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:51,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297336873] [2019-12-27 03:37:51,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:51,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:37:51,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570928534] [2019-12-27 03:37:51,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:37:51,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:37:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:51,073 INFO L87 Difference]: Start difference. First operand 10146 states and 30618 transitions. Second operand 7 states. [2019-12-27 03:37:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:51,919 INFO L93 Difference]: Finished difference Result 14210 states and 42432 transitions. [2019-12-27 03:37:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:37:51,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 03:37:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:51,940 INFO L225 Difference]: With dead ends: 14210 [2019-12-27 03:37:51,940 INFO L226 Difference]: Without dead ends: 14210 [2019-12-27 03:37:51,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:37:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-27 03:37:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 9948. [2019-12-27 03:37:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9948 states. [2019-12-27 03:37:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9948 states to 9948 states and 30075 transitions. [2019-12-27 03:37:52,106 INFO L78 Accepts]: Start accepts. Automaton has 9948 states and 30075 transitions. Word has length 59 [2019-12-27 03:37:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:52,106 INFO L462 AbstractCegarLoop]: Abstraction has 9948 states and 30075 transitions. [2019-12-27 03:37:52,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:37:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9948 states and 30075 transitions. [2019-12-27 03:37:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:37:52,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:52,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:52,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1605957397, now seen corresponding path program 1 times [2019-12-27 03:37:52,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:52,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540365929] [2019-12-27 03:37:52,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:52,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540365929] [2019-12-27 03:37:52,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:52,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:37:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148155628] [2019-12-27 03:37:52,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:37:52,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:37:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:37:52,434 INFO L87 Difference]: Start difference. First operand 9948 states and 30075 transitions. Second operand 10 states. [2019-12-27 03:37:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:53,273 INFO L93 Difference]: Finished difference Result 17476 states and 51445 transitions. [2019-12-27 03:37:53,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:37:53,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-27 03:37:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:53,296 INFO L225 Difference]: With dead ends: 17476 [2019-12-27 03:37:53,296 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 03:37:53,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:37:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 03:37:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 11682. [2019-12-27 03:37:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11682 states. [2019-12-27 03:37:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11682 states to 11682 states and 35108 transitions. [2019-12-27 03:37:53,476 INFO L78 Accepts]: Start accepts. Automaton has 11682 states and 35108 transitions. Word has length 60 [2019-12-27 03:37:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:53,476 INFO L462 AbstractCegarLoop]: Abstraction has 11682 states and 35108 transitions. [2019-12-27 03:37:53,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:37:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 11682 states and 35108 transitions. [2019-12-27 03:37:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:37:53,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:53,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:53,487 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1875291559, now seen corresponding path program 2 times [2019-12-27 03:37:53,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:53,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369139787] [2019-12-27 03:37:53,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:53,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369139787] [2019-12-27 03:37:53,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:53,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:53,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269912237] [2019-12-27 03:37:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:53,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:53,551 INFO L87 Difference]: Start difference. First operand 11682 states and 35108 transitions. Second operand 3 states. [2019-12-27 03:37:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:53,605 INFO L93 Difference]: Finished difference Result 11681 states and 35106 transitions. [2019-12-27 03:37:53,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:53,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-27 03:37:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:53,625 INFO L225 Difference]: With dead ends: 11681 [2019-12-27 03:37:53,626 INFO L226 Difference]: Without dead ends: 11681 [2019-12-27 03:37:53,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2019-12-27 03:37:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11681. [2019-12-27 03:37:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 03:37:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 35106 transitions. [2019-12-27 03:37:53,823 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 35106 transitions. Word has length 60 [2019-12-27 03:37:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:53,823 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 35106 transitions. [2019-12-27 03:37:53,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 35106 transitions. [2019-12-27 03:37:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 03:37:53,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:53,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:53,835 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127970, now seen corresponding path program 1 times [2019-12-27 03:37:53,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:53,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995639777] [2019-12-27 03:37:53,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:53,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995639777] [2019-12-27 03:37:53,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:53,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:53,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11509828] [2019-12-27 03:37:53,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:53,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:53,917 INFO L87 Difference]: Start difference. First operand 11681 states and 35106 transitions. Second operand 3 states. [2019-12-27 03:37:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:53,961 INFO L93 Difference]: Finished difference Result 11357 states and 33870 transitions. [2019-12-27 03:37:53,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:53,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 03:37:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:53,979 INFO L225 Difference]: With dead ends: 11357 [2019-12-27 03:37:53,979 INFO L226 Difference]: Without dead ends: 11357 [2019-12-27 03:37:53,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11357 states. [2019-12-27 03:37:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11357 to 11033. [2019-12-27 03:37:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11033 states. [2019-12-27 03:37:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11033 states to 11033 states and 32896 transitions. [2019-12-27 03:37:54,164 INFO L78 Accepts]: Start accepts. Automaton has 11033 states and 32896 transitions. Word has length 61 [2019-12-27 03:37:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 11033 states and 32896 transitions. [2019-12-27 03:37:54,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11033 states and 32896 transitions. [2019-12-27 03:37:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 03:37:54,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:54,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:54,174 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2112472219, now seen corresponding path program 1 times [2019-12-27 03:37:54,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:54,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606518456] [2019-12-27 03:37:54,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:54,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606518456] [2019-12-27 03:37:54,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:54,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:37:54,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436902282] [2019-12-27 03:37:54,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:37:54,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:37:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:37:54,263 INFO L87 Difference]: Start difference. First operand 11033 states and 32896 transitions. Second operand 6 states. [2019-12-27 03:37:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:54,741 INFO L93 Difference]: Finished difference Result 13883 states and 40866 transitions. [2019-12-27 03:37:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:37:54,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 03:37:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:54,759 INFO L225 Difference]: With dead ends: 13883 [2019-12-27 03:37:54,759 INFO L226 Difference]: Without dead ends: 13883 [2019-12-27 03:37:54,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 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 03:37:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13883 states. [2019-12-27 03:37:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13883 to 11897. [2019-12-27 03:37:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11897 states. [2019-12-27 03:37:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11897 states to 11897 states and 35482 transitions. [2019-12-27 03:37:54,993 INFO L78 Accepts]: Start accepts. Automaton has 11897 states and 35482 transitions. Word has length 61 [2019-12-27 03:37:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:54,993 INFO L462 AbstractCegarLoop]: Abstraction has 11897 states and 35482 transitions. [2019-12-27 03:37:54,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:37:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 11897 states and 35482 transitions. [2019-12-27 03:37:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 03:37:55,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:55,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:55,005 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash -97832175, now seen corresponding path program 2 times [2019-12-27 03:37:55,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:55,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149760821] [2019-12-27 03:37:55,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:55,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149760821] [2019-12-27 03:37:55,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:55,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:37:55,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993019380] [2019-12-27 03:37:55,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:37:55,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:37:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:55,084 INFO L87 Difference]: Start difference. First operand 11897 states and 35482 transitions. Second operand 3 states. [2019-12-27 03:37:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:55,131 INFO L93 Difference]: Finished difference Result 11531 states and 34211 transitions. [2019-12-27 03:37:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:37:55,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 03:37:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:55,149 INFO L225 Difference]: With dead ends: 11531 [2019-12-27 03:37:55,149 INFO L226 Difference]: Without dead ends: 11531 [2019-12-27 03:37:55,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:37:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11531 states. [2019-12-27 03:37:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11531 to 11075. [2019-12-27 03:37:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2019-12-27 03:37:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 32919 transitions. [2019-12-27 03:37:55,424 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 32919 transitions. Word has length 61 [2019-12-27 03:37:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:55,425 INFO L462 AbstractCegarLoop]: Abstraction has 11075 states and 32919 transitions. [2019-12-27 03:37:55,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:37:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 32919 transitions. [2019-12-27 03:37:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 03:37:55,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:55,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:55,447 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash -949712399, now seen corresponding path program 1 times [2019-12-27 03:37:55,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:55,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151704817] [2019-12-27 03:37:55,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:55,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151704817] [2019-12-27 03:37:55,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:55,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:37:55,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983181056] [2019-12-27 03:37:55,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:37:55,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:37:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:37:55,840 INFO L87 Difference]: Start difference. First operand 11075 states and 32919 transitions. Second operand 12 states. [2019-12-27 03:37:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:57,844 INFO L93 Difference]: Finished difference Result 20862 states and 61123 transitions. [2019-12-27 03:37:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:37:57,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-27 03:37:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:57,884 INFO L225 Difference]: With dead ends: 20862 [2019-12-27 03:37:57,884 INFO L226 Difference]: Without dead ends: 20862 [2019-12-27 03:37:57,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 03:37:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20862 states. [2019-12-27 03:37:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20862 to 11447. [2019-12-27 03:37:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11447 states. [2019-12-27 03:37:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 34397 transitions. [2019-12-27 03:37:58,144 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 34397 transitions. Word has length 62 [2019-12-27 03:37:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:58,144 INFO L462 AbstractCegarLoop]: Abstraction has 11447 states and 34397 transitions. [2019-12-27 03:37:58,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:37:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 34397 transitions. [2019-12-27 03:37:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 03:37:58,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:58,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:58,157 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 249256444, now seen corresponding path program 1 times [2019-12-27 03:37:58,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:58,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455331025] [2019-12-27 03:37:58,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:58,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455331025] [2019-12-27 03:37:58,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:58,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:58,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983112760] [2019-12-27 03:37:58,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:37:58,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:37:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:58,317 INFO L87 Difference]: Start difference. First operand 11447 states and 34397 transitions. Second operand 5 states. [2019-12-27 03:37:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:58,462 INFO L93 Difference]: Finished difference Result 20699 states and 61965 transitions. [2019-12-27 03:37:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:37:58,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-27 03:37:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:58,586 INFO L225 Difference]: With dead ends: 20699 [2019-12-27 03:37:58,586 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 03:37:58,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:37:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 03:37:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10093. [2019-12-27 03:37:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10093 states. [2019-12-27 03:37:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10093 states to 10093 states and 30042 transitions. [2019-12-27 03:37:58,818 INFO L78 Accepts]: Start accepts. Automaton has 10093 states and 30042 transitions. Word has length 63 [2019-12-27 03:37:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:58,818 INFO L462 AbstractCegarLoop]: Abstraction has 10093 states and 30042 transitions. [2019-12-27 03:37:58,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:37:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10093 states and 30042 transitions. [2019-12-27 03:37:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 03:37:58,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:58,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:58,834 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1218456598, now seen corresponding path program 2 times [2019-12-27 03:37:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710958214] [2019-12-27 03:37:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:37:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:37:58,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710958214] [2019-12-27 03:37:58,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:37:58,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:37:58,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482961900] [2019-12-27 03:37:58,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:37:58,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:37:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:37:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:37:58,940 INFO L87 Difference]: Start difference. First operand 10093 states and 30042 transitions. Second operand 4 states. [2019-12-27 03:37:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:37:59,001 INFO L93 Difference]: Finished difference Result 13011 states and 38000 transitions. [2019-12-27 03:37:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:37:59,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 03:37:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:37:59,005 INFO L225 Difference]: With dead ends: 13011 [2019-12-27 03:37:59,006 INFO L226 Difference]: Without dead ends: 3799 [2019-12-27 03:37:59,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:37:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2019-12-27 03:37:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 3799. [2019-12-27 03:37:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3799 states. [2019-12-27 03:37:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3799 states to 3799 states and 10359 transitions. [2019-12-27 03:37:59,054 INFO L78 Accepts]: Start accepts. Automaton has 3799 states and 10359 transitions. Word has length 63 [2019-12-27 03:37:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:37:59,054 INFO L462 AbstractCegarLoop]: Abstraction has 3799 states and 10359 transitions. [2019-12-27 03:37:59,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:37:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3799 states and 10359 transitions. [2019-12-27 03:37:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 03:37:59,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:37:59,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:37:59,058 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:37:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:37:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1116199452, now seen corresponding path program 3 times [2019-12-27 03:37:59,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:37:59,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614765398] [2019-12-27 03:37:59,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:37:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:37:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:37:59,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:37:59,240 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:37:59,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_140| 1))) (and (= (select (select |v_#memory_int_277| |v_~#x~0.base_140|) |v_~#x~0.offset_140|) 0) (= 0 v_~x$r_buff0_thd1~0_68) (= v_~x$r_buff1_thd3~0_58 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$r_buff1_thd1~0_56 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_58) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= 0 v_~weak$$choice2~0_98) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24| 1)) (= 0 v_~x$r_buff0_thd0~0_92) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 v_~x$r_buff0_thd3~0_78) (= 0 v_~x$w_buff0~0_96) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_77) (= v_~main$tmp_guard0~0_54 0) (= 0 v_~x$r_buff0_thd2~0_264) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= 0 v_~weak$$choice1~0_32) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= v_~x$mem_tmp~0_39 0) (= 0 (select .cse1 |v_~#x~0.base_140|)) (< 0 |v_#StackHeapBarrier_22|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2000~0.base_24|) (= 0 v_~x$w_buff1~0_81) (= 0 v_~__unbuffered_p1_EAX~0_61) (= v_~x$flush_delayed~0_68 0) (= 0 v_~x$r_buff1_thd2~0_177) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24|) 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= 0 v_~weak$$choice0~0_17) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= 0 v_~x$w_buff0_used~0_579) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35 0) (= v_~y~0_85 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t2000~0.offset_18|) (= 0 |v_~#x~0.offset_140|) (= v_~__unbuffered_p1_EAX$read_delayed~0_41 0) (= v_~main$tmp_guard1~0_32 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35 0) (= 0 v_~x$w_buff1_used~0_346) (= |v_#length_36| (store (store |v_#length_37| |v_~#x~0.base_140| 4) |v_ULTIMATE.start_main_~#t2000~0.base_24| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8) (= (store |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24| (store (select |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24|) |v_ULTIMATE.start_main_~#t2000~0.offset_18| 0)) |v_#memory_int_276|) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_140|) (= v_~x$r_buff1_thd0~0_55 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_277|, #length=|v_#length_37|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_26|, ~x$w_buff0~0=v_~x$w_buff0~0_96, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_10|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_56, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_59|, ~weak$$choice1~0=v_~weak$$choice1~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35, #length=|v_#length_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_92, ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_26|, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_140|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_169|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_177, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_46|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_41, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_43|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_58, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_39, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_17|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t2000~0.base=|v_ULTIMATE.start_main_~#t2000~0.base_24|, ~y~0=v_~y~0_85, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_149|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_20|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_55, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_31|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_21|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_276|, ~#x~0.base=|v_~#x~0.base_140|, ~weak$$choice2~0=v_~weak$$choice2~0_98, ULTIMATE.start_main_~#t2000~0.offset=|v_ULTIMATE.start_main_~#t2000~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet51, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite64, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem54, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~__unbuffered_p1_EAX$w_buff1_used~0, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet52, ~__unbuffered_p1_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem62, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2002~0.offset, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t2000~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite57, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2001~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2001~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX$w_buff0_used~0, ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t2000~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:37:59,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t2001~0.offset_10| 0) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11|) 0) (= (store |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11| (store (select |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11|) |v_ULTIMATE.start_main_~#t2001~0.offset_10| 1)) |v_#memory_int_138|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2001~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2001~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2001~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_139|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_138|, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet51, #valid, #memory_int, ULTIMATE.start_main_~#t2001~0.offset, #length, ULTIMATE.start_main_~#t2001~0.base] because there is no mapped edge [2019-12-27 03:37:59,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L827-1-->L829: Formula: (and (= |v_ULTIMATE.start_main_~#t2002~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2002~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2002~0.base_13|) (= (store |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13| (store (select |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13|) |v_ULTIMATE.start_main_~#t2002~0.offset_11| 2)) |v_#memory_int_202|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13|) 0) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2002~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_203|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~nondet52, #valid, #memory_int, ULTIMATE.start_main_~#t2002~0.offset, #length] because there is no mapped edge [2019-12-27 03:37:59,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L769-->L770: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-364069877 256) 0)) (.cse0 (= ~x$w_buff0~0_Out-364069877 ~x$w_buff0~0_In-364069877))) (or (let ((.cse2 (not (= 0 (mod ~x$r_buff0_thd2~0_In-364069877 256))))) (and (not (= 0 (mod ~x$w_buff0_used~0_In-364069877 256))) .cse0 .cse1 (or .cse2 (not (= (mod ~x$w_buff1_used~0_In-364069877 256) 0))) (or (not (= 0 (mod ~x$r_buff1_thd2~0_In-364069877 256))) .cse2))) (and (not .cse1) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-364069877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-364069877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-364069877, ~weak$$choice2~0=~weak$$choice2~0_In-364069877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-364069877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364069877} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-364069877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-364069877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-364069877, P1Thread1of1ForFork0_#t~ite16=|P1Thread1of1ForFork0_#t~ite16_Out-364069877|, ~weak$$choice2~0=~weak$$choice2~0_In-364069877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-364069877, P1Thread1of1ForFork0_#t~ite18=|P1Thread1of1ForFork0_#t~ite18_Out-364069877|, P1Thread1of1ForFork0_#t~ite17=|P1Thread1of1ForFork0_#t~ite17_Out-364069877|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-364069877} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite18, P1Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-27 03:37:59,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L770-->L771: Formula: (and (= v_~x$w_buff1~0_31 v_~x$w_buff1~0_30) (not (= 0 (mod v_~weak$$choice2~0_25 256)))) InVars {~x$w_buff1~0=v_~x$w_buff1~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork0_#t~ite19=|v_P1Thread1of1ForFork0_#t~ite19_12|, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_11|, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_9|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite19, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~x$w_buff1~0] because there is no mapped edge [2019-12-27 03:37:59,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L771-->L771-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In363831369 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite23_In363831369| |P1Thread1of1ForFork0_#t~ite23_Out363831369|) (not .cse0) (= ~x$w_buff0_used~0_In363831369 |P1Thread1of1ForFork0_#t~ite24_Out363831369|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In363831369 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In363831369 256))) (= 0 (mod ~x$w_buff0_used~0_In363831369 256)) (and (= (mod ~x$w_buff1_used~0_In363831369 256) 0) .cse1))) (= ~x$w_buff0_used~0_In363831369 |P1Thread1of1ForFork0_#t~ite23_Out363831369|) (= |P1Thread1of1ForFork0_#t~ite24_Out363831369| |P1Thread1of1ForFork0_#t~ite23_Out363831369|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In363831369, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In363831369, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_In363831369|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In363831369, ~weak$$choice2~0=~weak$$choice2~0_In363831369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363831369} OutVars{P1Thread1of1ForFork0_#t~ite24=|P1Thread1of1ForFork0_#t~ite24_Out363831369|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363831369, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In363831369, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_Out363831369|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In363831369, ~weak$$choice2~0=~weak$$choice2~0_In363831369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363831369} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite24, P1Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 03:37:59,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L773-->L774: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1693299632 256))) (.cse0 (= ~x$r_buff0_thd2~0_In1693299632 ~x$r_buff0_thd2~0_Out1693299632))) (or (and .cse0 (not .cse1)) (and .cse1 .cse0 (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1693299632 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1693299632 256)) (and .cse2 (= (mod ~x$w_buff1_used~0_In1693299632 256) 0)) (and .cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1693299632 256)))))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1693299632, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1693299632, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1693299632, ~weak$$choice2~0=~weak$$choice2~0_In1693299632, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1693299632} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1693299632|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693299632, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1693299632, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1693299632, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1693299632|, ~weak$$choice2~0=~weak$$choice2~0_In1693299632, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1693299632|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1693299632} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:37:59,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L774-->L778: Formula: (and (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12 |v_~#x~0.base_41|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12 |v_~#x~0.offset_41|) (= (select (select |v_#memory_int_75| |v_~#x~0.base_41|) |v_~#x~0.offset_41|) v_~__unbuffered_p1_EAX~0_17) (= v_~x$r_buff1_thd2~0_56 v_~x$r_buff1_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~__unbuffered_p1_EAX$read_delayed~0_13 1)) InVars {~#x~0.offset=|v_~#x~0.offset_41|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~#x~0.offset=|v_~#x~0.offset_41|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_13, P1Thread1of1ForFork0_#t~mem34=|v_P1Thread1of1ForFork0_#t~mem34_8|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, P1Thread1of1ForFork0_#t~ite33=|v_P1Thread1of1ForFork0_#t~ite33_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_12|, P1Thread1of1ForFork0_#t~ite32=|v_P1Thread1of1ForFork0_#t~ite32_15|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~mem34, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-27 03:37:59,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L778-->L785: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_46| |v_~#x~0.base_27| (store (select |v_#memory_int_46| |v_~#x~0.base_27|) |v_~#x~0.offset_27| v_~x$mem_tmp~0_4)) |v_#memory_int_45|) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= v_~y~0_10 1)) InVars {~#x~0.offset=|v_~#x~0.offset_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_46|, ~#x~0.base=|v_~#x~0.base_27|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_27|, P1Thread1of1ForFork0_#t~mem35=|v_P1Thread1of1ForFork0_#t~mem35_5|, #memory_int=|v_#memory_int_45|, ~#x~0.base=|v_~#x~0.base_27|, P1Thread1of1ForFork0_#t~ite36=|v_P1Thread1of1ForFork0_#t~ite36_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork0_#t~mem35, #memory_int, P1Thread1of1ForFork0_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 03:37:59,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L785-2-->L785-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite38_Out-1119509595| |P1Thread1of1ForFork0_#t~ite39_Out-1119509595|)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1119509595 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1119509595 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite38_Out-1119509595| ~x$w_buff1~0_In-1119509595) .cse1 (not .cse2) (= |P1Thread1of1ForFork0_#t~mem37_In-1119509595| |P1Thread1of1ForFork0_#t~mem37_Out-1119509595|)) (and .cse1 (= (select (select |#memory_int_In-1119509595| |~#x~0.base_In-1119509595|) |~#x~0.offset_In-1119509595|) |P1Thread1of1ForFork0_#t~mem37_Out-1119509595|) (or .cse2 .cse0) (= |P1Thread1of1ForFork0_#t~ite38_Out-1119509595| |P1Thread1of1ForFork0_#t~mem37_Out-1119509595|)))) InVars {P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_In-1119509595|, ~#x~0.offset=|~#x~0.offset_In-1119509595|, ~x$w_buff1~0=~x$w_buff1~0_In-1119509595, ~#x~0.base=|~#x~0.base_In-1119509595|, #memory_int=|#memory_int_In-1119509595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1119509595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1119509595} OutVars{P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_Out-1119509595|, ~#x~0.offset=|~#x~0.offset_In-1119509595|, ~x$w_buff1~0=~x$w_buff1~0_In-1119509595, ~#x~0.base=|~#x~0.base_In-1119509595|, #memory_int=|#memory_int_In-1119509595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1119509595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1119509595, P1Thread1of1ForFork0_#t~ite39=|P1Thread1of1ForFork0_#t~ite39_Out-1119509595|, P1Thread1of1ForFork0_#t~ite38=|P1Thread1of1ForFork0_#t~ite38_Out-1119509595|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem37, P1Thread1of1ForFork0_#t~ite39, P1Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 03:37:59,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-728144729 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-728144729 256)))) (or (and (= |P2Thread1of1ForFork1_#t~mem44_In-728144729| |P2Thread1of1ForFork1_#t~mem44_Out-728144729|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite45_Out-728144729| ~x$w_buff1~0_In-728144729) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~mem44_Out-728144729| (select (select |#memory_int_In-728144729| |~#x~0.base_In-728144729|) |~#x~0.offset_In-728144729|)) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~mem44_Out-728144729| |P2Thread1of1ForFork1_#t~ite45_Out-728144729|)))) InVars {~#x~0.offset=|~#x~0.offset_In-728144729|, ~x$w_buff1~0=~x$w_buff1~0_In-728144729, ~#x~0.base=|~#x~0.base_In-728144729|, #memory_int=|#memory_int_In-728144729|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-728144729, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-728144729, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_In-728144729|} OutVars{~#x~0.offset=|~#x~0.offset_In-728144729|, P2Thread1of1ForFork1_#t~ite45=|P2Thread1of1ForFork1_#t~ite45_Out-728144729|, ~x$w_buff1~0=~x$w_buff1~0_In-728144729, ~#x~0.base=|~#x~0.base_In-728144729|, #memory_int=|#memory_int_In-728144729|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-728144729, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-728144729, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_Out-728144729|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite45, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-27 03:37:59,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-181270174 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-181270174 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite40_Out-181270174| ~x$w_buff0_used~0_In-181270174) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite40_Out-181270174| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-181270174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-181270174} OutVars{P1Thread1of1ForFork0_#t~ite40=|P1Thread1of1ForFork0_#t~ite40_Out-181270174|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-181270174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-181270174} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 03:37:59,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-600915092 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-600915092 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-600915092 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-600915092 256)))) (or (and (= ~x$w_buff1_used~0_In-600915092 |P1Thread1of1ForFork0_#t~ite41_Out-600915092|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite41_Out-600915092|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-600915092, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-600915092, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-600915092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-600915092} OutVars{P1Thread1of1ForFork0_#t~ite41=|P1Thread1of1ForFork0_#t~ite41_Out-600915092|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-600915092, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-600915092, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-600915092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-600915092} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 03:37:59,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1134667855 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1134667855 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1134667855 ~x$r_buff0_thd2~0_In-1134667855)) (and (= ~x$r_buff0_thd2~0_Out-1134667855 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1134667855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1134667855} OutVars{P1Thread1of1ForFork0_#t~ite42=|P1Thread1of1ForFork0_#t~ite42_Out-1134667855|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1134667855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1134667855} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite42, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:37:59,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1321677758 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1321677758 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1321677758 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1321677758 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1321677758 |P1Thread1of1ForFork0_#t~ite43_Out-1321677758|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite43_Out-1321677758|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1321677758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1321677758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1321677758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321677758} OutVars{P1Thread1of1ForFork0_#t~ite43=|P1Thread1of1ForFork0_#t~ite43_Out-1321677758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1321677758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1321677758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1321677758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1321677758} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 03:37:59,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork0_#t~ite43_32|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:37:59,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L750-2-->L750-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork2_#t~ite5_Out1522798897| |P0Thread1of1ForFork2_#t~ite4_Out1522798897|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1522798897 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1522798897 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~mem3_In1522798897| |P0Thread1of1ForFork2_#t~mem3_Out1522798897|) (not .cse1) (not .cse2) (= ~x$w_buff1~0_In1522798897 |P0Thread1of1ForFork2_#t~ite4_Out1522798897|)) (and .cse0 (= (select (select |#memory_int_In1522798897| |~#x~0.base_In1522798897|) |~#x~0.offset_In1522798897|) |P0Thread1of1ForFork2_#t~mem3_Out1522798897|) (or .cse2 .cse1) (= |P0Thread1of1ForFork2_#t~ite4_Out1522798897| |P0Thread1of1ForFork2_#t~mem3_Out1522798897|)))) InVars {P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_In1522798897|, ~#x~0.offset=|~#x~0.offset_In1522798897|, ~x$w_buff1~0=~x$w_buff1~0_In1522798897, ~#x~0.base=|~#x~0.base_In1522798897|, #memory_int=|#memory_int_In1522798897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522798897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1522798897} OutVars{P0Thread1of1ForFork2_#t~ite4=|P0Thread1of1ForFork2_#t~ite4_Out1522798897|, P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_Out1522798897|, ~#x~0.offset=|~#x~0.offset_In1522798897|, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1522798897|, ~x$w_buff1~0=~x$w_buff1~0_In1522798897, ~#x~0.base=|~#x~0.base_In1522798897|, #memory_int=|#memory_int_In1522798897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522798897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1522798897} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite4, P0Thread1of1ForFork2_#t~mem3, P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:37:59,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-988259342 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-988259342 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-988259342| ~x$w_buff0_used~0_In-988259342)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-988259342|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-988259342, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-988259342} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-988259342, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-988259342|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-988259342} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:37:59,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1964111477 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1964111477 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1964111477 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1964111477 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out1964111477| ~x$w_buff1_used~0_In1964111477) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite7_Out1964111477| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1964111477, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1964111477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1964111477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1964111477} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1964111477, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1964111477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1964111477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1964111477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1964111477} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:37:59,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L753-->L754: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1879486890 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1879486890 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out-1879486890 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out-1879486890 ~x$r_buff0_thd1~0_In-1879486890)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1879486890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1879486890} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1879486890, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1879486890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1879486890} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:37:59,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [892] [892] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1949634239 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1949634239 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1949634239 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1949634239 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite9_Out1949634239| ~x$r_buff1_thd1~0_In1949634239)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork2_#t~ite9_Out1949634239| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1949634239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1949634239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1949634239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949634239} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1949634239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1949634239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1949634239, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1949634239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949634239} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 03:37:59,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite9_24| v_~x$r_buff1_thd1~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_24|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_34, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 03:37:59,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L802-4-->L803: Formula: (= (store |v_#memory_int_71| |v_~#x~0.base_39| (store (select |v_#memory_int_71| |v_~#x~0.base_39|) |v_~#x~0.offset_39| |v_P2Thread1of1ForFork1_#t~ite45_10|)) |v_#memory_int_70|) InVars {~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_10|, #memory_int=|v_#memory_int_71|, ~#x~0.base=|v_~#x~0.base_39|} OutVars{P2Thread1of1ForFork1_#t~ite46=|v_P2Thread1of1ForFork1_#t~ite46_13|, ~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_9|, #memory_int=|v_#memory_int_70|, ~#x~0.base=|v_~#x~0.base_39|, P2Thread1of1ForFork1_#t~mem44=|v_P2Thread1of1ForFork1_#t~mem44_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite46, P2Thread1of1ForFork1_#t~ite45, #memory_int, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-27 03:37:59,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In388838575 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In388838575 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite47_Out388838575| ~x$w_buff0_used~0_In388838575)) (and (= |P2Thread1of1ForFork1_#t~ite47_Out388838575| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In388838575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388838575} OutVars{P2Thread1of1ForFork1_#t~ite47=|P2Thread1of1ForFork1_#t~ite47_Out388838575|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In388838575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388838575} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite47] because there is no mapped edge [2019-12-27 03:37:59,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-354779978 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-354779978 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-354779978 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-354779978 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite48_Out-354779978|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-354779978 |P2Thread1of1ForFork1_#t~ite48_Out-354779978|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-354779978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-354779978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-354779978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354779978} OutVars{P2Thread1of1ForFork1_#t~ite48=|P2Thread1of1ForFork1_#t~ite48_Out-354779978|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-354779978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-354779978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-354779978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354779978} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 03:37:59,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L805-->L806: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1024194431 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1024194431 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_Out-1024194431 ~x$r_buff0_thd3~0_In-1024194431)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd3~0_Out-1024194431)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1024194431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1024194431} OutVars{P2Thread1of1ForFork1_#t~ite49=|P2Thread1of1ForFork1_#t~ite49_Out-1024194431|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out-1024194431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1024194431} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite49, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 03:37:59,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1735479452 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1735479452 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1735479452 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1735479452 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In-1735479452 |P2Thread1of1ForFork1_#t~ite50_Out-1735479452|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite50_Out-1735479452| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1735479452, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1735479452, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1735479452, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1735479452} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1735479452, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1735479452, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1735479452, P2Thread1of1ForFork1_#t~ite50=|P2Thread1of1ForFork1_#t~ite50_Out-1735479452|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1735479452} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite50] because there is no mapped edge [2019-12-27 03:37:59,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L806-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_49 |v_P2Thread1of1ForFork1_#t~ite50_42|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite50, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:37:59,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L833-->L835-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_22 256)) (= 0 (mod v_~x$w_buff0_used~0_133 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:37:59,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1346707456 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1346707456 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem54_Out-1346707456| |ULTIMATE.start_main_#t~ite55_Out-1346707456|) (= (select (select |#memory_int_In-1346707456| |~#x~0.base_In-1346707456|) |~#x~0.offset_In-1346707456|) |ULTIMATE.start_main_#t~mem54_Out-1346707456|)) (and (= |ULTIMATE.start_main_#t~ite55_Out-1346707456| ~x$w_buff1~0_In-1346707456) (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~mem54_In-1346707456| |ULTIMATE.start_main_#t~mem54_Out-1346707456|)))) InVars {ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_In-1346707456|, ~#x~0.offset=|~#x~0.offset_In-1346707456|, ~x$w_buff1~0=~x$w_buff1~0_In-1346707456, ~#x~0.base=|~#x~0.base_In-1346707456|, #memory_int=|#memory_int_In-1346707456|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1346707456, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1346707456} OutVars{ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_Out-1346707456|, ~#x~0.offset=|~#x~0.offset_In-1346707456|, ~x$w_buff1~0=~x$w_buff1~0_In-1346707456, ~#x~0.base=|~#x~0.base_In-1346707456|, #memory_int=|#memory_int_In-1346707456|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1346707456, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1346707456, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-1346707456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-27 03:37:59,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L835-4-->L836: Formula: (= (store |v_#memory_int_79| |v_~#x~0.base_42| (store (select |v_#memory_int_79| |v_~#x~0.base_42|) |v_~#x~0.offset_42| |v_ULTIMATE.start_main_#t~ite55_8|)) |v_#memory_int_78|) InVars {~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_79|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_8|} OutVars{ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_5|, ~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_8|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, #memory_int, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-27 03:37:59,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-28061952 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-28061952 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite57_Out-28061952|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-28061952 |ULTIMATE.start_main_#t~ite57_Out-28061952|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28061952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28061952} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28061952, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-28061952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28061952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 03:37:59,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In996755975 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In996755975 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In996755975 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In996755975 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite58_Out996755975| ~x$w_buff1_used~0_In996755975) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite58_Out996755975| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In996755975, ~x$w_buff1_used~0=~x$w_buff1_used~0_In996755975, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In996755975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In996755975} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In996755975, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out996755975|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In996755975, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In996755975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In996755975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-27 03:37:59,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L838-->L839: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-672742980 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-672742980 256)))) (or (and (= ~x$r_buff0_thd0~0_Out-672742980 ~x$r_buff0_thd0~0_In-672742980) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd0~0_Out-672742980 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-672742980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672742980} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-672742980, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-672742980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672742980} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 03:37:59,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-->L843: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In811517685 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In811517685 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In811517685 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In811517685 256) 0)) (.cse4 (= ~weak$$choice1~0_Out811517685 |ULTIMATE.start_main_#t~nondet61_In811517685|))) (or (and (= ~x$r_buff1_thd0~0_In811517685 ~x$r_buff1_thd0~0_Out811517685) (or .cse0 .cse1) (or .cse2 .cse3) .cse4) (and (= ~x$r_buff1_thd0~0_Out811517685 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) .cse4))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In811517685, ~x$w_buff1_used~0=~x$w_buff1_used~0_In811517685, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In811517685, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_In811517685|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In811517685} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In811517685, ~weak$$choice1~0=~weak$$choice1~0_Out811517685, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out811517685|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In811517685, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out811517685, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_Out811517685|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In811517685} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite60, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 03:37:59,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L843-->L843-3: Formula: (let ((.cse0 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In-999246344 256)))) (.cse1 (= 0 (mod ~weak$$choice1~0_In-999246344 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem62_Out-999246344| |ULTIMATE.start_main_#t~ite63_Out-999246344|) (= (select (select |#memory_int_In-999246344| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-999246344) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-999246344) |ULTIMATE.start_main_#t~mem62_Out-999246344|) (not .cse1)) (and .cse0 (= |ULTIMATE.start_main_#t~mem62_In-999246344| |ULTIMATE.start_main_#t~mem62_Out-999246344|) (= ~__unbuffered_p1_EAX~0_In-999246344 |ULTIMATE.start_main_#t~ite63_Out-999246344|) .cse1))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-999246344, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-999246344, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-999246344, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_In-999246344|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-999246344, #memory_int=|#memory_int_In-999246344|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-999246344} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-999246344|, ~weak$$choice1~0=~weak$$choice1~0_In-999246344, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-999246344, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-999246344, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_Out-999246344|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-999246344, #memory_int=|#memory_int_In-999246344|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-999246344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~mem62] because there is no mapped edge [2019-12-27 03:37:59,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L843-3-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (let ((.cse0 (= 2 v_~__unbuffered_p0_EAX~0_31)) (.cse1 (= 1 v_~__unbuffered_p1_EAX~0_27)) (.cse2 (= v_~y~0_36 2))) (or (and (= v_~main$tmp_guard1~0_17 0) .cse0 .cse1 .cse2) (and (= v_~main$tmp_guard1~0_17 1) (or (not .cse0) (not .cse1) (not .cse2))))) (= |v_ULTIMATE.start_main_#t~ite63_28| v_~__unbuffered_p1_EAX~0_27)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~y~0=v_~y~0_36} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem62, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:37:59,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:37:59,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:37:59 BasicIcfg [2019-12-27 03:37:59,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:37:59,392 INFO L168 Benchmark]: Toolchain (without parser) took 50347.89 ms. Allocated memory was 140.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 103.3 MB in the beginning and 1.1 GB in the end (delta: -976.5 MB). Peak memory consumption was 914.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,393 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.24 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 102.9 MB in the beginning and 155.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.41 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,396 INFO L168 Benchmark]: Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,396 INFO L168 Benchmark]: RCFGBuilder took 1044.95 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 95.5 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,397 INFO L168 Benchmark]: TraceAbstraction took 48432.16 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 95.5 MB in the beginning and 1.1 GB in the end (delta: -984.3 MB). Peak memory consumption was 843.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:37:59,405 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.74 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.24 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 102.9 MB in the beginning and 155.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.41 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1044.95 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 95.5 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48432.16 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 95.5 MB in the beginning and 1.1 GB in the end (delta: -984.3 MB). Peak memory consumption was 843.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 192 ProgramPointsBefore, 86 ProgramPointsAfterwards, 230 TransitionsBefore, 95 TransitionsAfterwards, 19530 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 33 ChoiceCompositions, 7748 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 222 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 80972 CheckedPairsTotal, 145 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L827] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L829] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 \read(x) [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, 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] [L768] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, 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] [L772] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 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_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=1] [L799] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L785] 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) [L802] 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_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L744] 1 __unbuffered_p0_EAX = y [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\read(x)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=1, y=2] [L750] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 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 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 183 locations, 1 error locations. Result: UNSAFE, OverallTime: 48.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2891 SDtfs, 3818 SDslu, 6258 SDs, 0 SdLazy, 5259 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 53 SyntacticMatches, 26 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88334occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 50536 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1105 NumberOfCodeBlocks, 1105 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 154928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...