/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:48:56,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:48:56,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:48:56,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:48:56,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:48:56,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:48:56,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:48:56,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:48:56,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:48:56,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:48:56,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:48:56,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:48:56,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:48:56,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:48:56,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:48:56,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:48:56,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:48:56,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:48:56,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:48:56,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:48:56,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:48:56,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:48:56,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:48:56,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:48:56,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:48:56,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:48:56,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:48:56,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:48:56,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:48:56,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:48:56,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:48:56,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:48:56,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:48:56,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:48:56,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:48:56,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:48:56,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:48:56,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:48:56,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:48:56,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:48:56,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:48:56,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:48:56,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:48:56,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:48:56,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:48:56,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:48:56,883 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:48:56,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:48:56,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:48:56,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:48:56,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:48:56,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:48:56,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:48:56,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:48:56,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:48:56,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:48:56,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:48:56,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:48:56,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:56,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:48:56,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:48:56,887 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:48:56,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:48:57,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:48:57,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:48:57,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:48:57,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:48:57,172 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:48:57,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-27 16:48:57,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730c04d9/9f8b4fb95d8642968d836959dc3a2a97/FLAG86424b3bc [2019-12-27 16:48:57,781 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:48:57,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-27 16:48:57,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730c04d9/9f8b4fb95d8642968d836959dc3a2a97/FLAG86424b3bc [2019-12-27 16:48:58,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730c04d9/9f8b4fb95d8642968d836959dc3a2a97 [2019-12-27 16:48:58,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:48:58,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:48:58,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:58,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:48:58,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:48:58,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58, skipping insertion in model container [2019-12-27 16:48:58,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:48:58,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:48:58,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:58,693 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:48:58,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:58,855 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:48:58,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58 WrapperNode [2019-12-27 16:48:58,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:58,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:58,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:48:58,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:48:58,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:58,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:48:58,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:48:58,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:48:58,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (1/1) ... [2019-12-27 16:48:58,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:48:58,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:48:58,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:48:58,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:48:58,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (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 16:48:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:48:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:48:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:48:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:48:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:48:59,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:48:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:48:59,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:48:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:48:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:48:59,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:48:59,065 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 16:48:59,742 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:48:59,742 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:48:59,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:59 BoogieIcfgContainer [2019-12-27 16:48:59,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:48:59,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:48:59,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:48:59,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:48:59,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:48:58" (1/3) ... [2019-12-27 16:48:59,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33914adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:59, skipping insertion in model container [2019-12-27 16:48:59,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:58" (2/3) ... [2019-12-27 16:48:59,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33914adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:59, skipping insertion in model container [2019-12-27 16:48:59,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:59" (3/3) ... [2019-12-27 16:48:59,753 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.opt.i [2019-12-27 16:48:59,764 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:48:59,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:48:59,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:48:59,774 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:48:59,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,814 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:59,896 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:48:59,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:48:59,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:48:59,915 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:48:59,916 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:48:59,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:48:59,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:48:59,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:48:59,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:48:59,942 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 16:48:59,944 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 16:49:00,056 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 16:49:00,056 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:00,070 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:49:00,085 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 16:49:00,166 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 16:49:00,166 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:00,173 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:49:00,190 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 16:49:00,192 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:49:04,307 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 16:49:04,421 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 16:49:04,885 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 16:49:05,033 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:49:05,191 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45287 [2019-12-27 16:49:05,192 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 16:49:05,195 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 80 transitions [2019-12-27 16:49:05,566 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-27 16:49:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-27 16:49:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:49:05,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:05,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:49:05,577 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash 679710407, now seen corresponding path program 1 times [2019-12-27 16:49:05,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:05,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208387963] [2019-12-27 16:49:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:05,803 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 16:49:05,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208387963] [2019-12-27 16:49:05,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:05,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:05,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957479276] [2019-12-27 16:49:05,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:05,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:05,825 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:49:05,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:05,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:05,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:05,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:05,842 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-27 16:49:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,132 INFO L93 Difference]: Finished difference Result 6414 states and 21820 transitions. [2019-12-27 16:49:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:06,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:49:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,229 INFO L225 Difference]: With dead ends: 6414 [2019-12-27 16:49:06,229 INFO L226 Difference]: Without dead ends: 6042 [2019-12-27 16:49:06,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-27 16:49:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-27 16:49:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-27 16:49:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20517 transitions. [2019-12-27 16:49:06,628 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20517 transitions. Word has length 5 [2019-12-27 16:49:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:06,629 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20517 transitions. [2019-12-27 16:49:06,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20517 transitions. [2019-12-27 16:49:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:49:06,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:06,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:06,633 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 200851233, now seen corresponding path program 1 times [2019-12-27 16:49:06,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606567274] [2019-12-27 16:49:06,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:06,740 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 16:49:06,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606567274] [2019-12-27 16:49:06,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:06,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:06,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634689759] [2019-12-27 16:49:06,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:06,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:06,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:49:06,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:06,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:06,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:06,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:06,751 INFO L87 Difference]: Start difference. First operand 6042 states and 20517 transitions. Second operand 3 states. [2019-12-27 16:49:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:06,790 INFO L93 Difference]: Finished difference Result 1215 states and 3038 transitions. [2019-12-27 16:49:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:06,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:49:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:06,798 INFO L225 Difference]: With dead ends: 1215 [2019-12-27 16:49:06,799 INFO L226 Difference]: Without dead ends: 1215 [2019-12-27 16:49:06,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-27 16:49:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-27 16:49:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-27 16:49:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3038 transitions. [2019-12-27 16:49:06,834 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3038 transitions. Word has length 11 [2019-12-27 16:49:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:06,834 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3038 transitions. [2019-12-27 16:49:06,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3038 transitions. [2019-12-27 16:49:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:06,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:06,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:06,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:06,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1157318615, now seen corresponding path program 1 times [2019-12-27 16:49:06,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:06,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219597267] [2019-12-27 16:49:06,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:06,961 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 16:49:06,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219597267] [2019-12-27 16:49:06,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:06,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:06,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137160211] [2019-12-27 16:49:06,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:06,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:06,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:49:06,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:07,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:07,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:07,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:07,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:07,041 INFO L87 Difference]: Start difference. First operand 1215 states and 3038 transitions. Second operand 5 states. [2019-12-27 16:49:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:07,174 INFO L93 Difference]: Finished difference Result 1816 states and 4607 transitions. [2019-12-27 16:49:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:07,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:49:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:07,185 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 16:49:07,185 INFO L226 Difference]: Without dead ends: 1816 [2019-12-27 16:49:07,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-27 16:49:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1358. [2019-12-27 16:49:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-12-27 16:49:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3466 transitions. [2019-12-27 16:49:07,237 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3466 transitions. Word has length 14 [2019-12-27 16:49:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:07,237 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 3466 transitions. [2019-12-27 16:49:07,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3466 transitions. [2019-12-27 16:49:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:07,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:07,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:07,239 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1294893453, now seen corresponding path program 1 times [2019-12-27 16:49:07,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:07,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141545029] [2019-12-27 16:49:07,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:07,379 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 16:49:07,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141545029] [2019-12-27 16:49:07,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:07,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:07,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [428849649] [2019-12-27 16:49:07,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:07,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:07,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:49:07,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:07,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:07,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:07,419 INFO L87 Difference]: Start difference. First operand 1358 states and 3466 transitions. Second operand 5 states. [2019-12-27 16:49:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:07,641 INFO L93 Difference]: Finished difference Result 1779 states and 4379 transitions. [2019-12-27 16:49:07,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:07,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:49:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:07,652 INFO L225 Difference]: With dead ends: 1779 [2019-12-27 16:49:07,652 INFO L226 Difference]: Without dead ends: 1779 [2019-12-27 16:49:07,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-27 16:49:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1647. [2019-12-27 16:49:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-27 16:49:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4084 transitions. [2019-12-27 16:49:07,699 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 4084 transitions. Word has length 14 [2019-12-27 16:49:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:07,700 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 4084 transitions. [2019-12-27 16:49:07,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 4084 transitions. [2019-12-27 16:49:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:49:07,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:07,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:07,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1889466766, now seen corresponding path program 1 times [2019-12-27 16:49:07,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:07,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778549839] [2019-12-27 16:49:07,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:07,757 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 16:49:07,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778549839] [2019-12-27 16:49:07,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:07,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:07,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440112326] [2019-12-27 16:49:07,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:07,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:07,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:49:07,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:07,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:07,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:07,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:07,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:07,857 INFO L87 Difference]: Start difference. First operand 1647 states and 4084 transitions. Second operand 5 states. [2019-12-27 16:49:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:08,055 INFO L93 Difference]: Finished difference Result 2092 states and 5077 transitions. [2019-12-27 16:49:08,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:49:08,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:49:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:08,066 INFO L225 Difference]: With dead ends: 2092 [2019-12-27 16:49:08,067 INFO L226 Difference]: Without dead ends: 2092 [2019-12-27 16:49:08,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-27 16:49:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1708. [2019-12-27 16:49:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-12-27 16:49:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 4235 transitions. [2019-12-27 16:49:08,113 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 4235 transitions. Word has length 14 [2019-12-27 16:49:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:08,113 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 4235 transitions. [2019-12-27 16:49:08,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 4235 transitions. [2019-12-27 16:49:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:08,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:08,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:08,117 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2125431703, now seen corresponding path program 1 times [2019-12-27 16:49:08,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:08,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749097024] [2019-12-27 16:49:08,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:08,252 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 16:49:08,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749097024] [2019-12-27 16:49:08,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:08,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:49:08,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528520297] [2019-12-27 16:49:08,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:08,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:08,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:49:08,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:08,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:08,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:08,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:08,266 INFO L87 Difference]: Start difference. First operand 1708 states and 4235 transitions. Second operand 5 states. [2019-12-27 16:49:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:08,684 INFO L93 Difference]: Finished difference Result 2525 states and 6119 transitions. [2019-12-27 16:49:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:49:08,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:49:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:08,698 INFO L225 Difference]: With dead ends: 2525 [2019-12-27 16:49:08,699 INFO L226 Difference]: Without dead ends: 2525 [2019-12-27 16:49:08,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-12-27 16:49:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2074. [2019-12-27 16:49:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-27 16:49:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 5075 transitions. [2019-12-27 16:49:08,768 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 5075 transitions. Word has length 26 [2019-12-27 16:49:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:08,769 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 5075 transitions. [2019-12-27 16:49:08,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 5075 transitions. [2019-12-27 16:49:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:08,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:08,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:08,773 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2116463787, now seen corresponding path program 1 times [2019-12-27 16:49:08,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:08,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517062622] [2019-12-27 16:49:08,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:08,835 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 16:49:08,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517062622] [2019-12-27 16:49:08,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:08,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:08,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1112274613] [2019-12-27 16:49:08,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:08,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:08,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 16:49:08,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:08,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:49:08,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:08,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:08,883 INFO L87 Difference]: Start difference. First operand 2074 states and 5075 transitions. Second operand 5 states. [2019-12-27 16:49:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:08,962 INFO L93 Difference]: Finished difference Result 2628 states and 6059 transitions. [2019-12-27 16:49:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:08,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:49:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:08,987 INFO L225 Difference]: With dead ends: 2628 [2019-12-27 16:49:08,988 INFO L226 Difference]: Without dead ends: 2628 [2019-12-27 16:49:08,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2019-12-27 16:49:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 1998. [2019-12-27 16:49:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 16:49:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4533 transitions. [2019-12-27 16:49:09,047 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4533 transitions. Word has length 26 [2019-12-27 16:49:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:09,048 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4533 transitions. [2019-12-27 16:49:09,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4533 transitions. [2019-12-27 16:49:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:49:09,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:09,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:09,052 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 474142059, now seen corresponding path program 1 times [2019-12-27 16:49:09,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:09,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074660892] [2019-12-27 16:49:09,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:09,116 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 16:49:09,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074660892] [2019-12-27 16:49:09,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:09,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:09,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635317227] [2019-12-27 16:49:09,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:09,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:09,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 16:49:09,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:09,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:49:09,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:49:09,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:09,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:49:09,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:09,152 INFO L87 Difference]: Start difference. First operand 1998 states and 4533 transitions. Second operand 5 states. [2019-12-27 16:49:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:09,179 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-27 16:49:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:49:09,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:49:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:09,183 INFO L225 Difference]: With dead ends: 1020 [2019-12-27 16:49:09,183 INFO L226 Difference]: Without dead ends: 1020 [2019-12-27 16:49:09,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:49:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-27 16:49:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-27 16:49:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-27 16:49:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-27 16:49:09,207 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-27 16:49:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:09,208 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-27 16:49:09,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:49:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-27 16:49:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:49:09,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:09,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:09,259 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1317237189, now seen corresponding path program 1 times [2019-12-27 16:49:09,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:09,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815285336] [2019-12-27 16:49:09,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:09,342 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 16:49:09,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815285336] [2019-12-27 16:49:09,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:09,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:49:09,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896676336] [2019-12-27 16:49:09,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:09,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:09,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 137 transitions. [2019-12-27 16:49:09,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:09,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:09,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:49:09,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:49:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:49:09,415 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 9 states. [2019-12-27 16:49:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:10,529 INFO L93 Difference]: Finished difference Result 4119 states and 8393 transitions. [2019-12-27 16:49:10,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 16:49:10,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 16:49:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:10,537 INFO L225 Difference]: With dead ends: 4119 [2019-12-27 16:49:10,537 INFO L226 Difference]: Without dead ends: 2768 [2019-12-27 16:49:10,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-12-27 16:49:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2019-12-27 16:49:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 999. [2019-12-27 16:49:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 16:49:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-27 16:49:10,568 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-27 16:49:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:10,569 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-27 16:49:10,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:49:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-27 16:49:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:49:10,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:10,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:10,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2142063769, now seen corresponding path program 2 times [2019-12-27 16:49:10,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:10,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255905219] [2019-12-27 16:49:10,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:10,629 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 16:49:10,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255905219] [2019-12-27 16:49:10,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:10,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:49:10,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971373101] [2019-12-27 16:49:10,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:10,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:10,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 79 transitions. [2019-12-27 16:49:10,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:10,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:49:10,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:49:10,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:49:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:49:10,754 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 7 states. [2019-12-27 16:49:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:10,871 INFO L93 Difference]: Finished difference Result 1826 states and 3774 transitions. [2019-12-27 16:49:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:49:10,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:49:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:10,874 INFO L225 Difference]: With dead ends: 1826 [2019-12-27 16:49:10,874 INFO L226 Difference]: Without dead ends: 835 [2019-12-27 16:49:10,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:49:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-27 16:49:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 727. [2019-12-27 16:49:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-27 16:49:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1499 transitions. [2019-12-27 16:49:10,891 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1499 transitions. Word has length 41 [2019-12-27 16:49:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:10,891 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1499 transitions. [2019-12-27 16:49:10,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:49:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1499 transitions. [2019-12-27 16:49:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:49:10,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:10,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:10,898 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 845117651, now seen corresponding path program 3 times [2019-12-27 16:49:10,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:10,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981999264] [2019-12-27 16:49:10,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:11,016 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 16:49:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981999264] [2019-12-27 16:49:11,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:11,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:49:11,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680694555] [2019-12-27 16:49:11,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:11,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:11,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 137 transitions. [2019-12-27 16:49:11,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:11,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:49:11,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:49:11,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:49:11,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:49:11,064 INFO L87 Difference]: Start difference. First operand 727 states and 1499 transitions. Second operand 7 states. [2019-12-27 16:49:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:11,242 INFO L93 Difference]: Finished difference Result 1196 states and 2405 transitions. [2019-12-27 16:49:11,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:49:11,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:49:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:11,245 INFO L225 Difference]: With dead ends: 1196 [2019-12-27 16:49:11,245 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 16:49:11,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:49:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 16:49:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2019-12-27 16:49:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-27 16:49:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1473 transitions. [2019-12-27 16:49:11,259 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1473 transitions. Word has length 41 [2019-12-27 16:49:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:11,260 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1473 transitions. [2019-12-27 16:49:11,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:49:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1473 transitions. [2019-12-27 16:49:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:49:11,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:11,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:11,262 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash -624248203, now seen corresponding path program 4 times [2019-12-27 16:49:11,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:11,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067877001] [2019-12-27 16:49:11,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:11,338 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 16:49:11,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067877001] [2019-12-27 16:49:11,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:11,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:49:11,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691210148] [2019-12-27 16:49:11,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:11,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:11,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 146 transitions. [2019-12-27 16:49:11,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:11,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:49:11,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:49:11,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:49:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:49:11,420 INFO L87 Difference]: Start difference. First operand 715 states and 1473 transitions. Second operand 6 states. [2019-12-27 16:49:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:11,830 INFO L93 Difference]: Finished difference Result 840 states and 1706 transitions. [2019-12-27 16:49:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:49:11,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:49:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:11,833 INFO L225 Difference]: With dead ends: 840 [2019-12-27 16:49:11,834 INFO L226 Difference]: Without dead ends: 840 [2019-12-27 16:49:11,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:49:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-12-27 16:49:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2019-12-27 16:49:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-27 16:49:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1528 transitions. [2019-12-27 16:49:11,849 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1528 transitions. Word has length 41 [2019-12-27 16:49:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:11,850 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1528 transitions. [2019-12-27 16:49:11,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:49:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1528 transitions. [2019-12-27 16:49:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:49:11,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:11,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:49:11,853 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash -723073613, now seen corresponding path program 5 times [2019-12-27 16:49:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:11,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851238598] [2019-12-27 16:49:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:11,970 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 16:49:11,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851238598] [2019-12-27 16:49:11,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:11,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:49:11,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508792897] [2019-12-27 16:49:11,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:11,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:12,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 106 transitions. [2019-12-27 16:49:12,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:12,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:12,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:12,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:12,012 INFO L87 Difference]: Start difference. First operand 745 states and 1528 transitions. Second operand 3 states. [2019-12-27 16:49:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:12,024 INFO L93 Difference]: Finished difference Result 743 states and 1523 transitions. [2019-12-27 16:49:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:12,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:49:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:12,026 INFO L225 Difference]: With dead ends: 743 [2019-12-27 16:49:12,027 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 16:49:12,027 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 16:49:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 16:49:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 607. [2019-12-27 16:49:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-27 16:49:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-27 16:49:12,039 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 41 [2019-12-27 16:49:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:49:12,039 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-27 16:49:12,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:49:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-27 16:49:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:49:12,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:12,041 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] [2019-12-27 16:49:12,042 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 416077471, now seen corresponding path program 1 times [2019-12-27 16:49:12,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:12,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906828260] [2019-12-27 16:49:12,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:49:12,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:49:12,193 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:49:12,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t911~0.base_31| 1)) (= 0 v_~__unbuffered_cnt~0_92) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~x$r_buff1_thd0~0_197 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t911~0.base_31|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t911~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t911~0.base_31|) |v_ULTIMATE.start_main_~#t911~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t911~0.base_31|) 0) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= 0 |v_ULTIMATE.start_main_~#t911~0.offset_23|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t911~0.base_31| 4)) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t912~0.offset=|v_ULTIMATE.start_main_~#t912~0.offset_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t912~0.base=|v_ULTIMATE.start_main_~#t912~0.base_28|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_~#t911~0.base=|v_ULTIMATE.start_main_~#t911~0.base_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_~#t911~0.offset=|v_ULTIMATE.start_main_~#t911~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t912~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t912~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t911~0.base, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t911~0.offset, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 16:49:12,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t912~0.offset_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t912~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t912~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t912~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t912~0.base_12|) |v_ULTIMATE.start_main_~#t912~0.offset_11| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t912~0.base_12|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t912~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t912~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t912~0.offset=|v_ULTIMATE.start_main_~#t912~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t912~0.base=|v_ULTIMATE.start_main_~#t912~0.base_12|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t912~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t912~0.base, #length] because there is no mapped edge [2019-12-27 16:49:12,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= 1 v_~x$w_buff0_used~0_94) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= 1 v_~x$w_buff0~0_49) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (mod v_~x$w_buff1_used~0_53 256) 0) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 16:49:12,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1900248643 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1900248643 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1900248643| ~x$w_buff0_used~0_In-1900248643) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1900248643| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900248643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900248643} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900248643, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1900248643|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900248643} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 16:49:12,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1681859236 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1681859236 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1681859236 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1681859236 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1681859236|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1681859236 |P1Thread1of1ForFork0_#t~ite29_Out-1681859236|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1681859236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1681859236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1681859236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1681859236} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1681859236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1681859236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1681859236, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1681859236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1681859236} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:49:12,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1837271832 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1837271832 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1837271832 ~x$r_buff0_thd2~0_Out-1837271832)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1837271832) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1837271832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837271832} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1837271832|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1837271832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837271832} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:49:12,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1140499123 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1140499123 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1140499123 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1140499123 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1140499123| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out-1140499123| ~x$r_buff1_thd2~0_In-1140499123) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1140499123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1140499123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1140499123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1140499123} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1140499123|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1140499123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1140499123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1140499123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1140499123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:49:12,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 16:49:12,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 16:49:12,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 16:49:12,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:49:12,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1552566373 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1552566373 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out1552566373| ~x$w_buff1~0_In1552566373)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out1552566373| ~x~0_In1552566373)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1552566373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1552566373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1552566373, ~x~0=~x~0_In1552566373} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1552566373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1552566373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1552566373, ~x~0=~x~0_In1552566373, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1552566373|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:49:12,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:49:12,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1726133882 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1726133882 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1726133882| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1726133882 |ULTIMATE.start_main_#t~ite36_Out-1726133882|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726133882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726133882} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726133882, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1726133882|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726133882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 16:49:12,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-161349123 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-161349123 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-161349123 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-161349123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-161349123| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-161349123| ~x$w_buff1_used~0_In-161349123)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-161349123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-161349123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-161349123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161349123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-161349123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-161349123, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-161349123|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-161349123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161349123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:49:12,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1460928831 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1460928831 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1460928831|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1460928831 |ULTIMATE.start_main_#t~ite38_Out-1460928831|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1460928831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1460928831} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1460928831, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1460928831|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1460928831} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:49:12,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In324820730 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In324820730 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In324820730 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In324820730 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out324820730|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In324820730 |ULTIMATE.start_main_#t~ite39_Out324820730|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In324820730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In324820730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In324820730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In324820730} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In324820730, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out324820730|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In324820730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In324820730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In324820730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:49:12,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:49:12,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:49:12 BasicIcfg [2019-12-27 16:49:12,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:49:12,312 INFO L168 Benchmark]: Toolchain (without parser) took 14224.71 ms. Allocated memory was 146.3 MB in the beginning and 437.3 MB in the end (delta: 291.0 MB). Free memory was 102.2 MB in the beginning and 276.3 MB in the end (delta: -174.1 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,313 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.42 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.12 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,315 INFO L168 Benchmark]: Boogie Preprocessor took 37.42 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,315 INFO L168 Benchmark]: RCFGBuilder took 771.51 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 110.4 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,316 INFO L168 Benchmark]: TraceAbstraction took 12563.84 ms. Allocated memory was 203.9 MB in the beginning and 437.3 MB in the end (delta: 233.3 MB). Free memory was 110.4 MB in the beginning and 276.3 MB in the end (delta: -165.9 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:49:12,320 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.42 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.12 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.42 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 771.51 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 110.4 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12563.84 ms. Allocated memory was 203.9 MB in the beginning and 437.3 MB in the end (delta: 233.3 MB). Free memory was 110.4 MB in the beginning and 276.3 MB in the end (delta: -165.9 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 80 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 18 ChoiceCompositions, 4487 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 190 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 45287 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t911, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t912, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1547 SDtfs, 1646 SDslu, 3686 SDs, 0 SdLazy, 1988 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred 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: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4320 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 32423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...