/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:14:10,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:14:10,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:14:10,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:14:10,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:14:10,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:14:10,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:14:10,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:14:10,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:14:10,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:14:10,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:14:10,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:14:10,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:14:10,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:14:10,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:14:10,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:14:10,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:14:10,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:14:10,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:14:10,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:14:10,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:14:10,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:14:10,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:14:10,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:14:10,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:14:10,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:14:10,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:14:10,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:14:10,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:14:10,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:14:10,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:14:10,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:14:10,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:14:10,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:14:10,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:14:10,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:14:10,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:14:10,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:14:10,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:14:10,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:14:10,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:14:10,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:14:10,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:14:10,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:14:10,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:14:10,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:14:10,935 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:14:10,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:14:10,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:14:10,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:14:10,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:14:10,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:14:10,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:14:10,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:14:10,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:14:10,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:14:10,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:14:10,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:14:10,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:14:10,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:14:10,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:14:10,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:14:10,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:14:10,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:14:10,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:14:10,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:14:11,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:14:11,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:14:11,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:14:11,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:14:11,258 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:14:11,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_power.oepc.i [2019-12-18 18:14:11,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b8400f6/51356590b98648a28d4a96745d92de82/FLAG6b03663fb [2019-12-18 18:14:11,851 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:14:11,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_power.oepc.i [2019-12-18 18:14:11,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b8400f6/51356590b98648a28d4a96745d92de82/FLAG6b03663fb [2019-12-18 18:14:12,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b8400f6/51356590b98648a28d4a96745d92de82 [2019-12-18 18:14:12,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:14:12,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:14:12,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:14:12,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:14:12,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:14:12,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:14:12" (1/1) ... [2019-12-18 18:14:12,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:12, skipping insertion in model container [2019-12-18 18:14:12,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:14:12" (1/1) ... [2019-12-18 18:14:12,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:14:12,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:14:12,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:14:12,876 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:14:12,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:14:13,038 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:14:13,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13 WrapperNode [2019-12-18 18:14:13,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:14:13,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:14:13,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:14:13,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:14:13,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:14:13,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:14:13,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:14:13,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:14:13,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (1/1) ... [2019-12-18 18:14:13,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:14:13,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:14:13,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:14:13,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:14:13,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (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-18 18:14:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:14:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:14:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:14:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:14:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:14:13,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:14:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:14:13,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:14:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:14:13,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:14:13,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:14:13,248 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:14:14,152 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:14:14,153 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:14:14,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:14:14 BoogieIcfgContainer [2019-12-18 18:14:14,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:14:14,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:14:14,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:14:14,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:14:14,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:14:12" (1/3) ... [2019-12-18 18:14:14,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84bf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:14:14, skipping insertion in model container [2019-12-18 18:14:14,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:14:13" (2/3) ... [2019-12-18 18:14:14,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84bf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:14:14, skipping insertion in model container [2019-12-18 18:14:14,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:14:14" (3/3) ... [2019-12-18 18:14:14,163 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_power.oepc.i [2019-12-18 18:14:14,172 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:14:14,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:14:14,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:14:14,181 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:14:14,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,347 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:14:14,364 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:14:14,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:14:14,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:14:14,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:14:14,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:14:14,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:14:14,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:14:14,387 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:14:14,387 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:14:14,406 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-18 18:14:14,408 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 18:14:14,521 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 18:14:14,521 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:14:14,543 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 18:14:14,574 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 18:14:14,634 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 18:14:14,634 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:14:14,646 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 18:14:14,673 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 18:14:14,674 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:14:19,429 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:14:19,539 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:14:19,693 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121847 [2019-12-18 18:14:19,693 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 18:14:19,697 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 126 transitions [2019-12-18 18:14:21,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23697 states. [2019-12-18 18:14:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23697 states. [2019-12-18 18:14:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:14:21,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:21,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:14:21,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 960453199, now seen corresponding path program 1 times [2019-12-18 18:14:21,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:21,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006291320] [2019-12-18 18:14:21,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:21,508 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-18 18:14:21,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006291320] [2019-12-18 18:14:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:21,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:14:21,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836188643] [2019-12-18 18:14:21,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:14:21,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:14:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:14:21,531 INFO L87 Difference]: Start difference. First operand 23697 states. Second operand 3 states. [2019-12-18 18:14:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:22,018 INFO L93 Difference]: Finished difference Result 23505 states and 84597 transitions. [2019-12-18 18:14:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:14:22,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:14:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:22,980 INFO L225 Difference]: With dead ends: 23505 [2019-12-18 18:14:22,981 INFO L226 Difference]: Without dead ends: 22000 [2019-12-18 18:14:22,982 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-18 18:14:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-12-18 18:14:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 22000. [2019-12-18 18:14:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-12-18 18:14:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 79119 transitions. [2019-12-18 18:14:24,185 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 79119 transitions. Word has length 5 [2019-12-18 18:14:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:24,185 INFO L462 AbstractCegarLoop]: Abstraction has 22000 states and 79119 transitions. [2019-12-18 18:14:24,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:14:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 79119 transitions. [2019-12-18 18:14:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:14:24,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:24,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:24,190 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1767797629, now seen corresponding path program 1 times [2019-12-18 18:14:24,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:24,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397302789] [2019-12-18 18:14:24,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:24,325 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-18 18:14:24,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397302789] [2019-12-18 18:14:24,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:24,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:14:24,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192933371] [2019-12-18 18:14:24,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:14:24,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:14:24,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:14:24,329 INFO L87 Difference]: Start difference. First operand 22000 states and 79119 transitions. Second operand 4 states. [2019-12-18 18:14:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:24,963 INFO L93 Difference]: Finished difference Result 34136 states and 117485 transitions. [2019-12-18 18:14:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:14:24,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:14:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:25,115 INFO L225 Difference]: With dead ends: 34136 [2019-12-18 18:14:25,116 INFO L226 Difference]: Without dead ends: 34120 [2019-12-18 18:14:25,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34120 states. [2019-12-18 18:14:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34120 to 32747. [2019-12-18 18:14:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32747 states. [2019-12-18 18:14:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32747 states to 32747 states and 113702 transitions. [2019-12-18 18:14:27,554 INFO L78 Accepts]: Start accepts. Automaton has 32747 states and 113702 transitions. Word has length 11 [2019-12-18 18:14:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:27,555 INFO L462 AbstractCegarLoop]: Abstraction has 32747 states and 113702 transitions. [2019-12-18 18:14:27,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:14:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32747 states and 113702 transitions. [2019-12-18 18:14:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:14:27,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:27,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:27,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:27,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1354653160, now seen corresponding path program 1 times [2019-12-18 18:14:27,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:27,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44973404] [2019-12-18 18:14:27,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:27,642 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-18 18:14:27,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44973404] [2019-12-18 18:14:27,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:27,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:14:27,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110133896] [2019-12-18 18:14:27,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:14:27,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:14:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:14:27,645 INFO L87 Difference]: Start difference. First operand 32747 states and 113702 transitions. Second operand 4 states. [2019-12-18 18:14:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:28,128 INFO L93 Difference]: Finished difference Result 42448 states and 144693 transitions. [2019-12-18 18:14:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:14:28,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:14:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:28,285 INFO L225 Difference]: With dead ends: 42448 [2019-12-18 18:14:28,285 INFO L226 Difference]: Without dead ends: 42433 [2019-12-18 18:14:28,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42433 states. [2019-12-18 18:14:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42433 to 37509. [2019-12-18 18:14:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-12-18 18:14:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 129444 transitions. [2019-12-18 18:14:30,978 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 129444 transitions. Word has length 14 [2019-12-18 18:14:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:30,979 INFO L462 AbstractCegarLoop]: Abstraction has 37509 states and 129444 transitions. [2019-12-18 18:14:30,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:14:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 129444 transitions. [2019-12-18 18:14:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:14:30,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:30,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:30,985 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash 287658910, now seen corresponding path program 1 times [2019-12-18 18:14:30,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:30,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963136314] [2019-12-18 18:14:30,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:31,037 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-18 18:14:31,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963136314] [2019-12-18 18:14:31,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:31,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:14:31,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231294361] [2019-12-18 18:14:31,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:14:31,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:14:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:14:31,040 INFO L87 Difference]: Start difference. First operand 37509 states and 129444 transitions. Second operand 3 states. [2019-12-18 18:14:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:31,187 INFO L93 Difference]: Finished difference Result 35330 states and 121730 transitions. [2019-12-18 18:14:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:14:31,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 18:14:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:31,276 INFO L225 Difference]: With dead ends: 35330 [2019-12-18 18:14:31,276 INFO L226 Difference]: Without dead ends: 35330 [2019-12-18 18:14:31,277 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-18 18:14:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35330 states. [2019-12-18 18:14:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35330 to 35330. [2019-12-18 18:14:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-12-18 18:14:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 121730 transitions. [2019-12-18 18:14:32,845 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 121730 transitions. Word has length 16 [2019-12-18 18:14:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:32,845 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 121730 transitions. [2019-12-18 18:14:32,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:14:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 121730 transitions. [2019-12-18 18:14:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 18:14:32,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:32,860 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] [2019-12-18 18:14:32,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1416377548, now seen corresponding path program 1 times [2019-12-18 18:14:32,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:32,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831910066] [2019-12-18 18:14:32,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:32,987 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-18 18:14:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831910066] [2019-12-18 18:14:32,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:32,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:14:32,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462360251] [2019-12-18 18:14:32,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:14:32,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:14:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:32,990 INFO L87 Difference]: Start difference. First operand 35330 states and 121730 transitions. Second operand 5 states. [2019-12-18 18:14:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:34,782 INFO L93 Difference]: Finished difference Result 42336 states and 143476 transitions. [2019-12-18 18:14:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:14:34,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 18:14:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:34,869 INFO L225 Difference]: With dead ends: 42336 [2019-12-18 18:14:34,870 INFO L226 Difference]: Without dead ends: 42308 [2019-12-18 18:14:34,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:14:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42308 states. [2019-12-18 18:14:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42308 to 35180. [2019-12-18 18:14:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35180 states. [2019-12-18 18:14:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35180 states to 35180 states and 121282 transitions. [2019-12-18 18:14:36,022 INFO L78 Accepts]: Start accepts. Automaton has 35180 states and 121282 transitions. Word has length 20 [2019-12-18 18:14:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 35180 states and 121282 transitions. [2019-12-18 18:14:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:14:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 35180 states and 121282 transitions. [2019-12-18 18:14:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 18:14:36,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:36,084 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] [2019-12-18 18:14:36,084 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash -904071527, now seen corresponding path program 1 times [2019-12-18 18:14:36,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:36,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001974172] [2019-12-18 18:14:36,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:36,150 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-18 18:14:36,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001974172] [2019-12-18 18:14:36,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:36,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:14:36,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053410197] [2019-12-18 18:14:36,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:14:36,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:36,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:14:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:14:36,152 INFO L87 Difference]: Start difference. First operand 35180 states and 121282 transitions. Second operand 4 states. [2019-12-18 18:14:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:36,215 INFO L93 Difference]: Finished difference Result 5875 states and 16524 transitions. [2019-12-18 18:14:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:14:36,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-18 18:14:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:36,221 INFO L225 Difference]: With dead ends: 5875 [2019-12-18 18:14:36,222 INFO L226 Difference]: Without dead ends: 3697 [2019-12-18 18:14:36,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-12-18 18:14:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3697. [2019-12-18 18:14:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3697 states. [2019-12-18 18:14:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 9023 transitions. [2019-12-18 18:14:36,272 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 9023 transitions. Word has length 30 [2019-12-18 18:14:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:36,272 INFO L462 AbstractCegarLoop]: Abstraction has 3697 states and 9023 transitions. [2019-12-18 18:14:36,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:14:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 9023 transitions. [2019-12-18 18:14:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 18:14:36,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:36,279 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-18 18:14:36,279 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 927574064, now seen corresponding path program 1 times [2019-12-18 18:14:36,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:36,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432078324] [2019-12-18 18:14:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:36,391 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-18 18:14:36,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432078324] [2019-12-18 18:14:36,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:36,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:14:36,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980228709] [2019-12-18 18:14:36,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:14:36,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:14:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:36,393 INFO L87 Difference]: Start difference. First operand 3697 states and 9023 transitions. Second operand 5 states. [2019-12-18 18:14:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:36,504 INFO L93 Difference]: Finished difference Result 6071 states and 15015 transitions. [2019-12-18 18:14:36,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:14:36,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 18:14:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:36,510 INFO L225 Difference]: With dead ends: 6071 [2019-12-18 18:14:36,511 INFO L226 Difference]: Without dead ends: 4750 [2019-12-18 18:14:36,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:14:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2019-12-18 18:14:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4750. [2019-12-18 18:14:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-12-18 18:14:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 11868 transitions. [2019-12-18 18:14:36,698 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 11868 transitions. Word has length 41 [2019-12-18 18:14:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:36,699 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 11868 transitions. [2019-12-18 18:14:36,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:14:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 11868 transitions. [2019-12-18 18:14:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:14:36,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:36,705 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-18 18:14:36,705 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash -759882014, now seen corresponding path program 1 times [2019-12-18 18:14:36,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:36,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959903054] [2019-12-18 18:14:36,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:36,785 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-18 18:14:36,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959903054] [2019-12-18 18:14:36,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:36,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:14:36,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969521959] [2019-12-18 18:14:36,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:14:36,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:14:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:36,787 INFO L87 Difference]: Start difference. First operand 4750 states and 11868 transitions. Second operand 5 states. [2019-12-18 18:14:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:37,232 INFO L93 Difference]: Finished difference Result 5410 states and 13278 transitions. [2019-12-18 18:14:37,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:14:37,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 18:14:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:37,240 INFO L225 Difference]: With dead ends: 5410 [2019-12-18 18:14:37,240 INFO L226 Difference]: Without dead ends: 5410 [2019-12-18 18:14:37,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:14:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-18 18:14:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5148. [2019-12-18 18:14:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-12-18 18:14:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 12759 transitions. [2019-12-18 18:14:37,295 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 12759 transitions. Word has length 42 [2019-12-18 18:14:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:37,296 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 12759 transitions. [2019-12-18 18:14:37,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:14:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 12759 transitions. [2019-12-18 18:14:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 18:14:37,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:37,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:37,302 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash -800932999, now seen corresponding path program 1 times [2019-12-18 18:14:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:37,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399156520] [2019-12-18 18:14:37,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:37,387 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-18 18:14:37,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399156520] [2019-12-18 18:14:37,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:37,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:14:37,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455032575] [2019-12-18 18:14:37,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:14:37,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:14:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:37,389 INFO L87 Difference]: Start difference. First operand 5148 states and 12759 transitions. Second operand 5 states. [2019-12-18 18:14:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:37,765 INFO L93 Difference]: Finished difference Result 6138 states and 14768 transitions. [2019-12-18 18:14:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:14:37,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 18:14:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:37,773 INFO L225 Difference]: With dead ends: 6138 [2019-12-18 18:14:37,773 INFO L226 Difference]: Without dead ends: 6138 [2019-12-18 18:14:37,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:14:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-12-18 18:14:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5202. [2019-12-18 18:14:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-12-18 18:14:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 12514 transitions. [2019-12-18 18:14:37,833 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 12514 transitions. Word has length 43 [2019-12-18 18:14:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:37,834 INFO L462 AbstractCegarLoop]: Abstraction has 5202 states and 12514 transitions. [2019-12-18 18:14:37,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:14:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 12514 transitions. [2019-12-18 18:14:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 18:14:37,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:37,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:37,841 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 551589791, now seen corresponding path program 1 times [2019-12-18 18:14:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012353563] [2019-12-18 18:14:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:37,945 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-18 18:14:37,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012353563] [2019-12-18 18:14:37,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:37,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:14:37,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003019589] [2019-12-18 18:14:37,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:14:37,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:14:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:37,947 INFO L87 Difference]: Start difference. First operand 5202 states and 12514 transitions. Second operand 5 states. [2019-12-18 18:14:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:37,997 INFO L93 Difference]: Finished difference Result 3468 states and 8399 transitions. [2019-12-18 18:14:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:14:37,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 18:14:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:38,003 INFO L225 Difference]: With dead ends: 3468 [2019-12-18 18:14:38,003 INFO L226 Difference]: Without dead ends: 3272 [2019-12-18 18:14:38,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:14:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-12-18 18:14:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3137. [2019-12-18 18:14:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2019-12-18 18:14:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7692 transitions. [2019-12-18 18:14:38,036 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7692 transitions. Word has length 43 [2019-12-18 18:14:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:38,037 INFO L462 AbstractCegarLoop]: Abstraction has 3137 states and 7692 transitions. [2019-12-18 18:14:38,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:14:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7692 transitions. [2019-12-18 18:14:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 18:14:38,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:38,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:38,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 856625615, now seen corresponding path program 1 times [2019-12-18 18:14:38,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:38,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705262623] [2019-12-18 18:14:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:38,121 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-18 18:14:38,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705262623] [2019-12-18 18:14:38,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:38,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:14:38,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300402962] [2019-12-18 18:14:38,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:14:38,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:14:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:14:38,124 INFO L87 Difference]: Start difference. First operand 3137 states and 7692 transitions. Second operand 4 states. [2019-12-18 18:14:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:38,151 INFO L93 Difference]: Finished difference Result 3830 states and 9227 transitions. [2019-12-18 18:14:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:14:38,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-18 18:14:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:38,153 INFO L225 Difference]: With dead ends: 3830 [2019-12-18 18:14:38,154 INFO L226 Difference]: Without dead ends: 764 [2019-12-18 18:14:38,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:14:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-18 18:14:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-12-18 18:14:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-18 18:14:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1638 transitions. [2019-12-18 18:14:38,165 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1638 transitions. Word has length 59 [2019-12-18 18:14:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:38,165 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1638 transitions. [2019-12-18 18:14:38,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:14:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1638 transitions. [2019-12-18 18:14:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 18:14:38,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:38,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:38,168 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1805007936, now seen corresponding path program 1 times [2019-12-18 18:14:38,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:38,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909211446] [2019-12-18 18:14:38,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:38,312 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-18 18:14:38,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909211446] [2019-12-18 18:14:38,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:38,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:14:38,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869632760] [2019-12-18 18:14:38,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:14:38,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:38,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:14:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:14:38,315 INFO L87 Difference]: Start difference. First operand 764 states and 1638 transitions. Second operand 8 states. [2019-12-18 18:14:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:38,603 INFO L93 Difference]: Finished difference Result 2344 states and 4930 transitions. [2019-12-18 18:14:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:14:38,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 18:14:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:38,606 INFO L225 Difference]: With dead ends: 2344 [2019-12-18 18:14:38,606 INFO L226 Difference]: Without dead ends: 1622 [2019-12-18 18:14:38,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:14:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-18 18:14:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 895. [2019-12-18 18:14:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-18 18:14:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1903 transitions. [2019-12-18 18:14:38,623 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1903 transitions. Word has length 59 [2019-12-18 18:14:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:38,623 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1903 transitions. [2019-12-18 18:14:38,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:14:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1903 transitions. [2019-12-18 18:14:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 18:14:38,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:38,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:38,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1971095894, now seen corresponding path program 2 times [2019-12-18 18:14:38,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:38,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030396994] [2019-12-18 18:14:38,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:38,780 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-18 18:14:38,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030396994] [2019-12-18 18:14:38,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:38,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:14:38,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750285361] [2019-12-18 18:14:38,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:14:38,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:38,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:14:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:14:38,782 INFO L87 Difference]: Start difference. First operand 895 states and 1903 transitions. Second operand 10 states. [2019-12-18 18:14:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:39,640 INFO L93 Difference]: Finished difference Result 1887 states and 4038 transitions. [2019-12-18 18:14:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:14:39,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 18:14:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:39,643 INFO L225 Difference]: With dead ends: 1887 [2019-12-18 18:14:39,644 INFO L226 Difference]: Without dead ends: 1887 [2019-12-18 18:14:39,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:14:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-12-18 18:14:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1023. [2019-12-18 18:14:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-12-18 18:14:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2214 transitions. [2019-12-18 18:14:39,658 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2214 transitions. Word has length 59 [2019-12-18 18:14:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:39,658 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 2214 transitions. [2019-12-18 18:14:39,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:14:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2214 transitions. [2019-12-18 18:14:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 18:14:39,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:39,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:14:39,660 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1333119268, now seen corresponding path program 3 times [2019-12-18 18:14:39,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:39,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539174653] [2019-12-18 18:14:39,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:39,744 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-18 18:14:39,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539174653] [2019-12-18 18:14:39,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:39,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:14:39,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098635783] [2019-12-18 18:14:39,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:14:39,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:39,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:14:39,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:14:39,746 INFO L87 Difference]: Start difference. First operand 1023 states and 2214 transitions. Second operand 6 states. [2019-12-18 18:14:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:40,167 INFO L93 Difference]: Finished difference Result 1310 states and 2782 transitions. [2019-12-18 18:14:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:14:40,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 18:14:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:40,170 INFO L225 Difference]: With dead ends: 1310 [2019-12-18 18:14:40,170 INFO L226 Difference]: Without dead ends: 1310 [2019-12-18 18:14:40,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:14:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-18 18:14:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1029. [2019-12-18 18:14:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-18 18:14:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2225 transitions. [2019-12-18 18:14:40,183 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2225 transitions. Word has length 59 [2019-12-18 18:14:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:40,183 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2225 transitions. [2019-12-18 18:14:40,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:14:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2225 transitions. [2019-12-18 18:14:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 18:14:40,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:40,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:40,185 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -320938732, now seen corresponding path program 4 times [2019-12-18 18:14:40,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:40,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293797397] [2019-12-18 18:14:40,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:14:40,253 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-18 18:14:40,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293797397] [2019-12-18 18:14:40,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:14:40,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:14:40,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017054608] [2019-12-18 18:14:40,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:14:40,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:14:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:14:40,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:14:40,255 INFO L87 Difference]: Start difference. First operand 1029 states and 2225 transitions. Second operand 3 states. [2019-12-18 18:14:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:14:40,270 INFO L93 Difference]: Finished difference Result 1028 states and 2223 transitions. [2019-12-18 18:14:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:14:40,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 18:14:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:14:40,273 INFO L225 Difference]: With dead ends: 1028 [2019-12-18 18:14:40,273 INFO L226 Difference]: Without dead ends: 1028 [2019-12-18 18:14:40,273 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-18 18:14:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-12-18 18:14:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 902. [2019-12-18 18:14:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-18 18:14:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1983 transitions. [2019-12-18 18:14:40,289 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1983 transitions. Word has length 59 [2019-12-18 18:14:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:14:40,289 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1983 transitions. [2019-12-18 18:14:40,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:14:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1983 transitions. [2019-12-18 18:14:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 18:14:40,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:14:40,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:14:40,293 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:14:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:14:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1249946427, now seen corresponding path program 1 times [2019-12-18 18:14:40,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:14:40,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729521815] [2019-12-18 18:14:40,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:14:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:14:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:14:40,429 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:14:40,431 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:14:40,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff0_thd2~0_427) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= v_~y$read_delayed~0_6 0) (= v_~y$r_buff1_thd1~0_255 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1761~0.base_19| 4)) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1761~0.base_19|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1761~0.base_19|) (= v_~x~0_50 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1761~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1761~0.base_19|) |v_ULTIMATE.start_main_~#t1761~0.offset_14| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_49) (= |v_ULTIMATE.start_main_~#t1761~0.offset_14| 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1761~0.base_19| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ULTIMATE.start_main_~#t1761~0.base=|v_ULTIMATE.start_main_~#t1761~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_~#t1762~0.base=|v_ULTIMATE.start_main_~#t1762~0.base_17|, ULTIMATE.start_main_~#t1762~0.offset=|v_ULTIMATE.start_main_~#t1762~0.offset_15|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, ULTIMATE.start_main_~#t1761~0.offset=|v_ULTIMATE.start_main_~#t1761~0.offset_14|, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1761~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1762~0.base, ULTIMATE.start_main_~#t1762~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1761~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:14:40,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (= |v_ULTIMATE.start_main_~#t1762~0.offset_10| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1762~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1762~0.base_11|) 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1762~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1762~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1762~0.base_11|) |v_ULTIMATE.start_main_~#t1762~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1762~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1762~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1762~0.base=|v_ULTIMATE.start_main_~#t1762~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t1762~0.offset=|v_ULTIMATE.start_main_~#t1762~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1762~0.base, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1762~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 18:14:40,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~y$w_buff0~0_41) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= 0 (mod v_~y$w_buff1_used~0_78 256)) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:14:40,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1796909870 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1796909870 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out1796909870| |P1Thread1of1ForFork1_#t~ite28_Out1796909870|))) (or (and (= ~y$w_buff1~0_In1796909870 |P1Thread1of1ForFork1_#t~ite28_Out1796909870|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~y$w_buff0~0_In1796909870 |P1Thread1of1ForFork1_#t~ite28_Out1796909870|) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1796909870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1796909870, ~y$w_buff0~0=~y$w_buff0~0_In1796909870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1796909870} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1796909870|, ~y$w_buff1~0=~y$w_buff1~0_In1796909870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1796909870, ~y$w_buff0~0=~y$w_buff0~0_In1796909870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1796909870, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1796909870|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 18:14:40,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_13|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 18:14:40,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1956186520 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1956186520| ~y$mem_tmp~0_In1956186520)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1956186520| ~y~0_In1956186520)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1956186520, ~y$flush_delayed~0=~y$flush_delayed~0_In1956186520, ~y~0=~y~0_In1956186520} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1956186520, ~y$flush_delayed~0=~y$flush_delayed~0_In1956186520, ~y~0=~y~0_In1956186520, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1956186520|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 18:14:40,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In154928106 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out154928106| ~y~0_In154928106)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out154928106| ~y$mem_tmp~0_In154928106)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In154928106, ~y$flush_delayed~0=~y$flush_delayed~0_In154928106, ~y~0=~y~0_In154928106} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In154928106, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out154928106|, ~y$flush_delayed~0=~y$flush_delayed~0_In154928106, ~y~0=~y~0_In154928106} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 18:14:40,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 18:14:40,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-161679481 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-161679481 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-161679481 |P1Thread1of1ForFork1_#t~ite51_Out-161679481|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-161679481|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-161679481, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161679481} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-161679481, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-161679481|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161679481} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 18:14:40,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1965289226 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1965289226 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1965289226 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1965289226 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out1965289226| 0)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out1965289226| ~y$w_buff1_used~0_In1965289226) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1965289226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965289226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1965289226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965289226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1965289226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1965289226, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1965289226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1965289226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965289226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 18:14:40,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In314959911 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In314959911 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out314959911 ~y$r_buff0_thd2~0_In314959911) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out314959911 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In314959911, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In314959911} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out314959911|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In314959911, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out314959911} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:14:40,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1599784457 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1599784457 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1599784457 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1599784457 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1599784457 |P1Thread1of1ForFork1_#t~ite54_Out1599784457|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1599784457|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1599784457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1599784457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1599784457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599784457} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1599784457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1599784457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1599784457, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1599784457|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599784457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 18:14:40,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:14:40,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:14:40,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1725873235 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1725873235 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1725873235 |ULTIMATE.start_main_#t~ite57_Out1725873235|) (not .cse1)) (and (= ~y~0_In1725873235 |ULTIMATE.start_main_#t~ite57_Out1725873235|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1725873235, ~y~0=~y~0_In1725873235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1725873235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725873235} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1725873235, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1725873235|, ~y~0=~y~0_In1725873235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1725873235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725873235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 18:14:40,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-18 18:14:40,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1241528396 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1241528396 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1241528396| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1241528396| ~y$w_buff0_used~0_In1241528396)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1241528396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241528396} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1241528396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241528396, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1241528396|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 18:14:40,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In591691795 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In591691795 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In591691795 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In591691795 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out591691795| ~y$w_buff1_used~0_In591691795) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite60_Out591691795| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In591691795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591691795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591691795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591691795} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out591691795|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591691795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591691795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591691795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591691795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 18:14:40,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1271663383 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1271663383 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1271663383 |ULTIMATE.start_main_#t~ite61_Out1271663383|)) (and (= |ULTIMATE.start_main_#t~ite61_Out1271663383| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1271663383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1271663383} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1271663383|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1271663383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1271663383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 18:14:40,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-804447794 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-804447794 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-804447794 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-804447794 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-804447794| ~y$r_buff1_thd0~0_In-804447794) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite62_Out-804447794| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-804447794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804447794, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804447794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804447794} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-804447794|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-804447794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804447794, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804447794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804447794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 18:14:40,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:14:40,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:14:40 BasicIcfg [2019-12-18 18:14:40,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:14:40,594 INFO L168 Benchmark]: Toolchain (without parser) took 28434.74 ms. Allocated memory was 136.3 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 99.5 MB in the beginning and 716.7 MB in the end (delta: -617.2 MB). Peak memory consumption was 468.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,594 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.88 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.1 MB in the beginning and 154.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 150.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,599 INFO L168 Benchmark]: Boogie Preprocessor took 40.74 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 148.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,599 INFO L168 Benchmark]: RCFGBuilder took 1002.29 ms. Allocated memory is still 200.8 MB. Free memory was 148.6 MB in the beginning and 95.3 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,604 INFO L168 Benchmark]: TraceAbstraction took 26435.50 ms. Allocated memory was 200.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 95.3 MB in the beginning and 716.7 MB in the end (delta: -621.4 MB). Peak memory consumption was 399.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:14:40,610 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.45 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 878.88 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.1 MB in the beginning and 154.3 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 150.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.74 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 148.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1002.29 ms. Allocated memory is still 200.8 MB. Free memory was 148.6 MB in the beginning and 95.3 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26435.50 ms. Allocated memory was 200.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 95.3 MB in the beginning and 716.7 MB in the end (delta: -621.4 MB). Peak memory consumption was 399.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 178 ProgramPointsBefore, 102 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9537 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 279 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 121847 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1761, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1762, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y 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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) 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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2925 SDtfs, 3327 SDslu, 5355 SDs, 0 SdLazy, 2823 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37509occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 16756 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 76241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...