/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:54:21,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:54:21,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:54:21,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:54:21,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:54:21,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:54:21,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:54:21,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:54:21,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:54:21,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:54:21,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:54:21,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:54:21,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:54:21,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:54:21,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:54:21,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:54:21,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:54:21,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:54:21,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:54:21,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:54:21,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:54:21,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:54:21,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:54:21,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:54:21,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:54:21,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:54:21,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:54:21,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:54:21,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:54:21,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:54:21,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:54:21,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:54:21,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:54:21,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:54:21,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:54:21,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:54:21,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:54:21,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:54:21,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:54:21,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:54:21,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:54:21,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:54:21,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:54:21,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:54:21,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:54:21,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:54:21,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:54:21,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:54:21,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:54:21,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:54:21,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:54:21,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:54:22,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:54:22,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:54:22,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:54:22,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:54:22,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:54:22,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:54:22,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:54:22,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:54:22,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:54:22,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:54:22,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:54:22,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:22,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:54:22,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:54:22,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:54:22,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:54:22,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:54:22,004 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:54:22,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:54:22,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:54:22,005 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:54:22,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:54:22,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:54:22,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:54:22,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:54:22,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:54:22,292 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:54:22,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2019-12-27 21:54:22,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1d5dd6f/fa94202d4a97449b94f6710f6c84df10/FLAGd91da20a0 [2019-12-27 21:54:22,864 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:54:22,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2019-12-27 21:54:22,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1d5dd6f/fa94202d4a97449b94f6710f6c84df10/FLAGd91da20a0 [2019-12-27 21:54:23,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1d5dd6f/fa94202d4a97449b94f6710f6c84df10 [2019-12-27 21:54:23,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:54:23,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:54:23,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:23,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:54:23,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:54:23,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:23,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23, skipping insertion in model container [2019-12-27 21:54:23,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:23,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:54:23,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:54:23,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:23,822 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:54:23,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:23,977 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:54:23,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23 WrapperNode [2019-12-27 21:54:23,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:23,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:23,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:54:23,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:54:23,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:24,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:54:24,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:54:24,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:54:24,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (1/1) ... [2019-12-27 21:54:24,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:54:24,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:54:24,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:54:24,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:54:24,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (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 21:54:24,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:54:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:54:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:54:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:54:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:54:24,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:54:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:54:24,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:54:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:54:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:54:24,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:54:24,149 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 21:54:24,850 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:54:24,850 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:54:24,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:24 BoogieIcfgContainer [2019-12-27 21:54:24,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:54:24,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:54:24,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:54:24,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:54:24,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:23" (1/3) ... [2019-12-27 21:54:24,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e36809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:24, skipping insertion in model container [2019-12-27 21:54:24,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:23" (2/3) ... [2019-12-27 21:54:24,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e36809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:24, skipping insertion in model container [2019-12-27 21:54:24,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:24" (3/3) ... [2019-12-27 21:54:24,865 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2019-12-27 21:54:24,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:54:24,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:54:24,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:54:24,899 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:54:24,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:24,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,030 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,031 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:25,051 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:54:25,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:54:25,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:54:25,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:54:25,073 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:54:25,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:54:25,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:54:25,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:54:25,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:54:25,112 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-27 21:54:25,114 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 21:54:25,210 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 21:54:25,210 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:25,222 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:25,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 21:54:25,293 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 21:54:25,293 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:25,298 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:25,310 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 21:54:25,311 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:54:28,402 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:54:28,509 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:54:28,543 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40940 [2019-12-27 21:54:28,543 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 21:54:28,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 77 transitions [2019-12-27 21:54:28,839 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 21:54:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 21:54:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:54:28,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:28,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:54:28,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 679647889, now seen corresponding path program 1 times [2019-12-27 21:54:28,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:28,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861149808] [2019-12-27 21:54:28,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:29,077 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 21:54:29,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861149808] [2019-12-27 21:54:29,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:29,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:54:29,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246365174] [2019-12-27 21:54:29,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:29,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:29,101 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:54:29,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:29,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:29,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:29,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:29,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:29,127 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 21:54:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:29,395 INFO L93 Difference]: Finished difference Result 6202 states and 20974 transitions. [2019-12-27 21:54:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:29,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:54:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:29,476 INFO L225 Difference]: With dead ends: 6202 [2019-12-27 21:54:29,476 INFO L226 Difference]: Without dead ends: 5842 [2019-12-27 21:54:29,478 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 21:54:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2019-12-27 21:54:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 5842. [2019-12-27 21:54:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-12-27 21:54:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 19720 transitions. [2019-12-27 21:54:29,842 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 19720 transitions. Word has length 5 [2019-12-27 21:54:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:29,842 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 19720 transitions. [2019-12-27 21:54:29,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 19720 transitions. [2019-12-27 21:54:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:54:29,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:29,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:29,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1194540122, now seen corresponding path program 1 times [2019-12-27 21:54:29,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:29,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500937391] [2019-12-27 21:54:29,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:29,916 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 21:54:29,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500937391] [2019-12-27 21:54:29,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:29,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:29,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459306147] [2019-12-27 21:54:29,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:29,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:29,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:54:29,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:29,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:29,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:29,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:29,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:29,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:29,926 INFO L87 Difference]: Start difference. First operand 5842 states and 19720 transitions. Second operand 3 states. [2019-12-27 21:54:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:29,960 INFO L93 Difference]: Finished difference Result 1186 states and 2950 transitions. [2019-12-27 21:54:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:29,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:54:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:29,967 INFO L225 Difference]: With dead ends: 1186 [2019-12-27 21:54:29,967 INFO L226 Difference]: Without dead ends: 1186 [2019-12-27 21:54:29,969 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 21:54:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-27 21:54:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-27 21:54:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-27 21:54:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2950 transitions. [2019-12-27 21:54:30,010 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2950 transitions. Word has length 11 [2019-12-27 21:54:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:30,010 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 2950 transitions. [2019-12-27 21:54:30,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2950 transitions. [2019-12-27 21:54:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:30,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:30,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:30,016 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1520947745, now seen corresponding path program 1 times [2019-12-27 21:54:30,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:30,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299077604] [2019-12-27 21:54:30,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:30,151 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 21:54:30,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299077604] [2019-12-27 21:54:30,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:30,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:30,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124058011] [2019-12-27 21:54:30,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:30,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:30,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:30,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:30,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:30,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:30,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:30,226 INFO L87 Difference]: Start difference. First operand 1186 states and 2950 transitions. Second operand 5 states. [2019-12-27 21:54:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:30,351 INFO L93 Difference]: Finished difference Result 1816 states and 4578 transitions. [2019-12-27 21:54:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:30,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:30,398 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 21:54:30,398 INFO L226 Difference]: Without dead ends: 1816 [2019-12-27 21:54:30,399 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 21:54:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-27 21:54:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1300. [2019-12-27 21:54:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 21:54:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3290 transitions. [2019-12-27 21:54:30,438 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3290 transitions. Word has length 14 [2019-12-27 21:54:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:30,438 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3290 transitions. [2019-12-27 21:54:30,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3290 transitions. [2019-12-27 21:54:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:30,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:30,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:30,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:30,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1657479898, now seen corresponding path program 1 times [2019-12-27 21:54:30,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:30,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923799192] [2019-12-27 21:54:30,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:30,525 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 21:54:30,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923799192] [2019-12-27 21:54:30,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:30,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:30,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885348012] [2019-12-27 21:54:30,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:30,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:30,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:30,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:30,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:30,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:30,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:30,568 INFO L87 Difference]: Start difference. First operand 1300 states and 3290 transitions. Second operand 5 states. [2019-12-27 21:54:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:30,788 INFO L93 Difference]: Finished difference Result 1749 states and 4286 transitions. [2019-12-27 21:54:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:30,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:30,799 INFO L225 Difference]: With dead ends: 1749 [2019-12-27 21:54:30,799 INFO L226 Difference]: Without dead ends: 1749 [2019-12-27 21:54:30,800 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 21:54:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-12-27 21:54:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1581. [2019-12-27 21:54:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-27 21:54:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3910 transitions. [2019-12-27 21:54:30,851 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3910 transitions. Word has length 14 [2019-12-27 21:54:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:30,852 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3910 transitions. [2019-12-27 21:54:30,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3910 transitions. [2019-12-27 21:54:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:30,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:30,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:30,854 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 592134812, now seen corresponding path program 1 times [2019-12-27 21:54:30,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:30,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148981606] [2019-12-27 21:54:30,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:30,929 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 21:54:30,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148981606] [2019-12-27 21:54:30,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:30,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:30,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259742160] [2019-12-27 21:54:30,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:30,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:30,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:30,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:30,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:30,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:30,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:30,962 INFO L87 Difference]: Start difference. First operand 1581 states and 3910 transitions. Second operand 5 states. [2019-12-27 21:54:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:31,204 INFO L93 Difference]: Finished difference Result 2006 states and 4872 transitions. [2019-12-27 21:54:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:31,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:31,217 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 21:54:31,217 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 21:54:31,218 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 21:54:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 21:54:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1606. [2019-12-27 21:54:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 21:54:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 3970 transitions. [2019-12-27 21:54:31,265 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 3970 transitions. Word has length 14 [2019-12-27 21:54:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:31,266 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 3970 transitions. [2019-12-27 21:54:31,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 3970 transitions. [2019-12-27 21:54:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:54:31,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:31,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:31,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash -321167057, now seen corresponding path program 1 times [2019-12-27 21:54:31,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:31,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338549278] [2019-12-27 21:54:31,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:31,349 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 21:54:31,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338549278] [2019-12-27 21:54:31,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:31,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:31,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161045519] [2019-12-27 21:54:31,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:31,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:31,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 21:54:31,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:31,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:31,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:31,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:31,382 INFO L87 Difference]: Start difference. First operand 1606 states and 3970 transitions. Second operand 5 states. [2019-12-27 21:54:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:31,416 INFO L93 Difference]: Finished difference Result 714 states and 1648 transitions. [2019-12-27 21:54:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:54:31,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:54:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:31,421 INFO L225 Difference]: With dead ends: 714 [2019-12-27 21:54:31,421 INFO L226 Difference]: Without dead ends: 714 [2019-12-27 21:54:31,422 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 21:54:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-27 21:54:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 682. [2019-12-27 21:54:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-27 21:54:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1580 transitions. [2019-12-27 21:54:31,439 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1580 transitions. Word has length 26 [2019-12-27 21:54:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:31,439 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1580 transitions. [2019-12-27 21:54:31,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1580 transitions. [2019-12-27 21:54:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:31,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:31,442 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 21:54:31,442 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 152096728, now seen corresponding path program 1 times [2019-12-27 21:54:31,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:31,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493422478] [2019-12-27 21:54:31,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:31,569 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 21:54:31,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493422478] [2019-12-27 21:54:31,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:31,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:31,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564648930] [2019-12-27 21:54:31,571 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:31,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:31,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 157 transitions. [2019-12-27 21:54:31,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:31,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:54:31,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:31,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:31,677 INFO L87 Difference]: Start difference. First operand 682 states and 1580 transitions. Second operand 3 states. [2019-12-27 21:54:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:31,689 INFO L93 Difference]: Finished difference Result 1069 states and 2520 transitions. [2019-12-27 21:54:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:31,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 21:54:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:31,692 INFO L225 Difference]: With dead ends: 1069 [2019-12-27 21:54:31,692 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 21:54:31,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 21:54:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-27 21:54:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 21:54:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 971 transitions. [2019-12-27 21:54:31,704 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 971 transitions. Word has length 41 [2019-12-27 21:54:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:31,705 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 971 transitions. [2019-12-27 21:54:31,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 971 transitions. [2019-12-27 21:54:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:31,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:31,709 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 21:54:31,710 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -927493450, now seen corresponding path program 2 times [2019-12-27 21:54:31,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:31,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164415365] [2019-12-27 21:54:31,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:31,815 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 21:54:31,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164415365] [2019-12-27 21:54:31,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:31,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:54:31,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113734822] [2019-12-27 21:54:31,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:31,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:31,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 150 transitions. [2019-12-27 21:54:31,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:31,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:54:31,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:31,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:31,973 INFO L87 Difference]: Start difference. First operand 406 states and 971 transitions. Second operand 10 states. [2019-12-27 21:54:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:33,626 INFO L93 Difference]: Finished difference Result 1686 states and 3762 transitions. [2019-12-27 21:54:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 21:54:33,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-12-27 21:54:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:33,635 INFO L225 Difference]: With dead ends: 1686 [2019-12-27 21:54:33,635 INFO L226 Difference]: Without dead ends: 1138 [2019-12-27 21:54:33,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:54:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-27 21:54:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 436. [2019-12-27 21:54:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 21:54:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1021 transitions. [2019-12-27 21:54:33,651 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1021 transitions. Word has length 41 [2019-12-27 21:54:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:33,652 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 1021 transitions. [2019-12-27 21:54:33,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1021 transitions. [2019-12-27 21:54:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:33,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:33,654 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 21:54:33,655 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1094693734, now seen corresponding path program 3 times [2019-12-27 21:54:33,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:33,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248593497] [2019-12-27 21:54:33,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:33,717 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 21:54:33,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248593497] [2019-12-27 21:54:33,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:33,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:33,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282921174] [2019-12-27 21:54:33,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:33,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:33,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 103 transitions. [2019-12-27 21:54:33,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:33,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:33,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:33,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:33,762 INFO L87 Difference]: Start difference. First operand 436 states and 1021 transitions. Second operand 3 states. [2019-12-27 21:54:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:33,777 INFO L93 Difference]: Finished difference Result 434 states and 1016 transitions. [2019-12-27 21:54:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:33,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 21:54:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:33,780 INFO L225 Difference]: With dead ends: 434 [2019-12-27 21:54:33,781 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 21:54:33,781 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 21:54:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 21:54:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2019-12-27 21:54:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-27 21:54:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1016 transitions. [2019-12-27 21:54:33,791 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1016 transitions. Word has length 41 [2019-12-27 21:54:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:33,791 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 1016 transitions. [2019-12-27 21:54:33,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1016 transitions. [2019-12-27 21:54:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:54:33,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:33,793 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 21:54:33,793 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 563396780, now seen corresponding path program 1 times [2019-12-27 21:54:33,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916365780] [2019-12-27 21:54:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:54:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:54:33,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:54:33,906 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:54:33,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= v_~main$tmp_guard0~0_9 0) (= v_~x$r_buff1_thd1~0_40 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd2~0_29) (= 0 v_~x$r_buff0_thd1~0_69) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 v_~x$w_buff0~0_24) (= v_~y~0_19 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_25 0) (= v_~x$w_buff1_used~0_54 0) (= 0 v_~x$w_buff0_used~0_92) (= v_~x$r_buff1_thd2~0_21 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1639~0.base_23|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_23|) |v_ULTIMATE.start_main_~#t1639~0.offset_18| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= v_~x~0_20 0) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_23|) 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t1639~0.offset_18|) (= 0 v_~__unbuffered_p1_EAX~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_23| 1) |v_#valid_47|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1639~0.base_23| 4)) (= v_~__unbuffered_p1_EBX~0_18 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_69, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_~#t1639~0.base=|v_ULTIMATE.start_main_~#t1639~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_18|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_23|, ~y~0=v_~y~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t1639~0.offset=|v_ULTIMATE.start_main_~#t1639~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_23|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_54, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_25, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~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, ULTIMATE.start_main_~#t1639~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1639~0.offset, ~__unbuffered_p1_EBX~0, 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, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:54:33,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-1-->L802: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10|) |v_ULTIMATE.start_main_~#t1640~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1640~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1640~0.base_10| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1640~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base] because there is no mapped edge [2019-12-27 21:54:33,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L5-->L777: Formula: (and (= ~y~0_Out-686209917 ~__unbuffered_p1_EBX~0_Out-686209917) (= ~y~0_Out-686209917 1) (= ~x$r_buff1_thd0~0_Out-686209917 ~x$r_buff0_thd0~0_In-686209917) (= ~x$r_buff1_thd2~0_Out-686209917 ~x$r_buff0_thd2~0_In-686209917) (= ~y~0_Out-686209917 ~__unbuffered_p1_EAX~0_Out-686209917) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-686209917 0)) (= ~x$r_buff0_thd2~0_Out-686209917 1) (= ~x$r_buff1_thd1~0_Out-686209917 ~x$r_buff0_thd1~0_In-686209917)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-686209917, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-686209917, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-686209917, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-686209917} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-686209917, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-686209917, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-686209917, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-686209917, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-686209917, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-686209917, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-686209917, ~y~0=~y~0_Out-686209917, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-686209917, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-686209917} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:54:33,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_37) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_36, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 21:54:33,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In823376439 256)))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In823376439 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out823376439| |P0Thread1of1ForFork1_#t~ite22_Out823376439|) .cse0 (or (not (= (mod ~x$w_buff1_used~0_In823376439 256) 0)) .cse1) (or (not (= (mod ~x$r_buff1_thd1~0_In823376439 256) 0)) .cse1) (not (= (mod ~x$w_buff0_used~0_In823376439 256) 0)) (= |P0Thread1of1ForFork1_#t~ite22_Out823376439| 0) (= |P0Thread1of1ForFork1_#t~ite24_Out823376439| |P0Thread1of1ForFork1_#t~ite23_Out823376439|))) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite23_In823376439| |P0Thread1of1ForFork1_#t~ite23_Out823376439|) (= |P0Thread1of1ForFork1_#t~ite24_Out823376439| ~x$r_buff1_thd1~0_In823376439) (= |P0Thread1of1ForFork1_#t~ite22_In823376439| |P0Thread1of1ForFork1_#t~ite22_Out823376439|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In823376439, ~x$w_buff1_used~0=~x$w_buff1_used~0_In823376439, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In823376439, ~weak$$choice2~0=~weak$$choice2~0_In823376439, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In823376439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In823376439, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In823376439|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In823376439, ~x$w_buff1_used~0=~x$w_buff1_used~0_In823376439, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In823376439, ~weak$$choice2~0=~weak$$choice2~0_In823376439, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out823376439|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out823376439|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out823376439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In823376439} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:54:33,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 21:54:33,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-962357393 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-962357393 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-962357393| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-962357393| ~x$w_buff0_used~0_In-962357393)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-962357393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-962357393} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-962357393, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-962357393|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-962357393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 21:54:33,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1758240850 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1758240850 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1758240850 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1758240850 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1758240850| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out1758240850| ~x$w_buff1_used~0_In1758240850) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1758240850, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1758240850, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1758240850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1758240850} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1758240850, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1758240850, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1758240850, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1758240850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1758240850} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 21:54:33,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1378859023 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1378859023 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1378859023)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1378859023 ~x$r_buff0_thd2~0_Out-1378859023)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1378859023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378859023} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1378859023|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1378859023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378859023} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:54:33,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In616381332 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In616381332 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In616381332 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In616381332 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out616381332| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out616381332| ~x$r_buff1_thd2~0_In616381332)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In616381332, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In616381332, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In616381332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In616381332} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out616381332|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In616381332, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In616381332, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In616381332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In616381332} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:54:33,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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 21:54:33,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:54:33,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In77221044 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In77221044 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In77221044 |ULTIMATE.start_main_#t~ite34_Out77221044|)) (and (= ~x~0_In77221044 |ULTIMATE.start_main_#t~ite34_Out77221044|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In77221044, ~x$w_buff1_used~0=~x$w_buff1_used~0_In77221044, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In77221044, ~x~0=~x~0_In77221044} OutVars{~x$w_buff1~0=~x$w_buff1~0_In77221044, ~x$w_buff1_used~0=~x$w_buff1_used~0_In77221044, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In77221044, ~x~0=~x~0_In77221044, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out77221044|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:54:33,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:54:33,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In451693130 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In451693130 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out451693130| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out451693130| ~x$w_buff0_used~0_In451693130) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In451693130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In451693130} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In451693130, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out451693130|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In451693130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:54:33,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-781409766 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-781409766 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-781409766 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-781409766 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-781409766| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-781409766 |ULTIMATE.start_main_#t~ite37_Out-781409766|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-781409766, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-781409766, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-781409766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-781409766} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-781409766, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-781409766, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-781409766|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-781409766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-781409766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:54:33,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In123684737 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In123684737 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out123684737| ~x$r_buff0_thd0~0_In123684737)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out123684737| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In123684737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In123684737} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In123684737, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out123684737|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In123684737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:54:33,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2062907732 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2062907732 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2062907732 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2062907732 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out2062907732| ~x$r_buff1_thd0~0_In2062907732) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2062907732| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2062907732, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2062907732, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2062907732, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2062907732} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2062907732, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2062907732|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2062907732, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2062907732, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2062907732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:54:33,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_11) (= v_~__unbuffered_p1_EBX~0_12 1) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite39_14|) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 21:54:34,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:54:34 BasicIcfg [2019-12-27 21:54:34,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:54:34,027 INFO L168 Benchmark]: Toolchain (without parser) took 10839.83 ms. Allocated memory was 144.7 MB in the beginning and 359.7 MB in the end (delta: 215.0 MB). Free memory was 101.6 MB in the beginning and 62.2 MB in the end (delta: 39.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,029 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.00 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.67 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,031 INFO L168 Benchmark]: Boogie Preprocessor took 35.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,032 INFO L168 Benchmark]: RCFGBuilder took 783.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 111.5 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,035 INFO L168 Benchmark]: TraceAbstraction took 9168.08 ms. Allocated memory was 202.9 MB in the beginning and 359.7 MB in the end (delta: 156.8 MB). Free memory was 110.9 MB in the beginning and 62.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 205.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:34,046 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.00 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.67 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 111.5 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9168.08 ms. Allocated memory was 202.9 MB in the beginning and 359.7 MB in the end (delta: 156.8 MB). Free memory was 110.9 MB in the beginning and 62.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 205.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 136 ProgramPointsBefore, 66 ProgramPointsAfterwards, 164 TransitionsBefore, 77 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 123 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 40940 CheckedPairsTotal, 101 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(&t1639, ((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] [L802] FCALL, FORK 0 pthread_create(&t1640, ((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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [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=1, 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=2] [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=1, 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=2] [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) [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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))=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=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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) [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 [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=1, 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=2] [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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 852 SDtfs, 916 SDslu, 1441 SDs, 0 SdLazy, 1095 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1818 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 15862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...